aiqbench analysis
LaPrune introduces a novel differentiable layer enabling mathematically exact budget control during model sparsification, addressing gradient blocking issues inherent in hard selection methods. By decoupling mask hardness from selected mass through normalized second-moment constraints, this approach offers robust theoretical guarantees for scaling sparse models to millions of parameters without compromising training stability.
LaPrune: Controllable Differentiable Sparsity at Million Scale
arXiv:2608.04057v1 Announce Type: new Abstract: Top-$k$ selection determines which components of a sparse model remain active. Hard selection blocks gradients, while continuous relaxations often couple mask hardness to the selected mass. We introduce LaPrune, a mathematically exact-budget differentiable layer that controls the normalized second moment while preserving the selected mass. A LapSum barrier preserves the selection mass, and a normalized second-moment constraint moves the mask from a dense equal-mass allocation toward hard top-$k$ at each budget. We derive a population prediction of the saturated fraction, a near-binary limiting law, and a tight worst-case guarantee on the near-zero fraction. The normalized hardness parameter is invariant to score scale, while a fixed LapSum temperature is not.
Abstract:Top-$k$ selection determines which components of a sparse model remain active. Hard selection blocks gradients, while continuous relaxations often couple mask hardness to the selected mass. We introduce LaPrune, a mathematically exact-budget differentiable layer that controls the normalized second moment while preserving the selected mass. A LapSum barrier preserves the selection mass, and a normalized second-moment constraint moves the mask from a dense equal-mass allocation toward hard top-$k$ at each budget. We derive a population prediction of the saturated fraction, a near-binary limiting law, and a tight worst-case guarantee on the near-zero fraction. The normalized hardness parameter is invariant to score scale, while a fixed LapSum temperature is not.
Machine Learning (cs.LG); Artificial Intelligence (cs.AI)
arXiv:2608.04057 [cs.LG]
(or arXiv:2608.04057v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2608.04057 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 204 words
Related coverage
Fast LapSum: Exact Differentiable Top-$k$ at Million Scale
arXiv · Oct 1, 2026

Building Blocks for Foundation Model Training and Inference on AWS
Hugging Face · May 11, 2026

Netskope (NTSK) Q2 2027 Earnings Call Transcript
fool.com · Sep 10, 2026
Problems of Proliferation
LessWrong · Sep 29, 2026