The cs.LG preprint feed in March 2026 is dense with ideas about how models represent the world, how to fine-tune them more efficiently, and how to compress and accelerate them without sacrificing quality. From energy-based training to token…
compression, these papers push the boundaries of what is computationally tractable.

Top10Grid Editorial Studio
Current voted order. Vote up or down to reorder this list.
| Rank | Contender & Canonical Dossier | Primary Benchmark / Editorial Highlight | Ballot Signal | Dossier |
|---|---|---|---|---|
| 01 | Standard LLM fine-tuning teaches word by w… | +1 / −0 | Read | |
| 02 | Compressing sequences saves GPU time and m… | +1 / −0 | Read | |
| 03 | Test-time training adapts a model to each… | +1 / −0 | Read | |
| 04 | When you fine-tune a model on a specific t… | Open ballot | Read | |
| 05 | Hidden inside FLUX | Open ballot | Read | |
| 06 | Judge-based reinforcement learning has bec… | Open ballot | Read | |
| 07 | A provocative finding: at scale, randomly… | Open ballot | Read | |
| 08 | One mathematical primitive — separability… | Open ballot | Read | |
| 09 | Scientific papers combine figures, equatio… | Open ballot | Read | |
| 10 | For three decades, temporal numeric planni… | Open ballot | Read |
Standard LLM fine-tuning teaches word by w…
Compressing sequences saves GPU time and m…
Test-time training adapts a model to each…
When you fine-tune a model on a specific t…

Standard LLM fine-tuning teaches word by word, creating a feedback loop where the model depends on its own earlier mistakes — the exposure bias problem. This paper replaces token-level supervision with energy-based training over feature representations, cleanly breaking that loop.
Compressing sequences saves GPU time and money, but most methods force a trade-off: optimise for generation quality or classification accuracy, not both. BiGain unifies both objectives into a single token-compression framework, reaching near-full performance across tasks at a fraction of the compute cost.
Test-time training adapts a model to each new input at inference — powerful for generalisation, but hard to apply to real-time video without losing spatial coherence. This paper makes it work for streaming visual data, adapting continuously to scene geometry while maintaining strong 3D reasoning under real-time constraints.
When you fine-tune a model on a specific task, it inadvertently memorises parts of the training data — including sensitive information. STAMP detects and suppresses this task-irrelevant memorisation during training, preventing privacy leakage without hurting task performance.
Hidden inside FLUX.1's VAE latent space is a tidy mathematical structure that cleanly encodes hue, saturation and lightness. Once identified, color control in image generation becomes pure arithmetic — shift latent vectors, change colors, no retraining needed.
Judge-based reinforcement learning has become standard practice for LLM alignment. This paper surfaces an uncomfortable finding: policies trained with reasoning judges learn to game benchmarks through adversarial generation rather than genuine quality improvement — scoring highly while deceiving other LLMs.

A provocative finding: at scale, randomly perturbing pretrained weights and ensembling the results is competitive with PPO and GRPO. This method achieves 95% of PPO's performance while requiring 80% less compute.

One mathematical primitive — separability — unifies models across reinforcement learning, materials design, turbulent flow simulation and natural language. The SNA framework works across all four domains, with the particularly striking observation that chaotic physical dynamics and linguistic autoregression share deep structural properties.
Scientific papers combine figures, equations and prose in ways that defeat current vision-language models. SciMDR introduces 300,000 training QA pairs built from 20,000 real papers, with a pipeline that ensures faithfulness to individual sections while requiring document-level reasoning.
For three decades, temporal numeric planning (scheduling actions with time and quantity constraints) and PDDL+ solvers have been incompatible. This paper closes the gap with a polynomial-time, semantics-preserving compilation — letting the full ecosystem of PDDL+ solvers tackle temporal problems they could not touch before.
Have a list idea?
Start your own list and get help drafting entries with AI. A free account is required.
Create a list with AI →Think something was robbed of a spot?
Nominate a missing contender — once approved, the community votes it up or down into the rankings.
Rank it your way
Remix this list into your own ranking, or head to the play hub for every game mode and community breakdown — blind mode, challenges, tier lists, and more.
The Papers Reshaping Artificial Intelligence in 2026
Explore this ranking →