FLEET: From Logits Entropy to Enhanced Trajectories in Text Generation
Summary
FLEET introduces a memory mechanism to text generation in large language models, using logits entropy to enhance trajectories, resulting in improved accuracy and a 3x speedup, particularly on coding tasks.
View Cached Full Text
Cached at: 09/24/26, 11:39 AM
Paper page - FLEET: From Logits Entropy to Enhanced Trajectories in Text Generation
Source: https://huggingface.co/papers/2609.27657
Abstract
Solutionsbasedonlargelanguagemodels(LLMs)oftenrelyontemperaturesamplingtoimproveaccuracyandstabilitybyaggregatingmultiplesamplesfromthecompletiondistribution.However,thismemorylessapproachisinherentlysuboptimal:becauseitlacksawarenessofpriorgenerationsandtheirevaluations,itproducesanincreasingproportionofsemanticallyduplicateanswersasmoresamplesaredrawn,leadingtodiminishingreturns.Toaddressthislimitation,weintroduceFLEET,anovelmethodthatintegratesamemorymechanismintothegenerationprocess.FLEETrepresentseachgenerationasasparsetrajectorythroughstateswhoseentropyexceedsapredefinedthresholdandusesthesetrajectoriestoinferper-tokenutilityscoresthatadjustthelogits.BenchmarkevaluationsdemonstratethatFLEETachievesthesameaccuracyastherepeatedsamplingbaseline,witha3xspeedup,andsubstantiallyimprovesaccuracyoncomplexcodingtasks([email protected]%to66.2%)underthesamebudget.Furthermore,inthegreedy-decodingconfigurationevaluatedhere,theapproachisdeterministicandusesasinglecalibrationpasstoderiveitsprincipalhyperparameters,requiringonlyminimalmodificationstoexistingLLMpipelines.
View arXiv pageView PDFGitHub0Add to collection
Get this paper in your agent:
hf papers read 2609\.27657
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2609.27657 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2609.27657 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2609.27657 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
ExTra: Exploratory Trajectory Optimization for Language Model Reinforcement Learning
ExTra introduces exploratory trajectory optimization for language model reinforcement learning, combining novelty rewards and entropy-guided prefix regeneration to improve both single-sample accuracy and inference-time coverage on mathematical reasoning benchmarks.
Trajectory as the Teacher: Few-Step Discrete Flow Matching via Energy-Navigated Distillation
This paper introduces Trajectory-Shaped Discrete Flow Matching (TS-DFM), which replaces blind stochastic jumps with guided navigation to significantly improve text generation efficiency and reduce computational costs. The method achieves superior perplexity and speed compared to traditional multi-step baselines while maintaining unchanged inference costs.
One-Step Text Generation by Seq-Drifting
This paper proposes Seq-Drifting, a framework that learns a map from Gaussian noise to text in a single forward pass by applying drifting to sequences of continuous token representations, achieving a generative perplexity of 36.01 on LM1B with large speedups over few-step and multi-step diffusion language models.
Forking Fast: Efficiently Estimating Uncertainty Dynamics in Text Generation
This paper proposes a statistical model to efficiently estimate uncertainty dynamics in text generation, smoothing noisy resampling data to significantly reduce computational costs while maintaining accuracy in analyzing LLM reasoning chains.
Adding memory to search instead of sampling in reward maximization tasks [R]
A preprint introduces FLEET, an algorithm that makes Best-of-N sampling reward-aware by attributing external rewards to tokens, storing hidden states with reward metadata in a vector store, and using modified MCTS to reweight logits in subsequent iterations. Results show equivalent or better performance with far fewer sampling iterations on GSM8K and LiveCodeBench with Llama 3.2 3B, plus a reusable metadata store that can serve as a prior for other tasks or enrich SFT/RL.