activity
20132026
most citedQSGD: Communication-Efficient SGD via Gradient Quantization and Encoding

908 citations · 2.4k across the 149 of their papers we have counts for

collaborators
Showing cs.LGShow all

92 papers · 1 filter

cs.LG2026

GA-SVD: Generation-aware Singular Value Decomposition for LLM Compression

Shengkun Tang, Cong Zeng, Zongfang Liu +2

Large language models (LLMs) demonstrate strong generalization across a broad range of reasoning and generation tasks, but their large parameter counts impose substantial memory an…

cs.LG2026

WUSPruner: Second-Moment-Optimal Transforms for Structured Pruning

Shengkun Tang, Dan Alistarh, Zhiqiang Shen

Structured pruning is typically formulated as identifying which model dimensions to remove, often within the model's original representation. However, the effect of coordinate dele…

cs.LG2026

Q-PACE: Dynamic Precision Allocation for Quantization-Aware Training

Alexandra Volkova, Matin Ansaripour, Erik Schultheis +2

Quantization-aware training (QAT) leverages lower-precision arithmetic to reduce the cost of LLM deployment, but aggressive quantization degrades final model performance. A common…

cs.LG2026

WUSH-KV: KV Cache Quantization with Data-Adaptive Transforms

Jiale Chen, Vage Egiazarian, Eldar Kurtić +2

KV cache memory and bandwidth costs grow with context length and batch size, which limits efficient long-context inference. To address this bottleneck, we introduce WUSH-KV for low…

cs.LG2026

Disaggregated Quantization: Specializing LLM Prefill and Decode

Andrei Panferov, Maximilian Kleinegger, Sweta Priyadarshi +2

Prefill and decode reward different approaches to quantization: low-precision arithmetic accelerates prompt processing, while compact weights reduce memory traffic during generatio…

cs.LG2026

The Sparsity Whisperer

Linghao Kong, Inimai Subramanian, Micah Adler +3

Pruning reduces the inference cost of large language models, but existing criteria primarily preserve large activations or reconstruct layer outputs. We argue that this overlooks a…

cs.LG2026

Apertus LLM Family Expansion via Distillation and Quantization

Andrei Panferov, Davit Melikidze, Martin Jaggi +1

The wide adoption of LLMs has led to their use in great variety of applications and scenarios, such as chatbot assistants and data annotation, creating the need for the models to s…

cs.LG2026

Grid Games: The Power of Multiple Grids for Quantizing Large Language Models

Vage Egiazarian, Erik Schultheis, Andrei Panferov +3

A major recent advance in quantization is given by microscaled 4-bit formats such as NVFP4 and MXFP4, quantizing values into small groups sharing a scale, assuming a fixed floating…

cs.LG2026

Model Compression with Exact Budget Constraints via Riemannian Manifolds

Michael Helcig, Dan Alistarh

Assigning one of K options to each of N groups under a total cost budget is a recurring problem in efficient AI, arising in mixed-precision quantization, non-uniform pruning, and e…

cs.LG2026

Statistically-Lossless Quantization of Large Language Models

Michael Helcig, Eldar Kurtic, Dan Alistarh

Model quantization has become essential for efficient large language model deployment, yet existing approaches present clear trade-offs: methods such as GPTQ and AWQ achieve practi…

cs.LG2026

Towards Robust Scaling Laws for Optimizers

Alexandra Volkova, Mher Safaryan, Christoph H. Lampert +1

The quality of Large Language Model (LLM) pretraining depends on multiple factors, including the compute budget and the choice of optimization algorithm. Empirical scaling laws are…

cs.LG2026

MatGPTQ: Efficient and Accurate Inference over Nested Quantized Models

Maximilian Kleinegger, Elvir Crnčević, Dan Alistarh

Matryoshka Quantization (MatQuant), Any-Precision-LLM (AP) and AnyBCQ (AB) are recent quantization approaches showing that a single integer-quantized model can be served across mul…

cs.LG2026

LoRDO: Distributed Low-Rank Optimization with Infrequent Communication

Andrej Jovanović, Alex Iacob, Mher Safaryan +6

Distributed training of foundation models via is limited by interconnect bandwidth. While infrequent communication strategies reduce synchronization frequency, they…

cs.LG2026

DASH: Faster Shampoo via Batched Block Preconditioning and Efficient Inverse-Root Solvers

Ionut-Vlad Modoranu, Philip Zmushko, Erik Schultheis +2

Shampoo is one of the leading approximate second-order optimizers: a variant of it has won the MLCommons AlgoPerf competition, and it has been shown to produce models with lower ac…

cs.LG2026

Behemoth: Benchmarking Unlearning in LLMs Using Fully Synthetic Data

Eugenia Iofinova, Dan Alistarh

As artificial neural networks, and specifically large language models, have improved rapidly in capabilities and quality, they have increasingly been deployed in real-world applica…

cs.LG2026

Quartet II: Accurate LLM Pre-Training in NVFP4 by Improved Unbiased Gradient Estimation

Andrei Panferov, Erik Schultheis, Soroush Tabesh +1

The NVFP4 lower-precision format, supported in hardware by NVIDIA Blackwell GPUs, promises to allow, for the first time, end-to-end fully-quantized pre-training of massive models s…

cs.LG2025

WUSH: Near-Optimal Adaptive Transforms for LLM Quantization

Jiale Chen, Vage Egiazarian, Roberto L. Castro +2

Quantizing LLM weights and activations is a standard approach for efficient deployment, but a few extreme outliers can stretch the dynamic range and amplify low-bit quantization er…

cs.LG2025

Beyond Outliers: A Study of Optimizers Under Quantization

Georgios Vlassis, Saleh Ashkboos, Alexandra Volkova +2

As new optimizers gain traction and model quantization becomes standard for efficient deployment, a key question arises: how does the choice of optimizer affect model performance i…

cs.LG2025

CAGE: Curvature-Aware Gradient Estimation For Accurate Quantization-Aware Training

Soroush Tabesh, Mher Safaryan, Andrei Panferov +2

Despite significant work on low-bit quantization-aware training (QAT), there is still an accuracy gap between such techniques and native training. To address this, we introduce CAG…

cs.LG2025

Expand Neurons, Not Parameters

Linghao Kong, Inimai Subramanian, Yonadav Shavit +3

This work demonstrates how increasing the number of neurons in a network without increasing its total number of non-zero parameters improves performance. We show that this gain cor…

cs.LG2025

The Unseen Frontier: Pushing the Limits of LLM Sparsity with Surrogate-Free ADMM

Kwanhee Lee, Hyeondo Jang, Dongyeop Lee +2

Neural network pruning is a promising technique to mitigate the excessive computational and memory requirements of large language models (LLMs). Despite its promise, however, progr…

cs.LG2025

Bridging the Gap Between Promise and Performance for Microscaling FP4 Quantization

Vage Egiazarian, Roberto L. Castro, Denis Kuznedelev +8

The recent hardware-accelerated microscaling 4-bit floating-point formats such as MXFP4 and NVFP4, supported on NVIDIA and AMD GPUs, promise to revolutionize large language model (…

cs.LG2025

Optimizers Qualitatively Alter Solutions And We Should Leverage This

Razvan Pascanu, Clare Lyle, Ionut-Vlad Modoranu +6

Due to the nonlinear nature of Deep Neural Networks (DNNs), one can not guarantee convergence to a unique global minimum of the loss when using optimizers relying only on local inf…

cs.LG2025

The Geometry of LLM Quantization: GPTQ as Babai's Nearest Plane Algorithm

Jiale Chen, Yalda Shabanzadeh, Elvir Crnčević +2

Quantizing the weights of large language models (LLMs) from 16-bit to lower bitwidth is the de facto approach to deploy massive transformers onto more affordable accelerators. Whil…