paper-with-me

Papers

From Drafts to Answers: Unlocking LLM Potential via Aggregation Fine-Tuning

2025-01-21 · Yafu Li, Zhilin Wang, Tingchen Fu, Ganqu Cui, Sen yang, Yu Cheng

Scaling data and model size has been proven effective for boosting the performance of large language models. In addition to training-time scaling, recent studies have revealed that increasing test-time computational resources can further improve performance. In this work, we introduce Aggregation Fine-Tuning (AFT), a supervised finetuning paradigm where the model learns to synthesize multiple draft responses, referred to as proposals, into a single, refined answer, termed aggregation. At inference time, a propose-and-aggregate strategy further boosts performance by iteratively generating proposals and aggregating them. Empirical evaluations on benchmark datasets show that AFT-trained models substantially outperform standard SFT. Notably, an AFT model, fine-tuned from Llama3.1-8B-Base with only 64k data, achieves a 41.3% LC win rate on AlpacaEval 2, surpassing significantly larger LLMs such as Llama3.1-405B-Instruct and GPT4. By combining sequential refinement and parallel sampling, the propose-and-aggregate framework scales inference-time computation in a flexible manner. Overall, These findings position AFT as a promising approach to unlocking additional capabilities of LLMs without resorting to increasing data volume or model size.

📄 PDF Abstract BibTeX arXiv:2501.11877

Code (1)

linzwcs/aft 공식 구현 pytorch

Methods 이 논문이 사용한 방법론

SFT Shrink and Fine-Tune, or SFT, is a type of distillation that avoids explicit distillation by copying parameters to a student student model and then fine-tuning.…

Similar Papers 제목 키워드 기반

Exploring and Improving Drafts in Blockwise Parallel Decoding

2024-04-14 · Taehyeon Kim, Ananda Theertha Suresh, Kishore Papineni, Michael Riley 외

Despite the remarkable strides made by autoregressive language models, their potential is often hampered by the slow inference speeds inherent in sequential token generation. Blockwise parallel decoding (BPD) was propose…

Self-Improvement Programming for Temporal Knowledge Graph Question Answering

2024-04-02 · Zhuo Chen, Zhao Zhang, Zixuan Li, Fei Wang 외

Temporal Knowledge Graph Question Answering (TKGQA) aims to answer questions with temporal intent over Temporal Knowledge Graphs (TKGs). The core challenge of this task lies in understanding the complex semantic informat…

Graph Question AnsweringIn-Context LearningKnowledge GraphsQuestion Answering+1

DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding

2025-09-28 · Guanghao Li, Zhihui Fu, Min Fang, Qibin Zhao 외 arxiv

As large language models (LLMs) scale up, accuracy improves, but the autoregressive (AR) nature of decoding increases latency since each token requires a serial forward pass. Speculative decoding addresses this by employ…

Chemical Chain-of-Thought Functions as a Hallucination-Prone Molecular Scratchpad

2026-07-23 · Jiatong Li, Yuxuan Ren, Weida Wang, Xiaoyong Wei 외 arxiv

Chemical reasoning language models are expected to derive molecular answers through faithful chain-of-thought (CoT). However, across four reasoning model families and twelve chemistry tasks, hallucination is widespread a…

Unlocking Parallelism in Autoregressive Language Models via Speculative Decoding with Progressive Tree Drafting

2026-07-12 · Zipeng Gao, Zhi Zheng, Qingrong Xia, Junda Lin 외 arxiv

Speculative decoding has significantly accelerated Large Language Model (LLM) inference by alleviating memory-bound bottlenecks. However, traditional speculative decoding typically relies on auxiliary draft modules, incu…