arXiv AI June 12, 2026 By Davide Ferre' (CNRS, COATI, UniCA, I3S), Fr\'ed\'eric Giroire (I3S, COATI, UniCA), Frederik Mallmann-Trenn (CNRS, COATI, I3S, UniCA), Emanuele Natale (CNRS, COATI, I3S, UniCA)

Structured vs. Unstructured Pruning: An Exponential Gap

Read the original on arXiv AI →

arXiv:2603. 02234v3 Announce Type: replace-cross Abstract: The Strong Lottery Ticket Hypothesis (SLTH) states that large, randomly initialized neural networks contain sparse subnetworks capable of approximating a target function at initialization without training, suggesting that pruning alone is sufficient.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI

Jun 9

Structured Neuron Pruning in Deep Neural Networks Using Multi-Armed Bandits

arXiv:2606. 07615v1 Announce Type: cross Abstract: Deep neural networks often contain redundant hidden units.

By Salem Ameen, Sunil Vadera

reinforcement-learning efficiency benchmarks

Hugging Face Trending Papers

Jun 10

Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

Neural network pruning reduces model size by removing less important parameters while aiming to preserve predictive performance. Although the Lottery Ticket Hypothesis (LTH) shows that sparse subnetworks can match dense networks when trained from suitable initializations, its iterative pruning procedure requires multiple complete training cycles.

efficiency

arXiv Machine Learning

Sep 23

Activation-Energy Pruning for Spiking Neural Networks: Unsupervised Personalization via Spike-Count Saliency

arXiv:2609.26167v1 Announce Type: new Abstract: Activation-energy pruning -- removing weights whose product of magnitude and cumulative pre-synaptic spike count falls below a threshold -- was establi...

By Joseph Bingham

efficiency benchmarks

arXiv Machine Learning

Jun 11

Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

arXiv:2606. 12278v1 Announce Type: cross Abstract: Neural network pruning reduces model size by removing less important parameters while aiming to preserve predictive performance.

By Romana Qureshi, Hafida Benhidour, Said Kerrache, Nahlah Aljeraisy

efficiency

arXiv Machine Learning

Jun 30

HiAP: A Multi-Granular Stochastic Auto-Pruning Framework for Vision Transformers

arXiv:2603. 12222v2 Announce Type: replace-cross Abstract: Vision Transformers require significant computational resources and memory bandwidth, severely limiting their deployment on resource-constraint hardware.

By Andy Li, Aiden Durrant, Milan Markovic, Georgios Leontidis

llms fine-tuning efficiency

arXiv Machine Learning

Jul 7

A Unified Framework for Quantized and Continuous Strong Lottery Tickets

arXiv:2607. 03860v1 Announce Type: new Abstract: The Strong Lottery Ticket Hypothesis (SLTH) asserts that sufficiently overparameterized, randomly initialized neural networks contain sparse subnetworks that, even without any training, can match the performance of a small trained network on a given dataset.

By Aakash Kumar, Emanuele Natale

efficiency

One email a morning, machine-written

Related stories

Structured Neuron Pruning in Deep Neural Networks Using Multi-Armed Bandits

Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

Activation-Energy Pruning for Spiking Neural Networks: Unsupervised Personalization via Spike-Count Saliency

Finding Sparse Subnetworks in One Training Cycle via Progressive Magnitude-Based Pruning

HiAP: A Multi-Granular Stochastic Auto-Pruning Framework for Vision Transformers

A Unified Framework for Quantized and Continuous Strong Lottery Tickets