Overview

Sparse neural networks study how to train, prune, or route models so that only selected weights, connections, features, or computations are active. Approaches include magnitude- and saliency-based pruning, dynamic sparse training that regrows connections, structured sparsity and feature-selection penalties, and sparsity-inducing Bayesian priors. The goal is to reduce memory and training or inference costs while retaining accuracy, across settings such as edge devices, federated learning, and large language models. Fewer parameters do not automatically mean faster execution or more interpretable models: hardware-aware layouts and kernels matter, while accuracy, robustness, and efficiency at extreme sparsity remain in tension.

Latest papers

CardsList

66 papers10 papers in the last four weeks, up 233% on the four weeks before. 0.1% of all new papers.

  1. Bayesian Lottery Ticket Hypothesis

    Feb 21, 2026Nicholas Kuhn, Arvid Weyrauch, Lars Heyen +3Lottery Ticket HypothesisSparse Neural Networks

  2. Hebbian-Oscillatory Co-Learning

    Feb 21, 2026Hasi HaysSparse Neural NetworksOscillatory Neural Networks

  3. Fine-Pruning: A Biologically Inspired Algorithm for Personalization of Machine Learning Models

    Feb 18, 2026Joseph Bingham, Saman Zonouz, Dvir AranNeural Network PruningSparse Neural Networks

  4. Hyperflux: Pruning Reveals Importance

    Apr 6, 2025Eugen Barbulescu, Antonio Alexoaie, Lucian BusoniuSparse Neural NetworksNeural Network Training Dynamics