Pith. sign in

REVIEW 12 cited by

One-shot Entropy Minimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2505.20282 v4 pith:PVUK3DSP submitted 2025-05-26 cs.CL

classification cs.CL
keywords dataentropylanguagelargeminimizationmodelsachieveavaliable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We trained 13,440 large language models and found that entropy minimization requires only a single unlabeled data and 10 steps optimization to achieve performance improvements comparable to or even greater than those obtained using thousands of data and carefully designed rewards in rule-based reinforcement learning. This striking result may prompt a rethinking of post-training paradigms for large language models. Our code is avaliable at https://github.com/zitian-gao/one-shot-em.

Discussion (0). Sign in to comment.

Forward citations

Cited by 12 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Rethinking Entropy Minimization in Test-Time Adaptation for Autoregressive Models

    eess.AS 2026-05 unverdicted novelty 7.0 of 10

    Derives a rigorous entropy minimization formulation for autoregressive test-time adaptation that decomposes into policy gradient and entropy terms, reinterpreting prior methods and improving Whisper ASR across 20+ domains.

  2. SELF-EMO: Emotional Self-Evolution from Recognition to Consistent Expression

    cs.AI 2026-04 unverdicted novelty 7.0 of 10

    SELF-EMO lets LLMs bootstrap better emotion recognition and expression via self-play, data flywheel filtering with smoothed IoU rewards, and SELF-GRPO reinforcement learning, yielding SOTA gains on IEMOCAP, MELD, and ...

  3. Relationship-Centered Care: Relatedness and Responsible Design for Human Connections in Mental-Health Care

    cs.HC 2026-03 accept novelty 7.0 of 10

    Length-aware GFlowNet matching of α-power base distributions elicits either stronger LLM reasoning (α>1) or restored creativity (α<1) without external supervision, matching or beating RLIF and GRPO baselines.

  4. What are Key Factors for Updates in RL for LLM Reasoning?

    cs.CL 2026-06 unverdicted novelty 6.0 of 10

    Theoretical analysis of RLVR update dynamics leads to ACPO, an adaptive clipping method that outperforms DAPO and CISPO on reasoning benchmarks with 3B and 7B models.

  5. Experience Sharing in Mutual Reinforcement Learning for Heterogeneous Language Models

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    Mutual Reinforcement Learning allows heterogeneous LLMs to exchange experience through mechanisms like Peer Rollout Pooling, Cross-Policy GRPO Advantage Sharing, and Success-Gated Transfer, with outcome-level sharing ...

  6. TEMPO: Scaling Test-time Training for Large Reasoning Models

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    TEMPO scales test-time training for large reasoning models by interleaving policy refinement on unlabeled data with critic recalibration on labeled data via an EM formulation, yielding large gains on AIME tasks.

  7. HEALing Entropy Collapse: Enhancing Exploration in Few-Shot RLVR via Hybrid-Domain Entropy Dynamics Alignment

    cs.LG 2026-04 unverdicted novelty 6.0 of 10

    HEAL mitigates entropy collapse in few-shot RLVR by selectively adding general-domain data and aligning trajectory-level entropy dynamics, matching full-shot performance with 32 target samples.

  8. Compute as Teacher: Turning Inference Compute Into Reference-Free Supervision

    cs.LG 2025-09 unverdicted novelty 6.0 of 10

    Parallel inference rollouts aggregated into pseudo-references enable reference-free RL supervision that matches expert-annotated performance on health tasks while using 9x less test-time compute.

  9. Know When to Explore: Difficulty-Aware Certainty as a Guide for LLM Reinforcement Learning

    cs.AI 2025-08 conditional novelty 6.0 of 10

    A new RL reward-shaping method that rewards low confidence on hard problems and high confidence on easy ones improves LLM math reasoning over a GRPO baseline.

  10. Trust Region On-Policy Distillation

    cs.LG 2026-05 unverdicted novelty 5.0 of 10

    TrOPD stabilizes on-policy distillation for LLMs with trust-region learning, outlier estimation, and off-policy guidance, outperforming prior OPD methods on reasoning and code benchmarks.

  11. Token-Level Policy Optimization: Linking Group-Level Rewards to Token-Level Aggregation via Sequence-Level Likelihood

    cs.CL 2026-04 unverdicted novelty 5.0 of 10

    TEPO uses sequence-level likelihood for token-level reward aggregation and a KL mask on positive-advantage tokens to improve stability and performance over GRPO in mathematical reasoning.

  12. Harnessing Uncertainty: Entropy-Modulated Policy Gradients for Long-Horizon LLM Agents

    cs.LG 2025-09 conditional novelty 5.0 of 10

    EMPG re-weights policy-gradient updates by step-level token entropy, amplifying confident correct actions and muting uncertain ones, and adds a future-clarity bonus.

Pith tools