Cross-Entropy Games and Frost Training
Not on the map. Why?
Abstract (arXiv)
We present Frost Training, a method for improving Monte Carlo-based policy optimization for a large family of LLM-as-a-judge tasks called Cross-Entropy Games. The key idea is to exploit the gradient of the reward function in embedding space. This signal is used in the Greedy Coordinate Gradient (GCG) jailbreaking technique; we demonstrate for the first time that it can also be used to boost model training. We validate our method using GRPO training for maximum-likelihood infilling. Frost Training improves the model's ability to generate high-scoring outputs, reaching higher maximum scores in a best-of-k setting, and does so at an increased speed.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
13 of 20 references.
References · 13
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 2,914
- 2024Security and Privacy Challenges of Large Language Models: A Surveycited by 179
- 2022COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamicscited by 159
- 2023Amortizing intractable inference in large language modelscited by 94
- 2022Gradient-Based Constrained Sampling from Language Modelscited by 64
- 2020Model-Predictive Control via Cross-Entropy and Gradient-Based Optimizationcited by 32
- 2025RLP: Reinforcement as a Pretraining Objectivecited by 23
- 2021CEM-GD: Cross-Entropy Method with Gradient Descent Planner for Model-Based Reinforcement Learningcited by 6
- 2020TaylorGAN: Neighbor-Augmented Policy Update for Sample-Efficient Natural Language Generationcited by 2
- 2025Cross-Entropy Games for Language Models: From Implicit Knowledge to General Capability Measurescited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2026Entropy Regularization: A Free Correction to Cross-Entropy for Verified Demonstrations
- 2025CE-U: Cross Entropy Unlearning
- 2025Maximizing Confidence Alone Improves Reasoning
- 2026STARE: Surprisal-Guided Token-Level Advantage Reweighting for Policy Entropy Stability
- 2025CE-GPPO: Coordinating Entropy via Gradient-Preserving Clipping Policy Optimization in Reinforcement Learning
- 2026Fine-Tuning on Self-Generated and Reward-Weighted Data: Learning Dynamics, Convergence Rates, and Benefits of Off-Policyness
- 2025Asymmetric Proximal Policy Optimization: mini-critics boost LLM reasoning
- 2026Step-by-Step Optimization-like Reasoning in LLMs over Expanding Search Spaces