On exact discretization of the $L_2$-norm in the space spanned by the first $N$ Rademacher functions
arXiv:2608.25058
2026
Architecture
2 ideas extracted · analyzed Aug 29, 2026
What the math gives to ML
The paper gives a constructive exact quadrature principle for the span of the first N Rademacher functions: an L2 norm can be recovered from only N or N+1 evaluations rather than all 2^N dyadic sign patterns. The transferable object is the weighted binary design A Lambda A^T = I_N, which is an exactly norm-preserving sketch for a known N-dimensional sign-feature subspace. This can replace dense or exhaustive evaluations of binary-feature modules with a fixed Hadamard-derived subset of rows, reducing memory and inference cost while preserving feature energy exactly. Exactness applies only to activations in the modeled Rademacher span, so experiments should measure both savings and approximation error outside that subspace.
Ideas from this paper
Unverified
Re-invented
2026
Build a fixed binary-sign feature layer whose evaluation can be restricted to N carefully selected sign patterns while preserving the squared L2 norm of every feature vector in the first-N Rademacher subspace exactly. Use a Hadamard matrix when order N exists; otherwise use N+1 patterns and positive weights satisfying the same isotropy equation.
Useful7/10
Difficulty5/10
Novelty5/10
Unverified
2026
Use the weighted quadrature identity as a training or inference constraint for a compressed activation path: retain only a minimal set of binary evaluations and compute normalization or residual-energy statistics exactly on the modeled Rademacher component. This provides a zero-variance alternative to random activation subsampling for the represented subspace.
Useful6/10
Difficulty4/10
Novelty6/10