Less Data Less Tokens: Multilingual Unification Learning for Efficient Test-Time Reasoning in LLMs

Kang Chen, Mengdi Zhang, Yixin Cao
6/23/2025
cs.CL

No confident code implementation found for this paper.

Abstract

This paper explores the challenges of test-time scaling of large language models (LLMs), regarding both the data and inference efficiency. We highlight the diversity of multi-lingual reasoning based on our pilot studies, and then introduce a novel approach, \(L^2\) multi-lingual unification learning with a decoding intervention strategy for further investigation. The basic idea of \(L^2\) is that the reasoning process varies across different languages, which may be mutually beneficial to enhance both model performance and efficiency. In specific, there are two types of multi-lingual data: the entire long chain-of-thought annotations in different languages and the step-wise mixture of languages. By further tuning based on them, we show that even small amounts of data can significantly improve reasoning capabilities. Our findings suggest that multilingual learning reduces both the required data and the number of inference tokens while maintaining a comparable performance. Furthermore, \(L^2\) is orthogonal to other data efficient methods. Thus, we also emphasize the importance of diverse data selection. The \(L^2\) method offers a promising solution to the challenges of data collection and test-time compute efficiency in LLMs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{chen2025less,
  title  = {Less Data Less Tokens: Multilingual Unification Learning for Efficient Test-Time Reasoning in LLMs},
  author = {Kang Chen and Mengdi Zhang and Yixin Cao},
  year   = {2025},
  eprint = {2506.18341},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.18341v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2506.18341.svg)](https://codeofpaper.com/paper/2506.18341)

Discussion