Separation Capacity of Scattering Networks on Low-Dimensional Datasets

arXiv:2607.06048 2026 Regularization 1 ideas extracted · analyzed Aug 30, 2026

What the math gives to ML

The paper gives an exact geometric characterization of separation capacity: it is twice the smallest linear dimension occupied by the feature image on any positive-measure subset of the data. This identifies a concrete failure mode for neural representations that global variance metrics miss: a feature map may have high overall rank while collapsing large local or semantic subsets into low-dimensional subspaces. The most transferable construction is a local anti-collapse objective that maximizes the effective span dimension of feature vectors, especially for fixed-filter CNN or scattering-style encoders whose filters are the main design variables.

Ideas from this paper

Unverified 2026

Positive-Measure Span Regularizer

Regularize an encoder so that feature vectors from every substantial local data region occupy a well-conditioned, high-dimensional linear span. Instead of only maximizing global covariance rank, penalize low effective rank in many local batches or neighborhoods, approximating the paper's worst-positive-measure-set definition of separation capacity.

Useful6/10
Difficulty4/10
Novelty6/10
Paper: Separation Capacity of Scattering Networks on Low-Dimensional Datasets arXiv:2607.06048