Reactivating Test-Time Scaling for Plane Geometry Problem Solving
Plane geometry problem (PGP) solving has become a critical benchmark for multimodal reasoning because it requires accurate visual perception and precise multi-step symbolic deduction. Although test-time scaling (TTS) has demonstrated remarkable success in general mathematical reasoning, it fails to scale effectively under the symbolic-program paradigm for plane geometry. We identify two key obstacles: limited reasoning diversity induced by rigid symbolic programs and insufficient explicit visual grounding before symbolic deduction. To address these issues, we propose Multi-Trace Synthesis (MTS), which converts each symbolic program into heterogeneous reasoning traces, including executable...
| Authors | Xiaoqiang Kang, Shengen Wu, Maizhen Ning et al. |
|---|---|
| Primary category | cs.CL |
| Published | 31 August 2026 |
| Last updated at source | 31 August 2026 |
Connected in the knowledge graph
- kxiaoqiangrexian/MTS-AllDataset · cited by
Models and datasets referencing this paper
- kxiaoqiangrexian/MTS-AllDataset
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.