SAGE targets two failure modes in long reasoning chains: toward locally plausible but unproductive branches, and from small deviations that accumulate before sparse rewards expose them.
The framework combines algebraic sparsification, which restricts candidates using operator-indexed algebraic subspaces, with hyperbolic embeddings that provide depth-wise structural signals. It outperformed competitive baselines across 12 benchmarks and 7 model families, including up to an 8-fold improvement on the Andrews-Curtis problem.