Search arXiv⌕ Search

arXiv · 2610.22665

Diverse Reasoning Paths Matter: Symbolic Equivalence Augmentation for Enhancing RL Exploration

Abstract

Reinforcement learning with verifiable rewards (RLVR) has emerged as a powerful paradigm for improving the reasoning capabilities of LLMs. However, the role of supervised fine-tuning (SFT) data in enabling effective downstream RL remains underexplored. In this paper, we investigate a key hypothesis: the diversity of reasoning steps in chain-of-thought (CoT) during SFT is a critical enabler of RLVR performance. To test this hypothesis, we introduce EquivAug, a data augmentation framework that uses symbolic equivalence transformations to generate diverse yet provably correct reasoning paths. By converting CoT solutions into formal symbolic representations, applying equivalence transformations, and reconstructing natural-language explanations, EquivAug produces training data that differs in reasoning steps rather than surface-level lexical variation. Experiments on GSM8K and FOLIO across model scales demonstrate that EquivAug consistently achieves the highest reasoning path diversity after SFT and the strongest accuracy after GRPO. Our results establish that CoT diversity during SFT is positively correlated with downstream RLVR performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xiaoou Liu, Tiejin Chen, Hanyang Chen, Yuan Ling, Hua Wei. 2026-10-15. Diverse Reasoning Paths Matter: Symbolic Equivalence Augmentation for Enhancing RL Exploration. https://arxiv.org/abs/2610.22665

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Matrices with displacement structure: a deterministic approach for linear systems and nullspace bases

For matrices with a displacement structure, the fastest known algorithms for solving linear systems and computing nullspace bases are randomized, with respective costs of $\tilde{O}(α^{ω-1} n)$ and $\tilde{O}(α^2 n)$ operations in the base field. Here $n \times n$ is the matrix size, $α$ is its displacement rank, $ω> 2$ is a feasible exponent for matrix multiplication, and $\tilde{O}(\cdot)$ hides logarithmic factors. For a long time, such structured solvers were also the fastest known method to perform Hermite-Padé or simultaneous Padé approximations, and their interpolation variants, until recently when these problems received efficient and deterministic solutions via polynomial matrix algorithms. This work proposes to take the converse direction, by showing that these recent polynomial matrix tools can be used to improve structured matrix computations. We present a new approach which, for the Toeplitz-like, Vandermonde-like, and Cauchy-like structures, solves linear systems and computes nullspace bases in $\tilde{O}(α^{ω-1}(m+n))$ operations for an arbitrary $m \times n$ matrix, deterministically and with no assumption on the base field. This bound matches the best known randomized one for linear systems and improves upon it for nullspaces. The approach reformulates the problem as a modular equation on univariate polynomials, and describes all its solutions in three steps: computing a basis of solutions to a vector M-Padé approximation problem, solving a polynomial matrix equation to get rid of unwanted unknowns, and finding the sought unknowns via simultaneous M-Padé approximation.

cs.SC↗

Construction and formal verification of a special topology on {\mathbb{Z}}^{n}: characterization of connected subsets

We examine whether the integers admit a topology whose connected subsets are precisely the sets of consecutive integers. The main result gives a construction for every integer lattice {\mathbb{Z}}^{n}, n>0; the answer for Z is then obtained as a corollary. We prove that the neighborhoods determined by the parity of the sum of the coordinates form a basis and that topological connectedness agrees exactly with accessibility by finite paths of unit lattice steps. We also present a deductive audit and the correspondence between this argument and a verification in Lean 4 and Mathlib, including the empty set and the independent formal characterization of integer intervals. The construction and mathematical result originate in Problem 5712, proposed by Dan Marcus and solved in 1970 by the Cleveland State University group; the present article contributes a detailed exposition and a report on formal verification.

cs.SC↗

On the Complexity of Computing with p-adic Lattices

We study the complexity of two fundamental problems attached to p-adic lattices: computing an N-orthogonal basis, and deciding whether a given basis is N-orthogonal. When the norm is supplied through an explicit diagonal representation, both problems are polynomial. However, in the black-box model, where the ultrametric norm N is fixed and only accessible through an evaluation oracle, we prove that both problems require $Ω$(p^{v-1} ) queries in the worst case, where v $\le$ n is the largest multiplicity of a commensurability class of N and n is the dimension of the ambient vector space. We then analyse the optimality of these bounds by providing explicit algorithms. Our results answer formally an open question of Zhang, Deng and Wang and refine the recent results of Duan and Wu by providing pointwise query bounds depending on the norm's structure, in addition to uniform bounds.

cs.SC↗