mlsanityData to 14 Oct 2026

Grassmann--Pl"ucker Parametrization of Convolutional Filter Subspaces: Regularity and Closed Embeddings

arXiv 2609.03361 ↗First posted 3 Sep 2026math.AG cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

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:K→ H. This map sends filter subspaces in Gr(q,K) to operator subspaces in Gr(q,H); composing it with the Pl"ucker embedding yields a projective parametrization Phi:Gr(q,K)→mathbbP(bigwedgeq H). Using TUGr(q,K)congHom(U,K/U), we compute the differential of the induced Grassmannian map and show that the differential of Phi is injective at every point. We then use the vanishing equations for Pl"ucker coordinates and standard affine coordinates on a Grassmannian to prove that Gr(q,C(K))hookrightarrowGr(q,H) is a closed embedding, and hence that Phi 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=4 and q=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.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 7 of its 13 references that are in the map. First posted on arXiv 3 Sep 2026.

Builds on

7 of 13 references.

References · 7

  1. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 306
  2. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 284
  3. 2021A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groupscited by 187
  4. 2016Building Deep Networks on Grassmann Manifoldscited by 58
  5. 2021Geometry of Linear Convolutional Networkscited by 27
  6. 2023Function Space and Critical Points of Linear Convolutional Networkscited by 19
  7. 2024On the Geometry and Optimization of Polynomial Convolutional Networkscited by 11

Built on by

Not cited yet.