Adaptive rollout methods for group-relative reinforcement learning typically allocate a fixed per-update budget across prompts. We instead study how to coordinate a finite rollout budget over the entire training horizon. We formulate this problem using a concave surrogate utility of cumulative prompt exposure and intro...
Yi-Ming Zong, Yi-Ge Wang, Xin-Ting Hu et al.· 0 citations
These results connect corruption-robust sparse estimation with resource accounting, pricing, and stopping in high-dimensional online allocation by developing Robust Optimistic Primal--Dual, an estimator-modular framework that combines corruption-aware confidence widths with online resource prices and a budget-safety ru...
Yi-Ge Wang, Han-Yang Li, Yi-Ming Zong et al.· 0 citations
This work considers the MDP problems with function approximation with function approximation and develops a new algorithm to solve it efficiently, based on a linear programming (LP) reformulation and repeatedly resolves the identified reduced linear system as new transition samples arrive.
Jia-Shuo Jiang, Yinyu Ye, Yiming Zong· Operations Research Letters· 0 citations
An offline model-based RL framework for cost-controllable sequential incentive allocation is developed and an independent counterfactual scorer evaluates each learned policy on held-out logs, enabling pre-launch selection without costly online exposure.
Zi-Lin Zhao, Han Yang, Tian-Pei Yang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.