Sign inGet started
Paper · arXiv

StarOR: Synergizing Tree Search and Test-Time Reinforcement Learning for Optimization Modeling

Optimization modeling is inherently hierarchical, requiring a precise sequence of symbolic commitments. Traditional learning-based automated optimization modeling methods improve modeling policies through large-scale annotated or curated training data, but are costly to adapt to new problem distributions. Meanwhile, one-shot generation remains brittle in hierarchical modeling, where early symbolic errors can propagate into invalid formulations. Test-time scaling offers a promising alternative by enabling structural exploration with additional instance-level computation; however, existing search-based methods typically rely on a fixed policy, causing repeated rollouts to inherit similar mo...

AuthorsJiajun Li, Yu Ding, Shisi Guan et al.
Primary categorycs.LG
Published13 June 2026
Last updated at source26 September 2026
cs.LGcs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/d0b4246a-af7e-4138-9436-46d0620e90ec" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

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.