2026/03/12 by Samy Jelassi, Mujin Kwun, Rosie Zhao +6 · 1 voice
Computer Science · #Feature (linguistics) #Language model #Matching (statistics) #Natural Language Processing Techniques #Perspective (graphical) #Prefix #Sampling (signal processing) #Scalability #Semantics (computer science) #Speech Recognition and Synthesis #Topic Modeling #cs.LG
paper · pdf · open access · doi:10.48550/arxiv.2603.12248
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2026/03/12 · arxiv published 2026/03/12 · openalex created_date 2026/03/14 · arxiv updated 2026/03/16 · openalex updated_date 2026/07/28
Cross-entropy (CE) training provides dense and scalable supervision for language models, but it optimizes next-token prediction under teacher forcing rather than sequence-level behavior under model rollouts. We introduce a feature-matching objective for language-model fine-tuning that targets sequence-level statistics of the completion distribution, providing dense semantic feedback without requiring a task-specific verifier or preference model. To optimize this objective efficiently, we propose energy-based fine-tuning (EBFT), which uses strided block-parallel sampling to generate multiple rollouts from nested prefixes concurrently, batches feature extraction over these rollouts, and uses the resulting embeddings to perform an on-policy policy-gradient update. We present a theoretical perspective connecting EBFT to KL-regularized feature-matching and energy-based modeling. Empirically, across Q&A coding, unstructured coding, and translation, EBFT matches RLVR and outperforms SFT on downstream accuracy while achieving a lower validation cross-entropy than both methods.