Pith. sign in

REVIEW 4 cited by

Beyond Single-Task: Robust Multi-Task Length Generalization for LLMs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.11525 v2 pith:2C7KQGMK submitted 2025-02-17 cs.CL

classification cs.CL
keywords generalizationlengthtasksadditionfine-tuningllmsmodelsduring
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Length generalization, the ability to solve problems longer than those seen during training, remains a critical challenge for large language models (LLMs). Previous work modifies positional encodings (PEs) and data formats to improve length generalization on specific symbolic tasks such as addition and sorting. However, these approaches are fundamentally limited to special tasks, often degrading general language performance. Furthermore, they are typically evaluated on small transformers trained from scratch on single tasks and can cause performance drop when applied during post-training stage of practical LLMs with general capabilities. Hu et al., (2024) proposed Rule-Following Fine-Tuning (RFFT) to improve length generalization in the post-training stage of LLMs. Despite its compatibility with practical models and strong performance, RFFT is proposed for single tasks too, requiring re-training for each individual task with extensive examples. In this paper, we study length generalization in multi-task settings and propose Meta Rule-Following Fine-Tuning (Meta-RFFT), the first framework enabling robust cross-task length generalization. As our first contribution, we construct a large length generalization dataset containing 86 tasks spanning code execution, number processing, symbolic and logical reasoning tasks, beyond the common addition or multiplication tasks. Secondly, we show that cross-task length generalization is possible with Meta-RFFT. After training on a large number of tasks and instances, the models achieve remarkable length generalization ability on unseen tasks with minimal fine-tuning or one-shot prompting. For example, after fine-tuning on 1 to 5 digit addition, our 32B model achieves 95% accuracy on 30 digit addition, significantly outperforming the state-of-the-art reasoning models (DeepSeek-R1-671B: 72%), despite never seeing this task during RF-pretraining.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. TopoTuner: Topological Finetuning of Large Language Models

    cs.AI 2026-07 conditional novelty 6.0 of 10

    TopoTuner uses Wasserstein distances between persistence diagrams of attention projection weights to build reusable freezing profiles that match or beat LoRA while updating ~1-3% of model parameters.

  2. TopoTuner: Topological Finetuning of Large Language Models

    cs.AI 2026-07 conditional novelty 6.0 of 10

    TopoTuner freezes attention projections ranked by topological drift and transfers the profile across tasks, beating LoRA in 7/9 settings.

  3. Diagnosing CFG Interpretation in LLMs

    cs.AI 2026-04 unverdicted novelty 6.0 of 10

    LLMs maintain surface syntax for novel CFGs but fail to preserve semantics under recursion and branching, relying on keyword bootstrapping rather than pure symbolic reasoning.

  4. Position: How can Graphs Help Large Language Models?

    cs.AI 2026-05 unverdicted novelty 3.0 of 10

    Graphs can help LLMs reduce hallucinations, boost reasoning via prompting techniques, and better process structured data.

Pith tools