mlsanityData to 7 Oct 2026

LaPrune: Controllable Differentiable Sparsity at Million Scale

arXiv 2608.04057 ↗First posted 4 Aug 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 15 of its 19 references that are in the map. First posted on arXiv 4 Aug 2026.

Builds on

15 of 19 references.

References · 15

  1. 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
  2. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  3. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
  4. 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
  5. 2013k-Sparse Autoencoderscited by 209
  6. 2020Fast Differentiable Sorting and Rankingcited by 196
  7. 2019Sparse Sequence-to-Sequence Modelscited by 167
  8. 2019Stochastic Optimization of Sorting Networks via Continuous Relaxationscited by 111
  9. 2020Learning with Differentiable Perturbed Optimizerscited by 81
  10. 2019Reparameterizable Subset Sampling via Continuous Relaxationscited by 69
  11. 2020SoftSort: A Continuous Relaxation for the argsort Operatorcited by 66
  12. 2021Differentiable Sorting Networks for Scalable Sorting and Ranking Supervisioncited by 31
3 more
  1. 2023Fast, Differentiable and Sparse Top-k: a Convex Analysis Perspectivecited by 26
  2. 2020Differentiable Top-k Operator with Optimal Transportcited by 17
  3. 2025LapSum -- One Method to Differentiate Them All: Ranking, Sorting and Top-k Selectioncited by 12

Built on by

Not cited yet.