← 返回时间线

paper

FLEET: From Logits Entropy to Enhanced Trajectories in Text Generation

arXiv ↗
ID
2609.27657
分类
—
首次捕获
2026-09-25
状态
unread
作者
Oleksii Streltsov, Oleksandra Vitko
信号
🔥 5

信号历史

  • 2026-09-25HF Daily Papers · 🔥2
  • 2026-09-26HF Daily Papers · 🔥3
  • 2026-09-27HF Daily Papers · 🔥4
  • 2026-09-28HF Daily Papers · 🔥5
暂无信号数据

摘要

Solutions based on large language models (LLMs) often rely on temperature sampling to improve accuracy and stability by aggregating multiple samples from the completion distribution. However, this memoryless approach is inherently suboptimal: because it lacks awareness of prior generations and their evaluations, it produces an increasing proportion of semantically duplicate answers as more samples are drawn, leading to diminishing returns. To address this limitation, we introduce FLEET, a novel method that integrates a memory mechanism into the generation process. FLEET represents each generation as a sparse trajectory through states whose entropy exceeds a predefined threshold and uses these trajectories to infer per-token utility scores that adjust the logits. Benchmark evaluations demonstrate that FLEET achieves the same accuracy as the repeated sampling baseline, with a 3x speedup, and substantially improves accuracy on complex coding tasks (LiveCodeBench Pass@32 increases from 59.9% to 66.2%) under the same budget. Furthermore, in the greedy-decoding configuration evaluated here, the approach is deterministic and uses a single calibration pass to derive its principal hyperparameters, requiring only minimal modifications to existing LLM pipelines.

我的笔记

还没有笔记。

在 GitHub 上写笔记 ↗(新建 content/notes/2609.27657.md,PR 合并后本页自动更新)