2T-FT: Two-Token Fine-tuning improves zero-shot performance with minimal training

Chain of Thought (CoT) prompting has been shown to improve the performance of large language models (LLMs) in a wide range of tasks, including arithmetic, common-sense, and symbolic reasoning. However, this improvement requires the development of effective CoT prompts. On the other hand, more recent work has shown that CoT reasoning paths are often inherently present in top-k alternative decoding sequences, even in the absence of any specific prompting technique. In this study, we propose a new fine-tuning method that exploits this property by targeting only two specific tokens of these pre-existing CoT responses. We demonstrate that fine-tuning only two tokens using the model’s own implicitly generated CoT paths leads to a significant efficiency gain, reducing training time while still achieving meaningful performance improvements. When evaluated on arithmetic datasets, we achieved a 22.7% improvement on MultiArith, 9.0% on GSM8K, and 2.3% on SVAMP when validated on the Phi-2 model from a greedy decoding perspective, reducing the processing time by over 90% compared to the LoRA fine-tuning method. Code is publicly available at: https://github.com/paulosantosneto/2tft .

Authors

Institutions

Publication Details

Journal
Neural Computing and Applications
Published
2026-04-21
DOI
https://doi.org/10.1007/s00521-026-12052-9
Primary Topic
Topic Modeling
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

2T-FT: Two-Token Fine-tuning improves zero-shot performance with minimal training

Felipe Kühne, Paulo S. Neto, Rodrigo S. Guerra, Paulo L. J. Drews et al.
Neural Computing and Applications
Topic Modeling
article

2T-FT: Two-Token Fine-tuning improves zero-shot performance with minimal training

Felipe Kühne, Paulo S. Neto, Rodrigo S. Guerra, Paulo L. J. Drews, João F. S. S. Lemos, Jardel D. S. Dyonisio
article en

Abstract

Chain of Thought (CoT) prompting has been shown to improve the performance of large language models (LLMs) in a wide range of tasks, including arithmetic, common-sense, and symbolic reasoning. However, this improvement requires the development of effective CoT prompts. On the other hand, more recent work has shown that CoT reasoning paths are often inherently present in top-k alternative decoding sequences, even in the absence of any specific prompting technique. In this study, we propose a new fine-tuning method that exploits this property by targeting only two specific tokens of these pre-existing CoT responses. We demonstrate that fine-tuning only two tokens using the model’s own implicitly generated CoT paths leads to a significant efficiency gain, reducing training time while still achieving meaningful performance improvements. When evaluated on arithmetic datasets, we achieved a 22.7% improvement on MultiArith, 9.0% on GSM8K, and 2.3% on SVAMP when validated on the Phi-2 model from a greedy decoding perspective, reducing the processing time by over 90% compared to the LoRA fine-tuning method. Code is publicly available at: https://github.com/paulosantosneto/2tft .

Neural Computing and ApplicationsVol. 38(9)
Universidade Federal do Rio Grande (BR)
Universidade Federal do Rio Grande do Sul
Openalex Percentile: Top 6%
Topic Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.