SERA trains recursive agents to score their own subtasks
On two text benchmarks, SERA beat recursive-agent baselines by 5.38 and 13.14 points on average.
Stories per day · 30 days
1 RSS
3 stories, newest first · one card per story
Stories tagged #tree-search
Learning-Guided Planning in Large Dynamic Action Spaces: Budgeted Tree Search for One-to-Many Mobile Charging
LP-BTS uses graph proposal policies, learned critics, and budgeted PUCT search to plan mobile charging across dynamic action spaces up to 2,813 stops.
Difficulty-Adaptive Tree-Structured Policy Optimization for Expanding Reasoning Coverage in RLVR
Researchers propose DATPO, a difficulty-adaptive tree-structured RLVR training method that expands reasoning coverage (pass@k) and improves test-time scaling on math benchmarks.