Not All Reasoning Generalizes: A Case Study on Learning Generalizable Reasoning Strategies in RLVR

Paper recorded by Signals 4 on 2026-11-02 in cs.LG. Abstract reproduced from arXiv; link to the original below.

Published 2026-11-02 on arXiv · recorded by Signals 4 on 2026-11-03

Category: cs.LG · 机器学习 · first seen 2026-11-03

Abstract

Reinforcement learning with verifiable rewards (RLVR) can enable generalizable improvement for large language model (LLM) reasoning. This paper studies how to incentivize such generalization via reasoning strategies. We study this question with a controllable equation-solving framework: finding multiple inputs x for equations f(x)=y, where f is a non-bijective string function. This setting makes r

Read on arXiv →