mlsanityData to 7 Oct 2026

TRACE Back from the Future: A Probabilistic Reasoning Approach to Controllable Language Generation

arXiv 2504.18535 ↗First posted 25 Apr 2025cs.CL cs.LGcited by 8

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

As large language models (LMs) advance, there is an increasing need to control their outputs to align with human values (e.g., detoxification) or desired attributes (e.g., personalization, topic). However, autoregressive models focus on next-token predictions and struggle with global properties that require looking ahead. Existing solutions either post-train LMs for each new attribute--expensive and inflexible--or approximate the Expected Attribute Probability (EAP) of future sequences by sampling or training, which is slow and unreliable for rare attributes. We introduce TRACE (Tractable Probabilistic Reasoning for Adaptable Controllable gEneration), a novel framework that efficiently computes EAP and adapts to new attributes through tractable probabilistic reasoning and lightweight control. TRACE distills a Hidden Markov Model (HMM) from an LM and pairs it with a small classifier to estimate attribute probabilities, enabling exact EAP computation over the HMM's predicted futures. This EAP is then used to reweigh the LM's next-token probabilities for globally compliant continuations. Empirically, TRACE achieves state-of-the-art detoxification results with only 20% decoding overhead, yields 76 low-resource personalized LMs within seconds, and seamlessly extends to composite attributes. Our code is available at: https://github.com/yidouweng/trace.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 31 of its 41 references that are in the map. First posted on arXiv 25 Apr 2025.

Builds on

31 of 41 references.

References · 31

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2023Direct Preference Optimization: Your Language Model is Secretly a Reward Modelcited by 7,916
  3. 2019The Curious Case of Neural Text Degenerationcited by 2,881
  4. 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,548
  5. 2020RealToxicityPrompts: Evaluating Neural Toxic Degeneration in Language Modelscited by 1,235
  6. 2019Plug and Play Language Models: A Simple Approach to Controlled Text Generationcited by 793
  7. 2022Compositional Visual Generation with Composable Diffusion Modelscited by 619
  8. 2020Towards a Human-like Open-Domain Chatbotcited by 467
  9. 2021DExperts: Decoding-Time Controlled Text Generation with Experts and Anti-Expertscited by 434
  10. 2021FUDGE: Controlled Text Generation With Future Discriminatorscited by 374
  11. 2022Quark: Controllable Text Generation with Reinforced Unlearningcited by 236
  12. 2024A Mechanistic Understanding of Alignment Algorithms: A Case Study on DPO and Toxicitycited by 179
19 more
  1. 2022COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamicscited by 159
  2. 2023Controlled Decoding from Language Modelscited by 133
  3. 2021Detoxifying Language Models Risks Marginalizing Minority Voicescited by 106
  4. 2020Einsum Networks: Fast and Scalable Learning of Tractable Probabilistic Circuitscited by 102
  5. 2022Mix and Match: Learning-free Controllable Text Generation using Energy Language Modelscited by 66
  6. 2023Tractable Control for Autoregressive Language Generationcited by 65
  7. 2022Gradient-Based Constrained Sampling from Language Modelscited by 64
  8. 2024Transfer Q Star: Principled Decoding for LLM Alignmentcited by 46
  9. 2022News Category Datasetcited by 42
  10. 2022Controllable Text Generation with Neurally-Decomposed Oraclecited by 41
  11. 2022Scaling Up Probabilistic Circuits by Latent Variable Distillationcited by 35
  12. 2024Adaptable Logical Control for Large Language Modelscited by 30
  13. 2023Image Inpainting via Tractable Steering of Diffusion Modelscited by 22
  14. 2023A Pseudo-Semantic Loss for Autoregressive Models with Logical Constraintscited by 21
  15. 2024LiSeCo: Linear Semantic Control for Language Generationcited by 20
  16. 2019On Tractable Computation of Expected Predictionscited by 19
  17. 2023Building Efficient Universal Classifiers with Natural Language Inferencecited by 19
  18. 2023Unlocking Anticipatory Text Generation: A Constrained Approach for Large Language Models Decodingcited by 4
  19. 2023A Tractable Inference Perspective of Offline RLcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 6.

8 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2025Reasoning Under Uncertainty: Exploring Probabilistic Reasoning Capabilities of LLMs
  2. 2025A Markov Categorical Framework for Language Modeling
  3. 2025Large Language Models as Discounted Bayesian Filters
  4. 2026The Probabilistic Structure of Large Language Models
  5. 2026Probabilistic Calibration Is a Trainable Capability in Language Models
  6. 2026Top-b: Entropic Regulation of Relative Probability Bands in Autoregressive Language Processes
  7. 2024Towards Logically Consistent Language Models via Probabilistic Reasoning
  8. 2026TRACES: Tagging Reasoning Steps for Adaptive Cost-Efficient Early-Stopping