MicroMouse: Masking Harmful Supervision in Long CoT via Relative Potential
Xiaowei Zhu, Hengzhu Tang, Zhenyu Zhang, Shuohuan Wang, Yubing Ren, Yanan Cao
Abstract
Even successful long CoTs may contain harmful supervision, motivating the need for methods that can automatically identify and mask such signals during SFT. Inspired by the MicroMouse maze-solving process, we view a long CoT as a search trajectory from the input problem toward the target answer. This perspective motivates maintaining a goal-relative measure, analogous to a MicroMouse's spatial coordinates, to quantify how close the current reasoning state is to the target answer. Building on this perspective, we propose MicroMouse, an automated selective-SFT framework for masking harmful supervision in long CoTs. In MicroMouse we introduce a Relative Potential (REP) to measure how closely each reasoning state supports the gold answer. Unlike the perplexity of the gold answer alone, REP measures relative support by contrasting the gold answer with a matched foil. This contrast cancels likelihood variations shared by the pair, yielding a more stable signal of progress toward the target answer. By tracking the REP trajectory, MicroMouse identifies consecutive potential decreases as erroneous exploration and post-peak reasoning as redundant wandering, and masks these harmful supervision during SFT. Extensive experiments across multiple student model scales and reasoning benchmarks show that MicroMouse consistently outperforms Full-CoT SFT and existing selective-SFT baselines, yielding average relative gains of 5.5% in greedy accuracy and 2.6% in Pass@1 relative to Full-CoT SFT. Meanwhile, MicroMouse improves reasoning efficiency by reducing average output length by 8.8%, while identifying harmful supervision in only 1.7 seconds per long CoT on average.
Create a lesson
Related papers
COMPREHEND: Ultra-Fine-Grained Benchmark Understanding by Entailment Hierarchy
Sivaraaman Balakrishnan, Prakriti Shetty, Jeremiah Hong et al.
Constructing a Regional Slang Lexicon for Electricity Demands via Soft-Label Bidirectional Anchoring and Active Learning
Rong Chang, Lijing Shi, Zhaoxiang Zang
Shared Context Candidate Scoring with Jointly Adapted Readout Networks
Jingyang Du, Yiben Fu, Yang Shen
Tokenizer Myths and Where To Find Them
Rylan Schaeffer, Sanmi Koyejo
Length Is Cheap, Competition Is Not: Attention Predicts Context Rot in Retrieval
Yinuo Liu
PACT: Certifying What Is Written in Parallel Decoding of Diffusion Language Models
Yanchao Li, Yusu Zhang, Jiaqing Xie et al.