ML: Normalization

Machine-learning ideas tagged Normalization in the ML taxonomy of the Math2NN corpus.

△ Mechanism confirmed, baseline not beaten 2026

Dimension-Free Brenier Transport Layer

Build a neural transport layer by parameterizing a convex potential whose gradient maps a semi-log-concave latent distribution into a compact convex data domain. Use the paper's dimension-free Lipschitz certificate to set the layer's Jacobian scale, initialize the potential, and reject or regularize parameter updates that create excessive curvature. The goal is a bounded-output transport module that is less sensitive to latent dimension than diameter-based spectral heuristics.

Useful7/10
Difficulty6/10
Novelty7/10
Paper: Dimension-Free Lipschitz Bounds for Brenier Maps to Compactly Supported Log-Concave Targets arXiv:2608.15906
Unverified 2026

Pivot-safe discrete LU initialization

Initialize an invertible neural linear layer from a bounded discrete random matrix only after checking that every leading principal submatrix is nonsingular and that its LU growth factor is below a prescribed threshold. This replaces blind random initialization with a cheap resampling rule designed to prevent zero pivots and excessive finite-precision amplification in reversible or flow-based networks.

Useful6/10
Difficulty4/10
Novelty7/10
Paper: LU Factorization of Discrete Random Matrices arXiv:2608.08998
Unverified 2026

Gain-aligned branch shunting

Replace an additive nonnegative feature readout by several local divisive branches, where each branch divides a signal pathway by a positive pool chosen to estimate shared multiplicative gain. Initialize or constrain each pool toward the dominant nuisance covariance direction while retaining an additive bypass so the model can reject harmful normalization. This should improve robustness when nuisance gain is shared across features, but not when the pool support is shuffled or its measurements…

Useful6/10
Difficulty5/10
Novelty5/10
Paper: When Branch-Local Shunting Helps: A Gain-Load-Alignment Principle for Dendritic E/I Networks arXiv:2607.24990
Unverified 2026

Spectral-gap-aware Jacobi whitening

Replace magnitude-only pivot selection in an approximate symmetric eigensolver with a perturbation score that divides squared off-diagonal coupling by the spectral gap between the associated diagonal entries. In covariance whitening or second-order preconditioning, this should spend a limited number of rotations resolving nearly degenerate eigenspaces while ignoring harmless couplings between well-separated modes.

Useful6/10
Difficulty5/10
Novelty6/10
Paper: Accelerating preconditioned Jacobi methods via perturbation-inspired pivoting arXiv:2607.23187
Unverified 2026

Sharp thin-shell representation regularizer

Add a radial-fluctuation penalty to a feature layer after explicitly centering and whitening its activations across the minibatch. The paper supplies an interpretable threshold, eight times the feature dimension, for the variance of squared feature norms. The penalty activates only when empirical radial variance exceeds that threshold, avoiding unnecessary pressure toward constant-norm representations.

Useful5/10
Difficulty5/10
Novelty6/10
Paper: Digesting the proof of the sharp thin-shell inequality arXiv:2607.23307