math.AGSep 3, 2026

Grassmann--Plücker Parametrization of Convolutional Filter Subspaces: Regularity and Closed Embeddings

Authors: Hongyu YuanHuaiqing Zuo

Abstract

We propose a geometric parametrization of the filters in a single convolutional layer: the parameter is no longer an ordered family of filter vectors, but a fixed-dimensional subspace of the filter space. For one-dimensional finite-stride convolution, the filter-to-convolution-operator correspondence gives an injective linear map C:KH\mathcal{C}:\mathcal{K}\to H. This map sends filter subspaces in Gr(q,K)\mathrm{Gr}(q,\mathcal{K}) to operator subspaces in Gr(q,H)\mathrm{Gr}(q,H); composing it with the Plücker embedding yields a projective parametrization Φ:Gr(q,K)P(qH)Φ:\mathrm{Gr}(q,\mathcal{K})\to\mathbb{P}(\bigwedge^q H). Using TUGr(q,K)Hom(U,K/U)T_U\mathrm{Gr}(q,\mathcal{K})\cong\mathrm{Hom}(U,\mathcal{K}/U), we compute the differential of the induced Grassmannian map and show that the differential of ΦΦ is injective at every point. We then use the vanishing equations for Plücker coordinates and standard affine coordinates on a Grassmannian to prove that Gr(q,C(K))Gr(q,H)\mathrm{Gr}(q,\mathcal{C}(\mathcal{K}))\hookrightarrow\mathrm{Gr}(q,H) is a closed embedding, and hence that ΦΦ is a closed embedding. Consequently, the parameter space is isomorphic to its projective image, the parametrization is finite and birational onto its image, every fiber is a singleton, and the resulting projective neural variety is smooth. For k=4k=4 and q=2q=2, we also use Singular to recover the image ideal and check its dimension, degree, chart rank, and smoothness. This computation illustrates, rather than replaces, the general proof. Finally, we discuss possible connections with filter redundancy and low-rank convolution, while distinguishing the proved geometric results from application proposals requiring numerical validation.

Explore similar work

Aug 4, 2026cs.LG

Random features for Grassmannian kernel approximation with bounded rank-one projections

We propose a family of random feature maps for scalable kernel machines on low-dimensional subspaces, ie on the Grassmannian manifold. Such representations are useful when data classes or clusters are well described by the span of a few samples. Classical Grassmannian kernels, including the projection and Binet-Cauchy kernels, require full Gram matrices, which leads to prohibitive computational and memory costs for large high-dimensional subspace datasets. We address this limitation using random features based on rank-one projections of subspace projection matrices followed by bounded non-linear transforms, either periodic or binary, to control the resulting distributions. We show that inner products in the random feature space approximate well-defined rotation-invariant Grassmannian kernels that depend only on the principal angles between subspaces. When the number of features is sufficiently large relative to the intrinsic subspace dimension, the approximation holds uniformly over all fixed-dimensional subspaces with high probability. For periodic transforms, the approximated kernel has a closed-form expression with tunable behaviour between inverse Binet-Cauchy and Gaussian-type regimes. Binary transforms yield compact one-bit subspace features, although no closed-form kernel is known. Structured rank-one projections based on randomised fast Fourier transforms further reduce computation without sacrificing practical accuracy. Experiments on synthetic data and ETH-80 classification tasks show that these features accurately preserve Grassmannian geometry while reducing computation, memory, and storage. Rank-one embeddings therefore provide a practical and scalable alternative to classical Grassmannian kernels.
Rémi Delogne, Laurent Jacques
May 5, 2026cs.LG

Most ReLU Networks Admit Identifiable Parameters

We study the realization map of deep ReLU networks, focusing on when a function determines its parameters up to scaling and permutation. To analyze hidden redundancies beyond these standard symmetries, we introduce a framework based on weighted polyhedral complexes. Our main result shows that for every architecture whose input and hidden layers have width at least two, there exists an open set of identifiable parameters. This implies that the functional dimension of every such architecture is exactly the number of parameters minus the number of hidden neurons. We further show that minimal functional representations can still have non-trivial parameter redundancies. Finally, we establish a generic depth hierarchy, whereby for an open set of parameters the realized function cannot be represented generically by any shallower network.
Moritz Grillo, Guido Montúfar
Sep 14, 2026cs.CG

Low-Dimensional Embeddings for Gaussian Kernels on Manifolds

The Gaussian kernel is a widely used similarity measure underlying kernel methods such as kernel PCA and spectral clustering, but computing Gaussian kernel distances for many pairs of points can be expensive. Using Random Fourier Features (RFF), Chen and Phillips [ALT 2017] showed that for points in a dd-dimensional Euclidean ball in RN{\mathbb R}^N, t=Ω((d/ε2)log(dR/ε))t=Ω((d/\varepsilon^2)\log(dR/\varepsilon)) features suffice to preserve all pairwise Gaussian kernel distances within a (1±ε)(1\pm\varepsilon) factor with high probability. We establish a uniform relative-error embedding theorem for the more general setting of an arbitrary positive-reach submanifold MRN\mathcal M\subset{\mathbb R}^N of intrinsic dimension dd. We show that t=O((d/ε2)log(vol(M)2N2d/(vol(B1d(0))2rch(M)2dε2d+1δ)))t=O((d/\varepsilon^2)\log(\operatorname{vol}(\mathcal M)^2N^{2d}/(\operatorname{vol}(B_1^d(0))^2\operatorname{rch}(\mathcal M)^{2d}\varepsilon^{2d+1}δ))), or approximately O((d2/ε2)(logN+log(1/(εδ))))O((d^2/\varepsilon^2)(\log N+\log(1/(\varepsilonδ)))), RFFs suffice, with probability 1δ1-δ, to preserve the Gaussian kernel distance between every pair of manifold points up to relative error ε\varepsilon. Thus the bound depends only logarithmically on the ambient dimension and on manifold parameters such as volume and reach, while retaining the 1/ε21/\varepsilon^2 Euclidean rate. We also prove a topological consequence: under the same RFF embedding, persistent homology is preserved in the sense that weighted Cech and Rips filtrations built from Gaussian kernel power distance are (1±ε)(1\pm\varepsilon_\star)-interleaved, where ε\varepsilon_\star accounts for both distance distortion and kernel-weight approximation.
Soumik Dutta, Kunal Dutta