arXiv Machine Learning July 22, 2026 By Abhishek Tyagi, Arjun Iyer, Liam Young, William H Renninger, Christopher Kanan, Yuhao Zhu

SHUFFLESPARSE: Learned Shuffles for Structured Sparse Networks

Read the original on arXiv Machine Learning →

arXiv:2510. 14812v2 Announce Type: replace Abstract: Structured weight sparsity accelerates training and inference on modern GPUs, but it trails unstructured dynamic sparse training (DST) in accuracy especially at extreme sparsity.

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 Machine Learning.

arXiv Machine Learning

Jun 10

SpenseGPT: Practical One-shot Pruning Enabling Sparse and Dense GEMMs for LLM Inference

arXiv:2606. 10445v1 Announce Type: new Abstract: Semi-structured 2:4 sparsity is widely supported by modern accelerators, providing up to a 2x theoretical speedup.

By Jaeseong Lee, Seung-won Hwang, Samyam Rajbhandari

llms efficiency

Hugging Face Trending Papers

Jun 9

SpenseGPT: Practical One-shot Pruning Enabling Sparse and Dense GEMMs for LLM Inference

Semi-structured 2:4 sparsity is widely supported by modern accelerators, providing up to a 2x theoretical speedup. However, its strict 50% sparsity constraint often causes non-negligible accuracy degradation under post-training pruning.

llms efficiency

arXiv Machine Learning

Jul 31

WIDE: Boosting Adaptive LLM Inference via Token-level Dynamic Width Pruning

arXiv:2607. 28418v1 Announce Type: cross Abstract: Pruning is a promising approach for improving the efficiency of LLMs.

By Haozhe Hu, Hao Wu, Peiran Yin, Chao Han, Yunpu Ma, Xiaoyu Shen

llms nlp efficiency benchmarks

arXiv AI

Jun 9

LEAP: Learnable End-to-End Adaptive Pruning of Large Language Models

arXiv:2605. 17289v2 Announce Type: replace-cross Abstract: Unstructured sparsity is now natively accelerated by recent GPU kernels and dataflow hardware, shifting the bottleneck from inference execution to the pruning algorithm.

By Mohammad Mozaffari, Younes Hourri, Mohammad Rastegari, Mahyar Najibi

llms efficiency benchmarks

arXiv Computer Vision

Sep 10

One Loop, Two Gains: Can Active Learning win the Lottery for Free?

arXiv:2609.10311v1 Announce Type: cross Abstract: The lottery ticket hypothesis posits the existence of winning tickets: sparse subnetworks that, when trained in isolation from their original initial...

By Benedikt Tscheschner, Eduardo Veas, Marc Masana

computer-vision fine-tuning efficiency

arXiv Machine Learning

Aug 27

Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms

The paper introduces Soft-OMP and Soft-IHT, permutation‑based variants of Orthogonal Matching Pursuit and Iterative Hard Thresholding that replace the non‑differentiable argsort with continuous soft‑sort operators. These differentiable algorithms enable the construction of fully trainable neural network architectures—OMP‑Net and IHT‑Net—while preserving the core greedy sparse recovery logic. The authors show both theoretically and numerically that the soft variants approximate their hard counterparts with controllable accuracy and can be extended to structured sparse recovery by learning structure‑aware weights.

By Sina Mohammad-Taheri, Matthew J. Colbrook, Simone Brugiapaglia

efficiency

One email a morning, machine-written

Related stories

SpenseGPT: Practical One-shot Pruning Enabling Sparse and Dense GEMMs for LLM Inference

SpenseGPT: Practical One-shot Pruning Enabling Sparse and Dense GEMMs for LLM Inference

WIDE: Boosting Adaptive LLM Inference via Token-level Dynamic Width Pruning

LEAP: Learnable End-to-End Adaptive Pruning of Large Language Models

One Loop, Two Gains: Can Active Learning win the Lottery for Free?

Deep greedy unfolding: Sorting out argsorting in greedy sparse recovery algorithms