5 citations · 7 across the 6 of their papers we have counts for
5 papers · 1 filter
CERO: Where and When to Allocate Rollouts for RL Post-Training
Yiming Zong, Yige Wang, Xing Hu +2
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…
Corruption-Robust Sparse Linear Contextual Bandits with Knapsack Constraints
Yige Wang, Hanyang Li, Yiming Zong +2
We study sparse linear contextual bandits with knapsack constraints under joint reward and consumption corruption. Consumption corruption creates a challenge beyond corrupted rewar…
Cross-Epoch Adaptive Rollout Optimization for RL Post-Training
Yiming Zong, Yige Wang, Jiashuo Jiang
LLM post-training often relies on reinforcement learning methods that sample multiple rollouts per prompt, yet most existing approaches use a fixed rollout budget for every prompt,…
Online Semi-infinite Linear Programming: Efficient Algorithms via Function Approximation
Yiming Zong, Jiashuo Jiang
We consider the dynamic resource allocation problem where the decision space is finite-dimensional, yet the solution must satisfy a large or even infinite number of constraints rev…
Adaptive Resolving Methods for Markov Decision Processes with Function Approximations
Jiashuo Jiang, Yinyu Ye, Yiming Zong
Learning the optimal policy for Markov decision process problems (MDPs) from samples is a fundamental problem in online and data-driven decision-making. Function approximations are…