SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2510.01650 · ICLR · 2025

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

Dan Alistarh, Namhoon Lee, Dongyeop Lee, Kwanhee Lee, Hyeondo Jang, Ista

arXiv · PDF · Open in the Atlas

Code that ran

1 of 4 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 0 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 1 failure of our instrument; 3 no recorded run), measured 2026-11-22; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.

"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2510.01650.json · badge: /api/ran/2510.01650.svg

Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.

RepositoryRoleRan
log-postech/elsa canonical (classifier label)
classifier basis: census
1 ran · 3 no recorded run
FunctionStatusWhere it lives
find_layers Ran
ran; our contract draft was wrong, not the code
log-postech/elsa/lib/utils.py
pointer only (licence: NONE) · get_code("6644b68819429769")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, log-postech/elsa when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_dataset Not yet run
unverified (harvested, no recorded run)
log-postech/elsa/lib/data.py
pointer only (licence: NONE) · get_code("94fc9d5b353d22d8")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, log-postech/elsa when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

get_llm Not yet run
unverified (harvested, no recorded run)
log-postech/elsa/lib/utils.py
pointer only (licence: NONE) · get_code("e4eab462181ea68a")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, log-postech/elsa when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

get_loaders Not yet run
unverified (harvested, no recorded run)
log-postech/elsa/lib/data.py
pointer only (licence: NONE) · get_code("e2c3c36c497f9fe0")
How it ran

The body of this sample is withheld: GitHub detected no licence in this paper's repository, log-postech/elsa when it was checked. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. No invocation recorded.

Also present in other papers' code

Of 4 samples lifted from this paper's linked repositories, 4 carry a function identity and 0 do not. Of the 4 distinct functions with an identity, 1 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 0 later) and 3 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).

Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.

FunctionAlso present inEarliest-datedOthers named
find_layers 1 other paper
1 dated earlier
2506.06866 (2025-06)
SAFE: Finding Sparse and Flat Minima to Improve Pruning

Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Neural network pruning is a promising technique to mitigate the excessive computational and memory requirements of large language models (LLMs). Despite its promise, however, progress in this area has diminished, as conventional methods are seemingly unable to surpass moderate sparsity levels (50-60%) without severely degrading model accuracy. This work breaks through the current impasse, presenting a principled and effective method called ELSA, which achieves extreme sparsity levels of up to 90% while retaining high model fidelity. This is done by identifying several limitations in current practice, all of which can be traced back to their reliance on a surrogate objective formulation. ELSA tackles this issue directly and effectively via standard and well-established constrained optimization techniques based on ADMM. Our extensive experiments across a wide range of models and scales show that ELSA achieves substantial improvements over existing methods; e.g., it achieves 7.8ˆless perplexity than the best existing method on LLaMA-2-7B at 90% sparsity. Moreover, we show that ELSA remains stable even at extreme sparsity (e.g., 95%), yielding up to ˆ3.98 inference speedup and ˆ7.80 memory compression over its dense counterpart. We also present ELSA -L , a quantized variant that scales to extremely large models (27B), and establish its theoretical convergence guarantees. These results highlight meaningful progress in advancing the frontier of LLM sparsity, while promising that significant opportunities for further advancement may remain in directions that have so far attracted limited exploration.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2510.01650")
get_code_for_paper("2510.01650")
have("2510.01650")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/2510.01650.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/2510.01650.svg)](https://syntology.ai/paper/2510.01650)

Connect an agent — have() is free.