← Back to all news
arXiv AI September 15, 2026 By David Koplow, Tomer Galanti, Tomaso Poggio

Tool Use Reduces Depth-Induced Collapse in OOD Reasoning

Read the original on arXiv AI →

The Flow has not summarised this story yet — read it at arXiv AI.

  • llms
  • agents
  • benchmarks
  • safety

One email a morning, machine-written

One email a day, machine-written, one click to leave. We never share your address.

Related stories

arXiv AI
Aug 5

On the Limits of Layer Pruning for Generative Reasoning in Large Language Models

arXiv:2602. 01997v3 Announce Type: replace-cross Abstract: Recent work has shown that layer pruning can effectively compress large language models (LLMs) while retaining strong performance on classification benchmarks, often with little or no finetuning.

By Safal Shrestha, Anubhav Shrestha, Minwu Kim, Aadim Nepal, Keith Ross
llmsfine-tuningefficiencybenchmarks
More like this →
arXiv AI
Sep 16

Thinking Deeper, Not Longer: Memory-Efficient Test-Time Reasoning with Depth-Recurrent Transformers for Compositional Generalization

arXiv:2603.21676v2 Announce Type: replace-cross Abstract: Standard Transformers have a fixed computational depth, limiting their ability to generalize to tasks that require variable-depth reasoning....

By Hung-Hsuan Chen
llmssafety
More like this →
arXiv AI
Oct 1

What Limits Recursive Reasoning Models: Optimization, Architecture and Test-Time Scaling

arXiv:2609.39967v1 Announce Type: cross Abstract: Recursive reasoning models apply a small shared Transformer block many times to refine a latent state. This gives them large effective depth with few...

By Yuliana Shakhvalieva, Dmitrii Kharchev, Viacheslav Bezrukov, Inessa Fedorova, Dmitry Bocharov, Ivan Oseledets, Valerii Ternovskii
llms
More like this →
arXiv Machine Learning
Sep 1

Universal Transformers for Circuit Computations: Perfect Length Generalization in Tiny Transformers

arXiv:2608.31067v1 Announce Type: new Abstract: Learning generalizable algorithmic computations remains a challenge for neural networks, as reflected in persistent failures on compositional and lengt...

By Takuya Ito, Ruchir Puri, Murray Campbell, Parikshit Ram
llmsagentsbenchmarks
More like this →
arXiv Computation and Language
Oct 8

SEER: Self-Enhancing Chain-of-Thought Compression for Reasoning Models

arXiv:2509.14093v3 Announce Type: replace-cross Abstract: Chain-of-Thought (CoT) prompting can substantially improve the reasoning ability of large language models (LLMs), but it often comes with hig...

By Kerui Huang, Shuhan Liu, Xing Hu, Tongtong Xu, Lingfeng Bao, Xin Xia
llmsbenchmarks
More like this →
arXiv AI
Aug 12

Loop, Think, & Generalize: Implicit Reasoning in Recurrent-Depth Transformers

arXiv:2604. 07822v2 Announce Type: replace-cross Abstract: We study implicit reasoning, i.

By Harsh Kohli, Srinivasan Parthasarathy, Huan Sun, Yuekun Yao
llms
More like this →
About Pricing API Newsletter Sources Privacy Terms Refunds Accessibility Provider info Contact RSS

The Flow links to publishers and never republishes their articles. Summaries are machine-generated.

v1.1.0 · 5f852ea