LaPrune Enables Controllable Differentiable Sparsity for Large Models

Jakub Antczak, Joanna Wojciechowicz, {\L}ukasz Struski, Jacek Tabor· August 6, 2026 View original

Key takeaways

  • LaPrune provides controllable, differentiable sparsity for large models.
  • It preserves selected mass while controlling the normalized second moment of the mask.
  • The method moves masks towards hard top-k selection without blocking gradients.
  • Its normalized hardness parameter is invariant to score scale, offering stable control.

Who benefits

AI/ML DevelopmentCloud ComputingData CentersEdge AI

Summary

LaPrune introduces a novel differentiable layer that allows for controllable sparsity in large models by preserving selected mass and constraining the normalized second moment, moving masks towards hard top-k selection.

In sparse models, top-k selection is crucial for determining active components, but traditional hard selection methods hinder gradient flow. While continuous relaxations exist, they often tie mask hardness to the selected mass, limiting fine-grained control. This research presents LaPrune, a new differentiable layer designed to address these limitations. LaPrune offers mathematically exact-budget differentiable sparsity. It controls the normalized second moment of the mask while precisely preserving the selected mass. A key component is the LapSum barrier, which maintains the selection mass, while a normalized second-moment constraint progressively shifts the mask from a dense, equal-mass allocation towards a hard top-k selection at each budget level. The paper provides a population prediction for the saturated fraction, a near-binary limiting law, and a tight worst-case guarantee on the near-zero fraction. Crucially, LaPrune's normalized hardness parameter is invariant to score scale, unlike fixed LapSum temperatures. This innovation provides more stable and controllable sparsity for large-scale models.

Why it matters

AI engineers can achieve more precise and stable control over model sparsity, leading to more efficient and performant large language models and other deep learning architectures without sacrificing gradient flow during training.

How to implement this in your domain

  1. 1Evaluate existing sparse model training pipelines for limitations in gradient flow due to hard top-k selection.
  2. 2Integrate LaPrune's differentiable layer into neural network architectures requiring controlled sparsity.
  3. 3Experiment with LaPrune's normalized hardness parameter to fine-tune the trade-off between density and hard top-k selection.
  4. 4Apply LaPrune to large-scale models to reduce computational footprint and memory usage while maintaining performance.
  5. 5Benchmark the efficiency and accuracy gains compared to traditional sparsity methods.

Original post by Jakub Antczak, Joanna Wojciechowicz, {\L}ukasz Struski, Jacek Tabor

"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 exa…"

View on X

Originally posted by Jakub Antczak, Joanna Wojciechowicz, {\L}ukasz Struski, Jacek Tabor on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses