Automatic Model-Order Selection for Nonnegative Matrix Factorization via Column $\ell_{2,0}$ Regularization
arXiv:2607.24193
2026
Architecture
1 ideas extracted · analyzed Aug 30, 2026
What the math gives to ML
The paper turns rank selection into optimization over an oversized factorization by penalizing entire paired columns with an exact column \(\ell_{2,0}\) penalty, rather than training separate models at different ranks. The transferable asset is a warm-started regularization path: increasing \(\lambda\) progressively deletes redundant latent directions while preserving the tensor dimensions and optimizer state. Its scale-balancing operation removes the reciprocal-scaling ambiguity of factorized layers, making column norms meaningful for pruning and stabilizing the selection path. A direct neural-network experiment is to replace a dense or LoRA weight update by an initially overparameterized low-rank factorization, apply paired hard-threshold proximal updates, and select the smallest active rank meeting a validation-loss tolerance.
Ideas from this paper
△ Mechanism confirmed, baseline not beaten
2026
Parameterize a trainable weight update as \(\Delta W=UV^{\top}\) with an excessive initial rank \(r\), and penalize active columns using an exact column \(\ell_{2,0}\) penalty. Increase \(\lambda\) along a warm-started path and hard-delete redundant paired columns, producing an automatically selected rank without training a separate model for every candidate rank. Apply scale balancing after each update so pruning decisions are invariant to reciprocal rescaling of factor pairs.
Useful7/10
Difficulty5/10
Novelty6/10