Oct. 6, 2022, 1:12 a.m. | Runlong Zhou, Yuandong Tian, Yi Wu, Simon S. Du

cs.LG updates on arXiv.org arxiv.org

Over the recent years, reinforcement learning (RL) starts to show promising
results in tackling combinatorial optimization (CO) problems, in particular
when coupled with curriculum learning to facilitate training. Despite emerging
empirical evidence, theoretical study on why RL helps is still at its early
stage. This paper presents the first systematic study on policy optimization
methods for online CO problems. We show that online CO problems can be
naturally formulated as latent Markov Decision Processes (LMDPs), and prove
convergence bounds on …

arxiv curriculum curriculum learning optimization policy understanding

Founding AI Engineer, Agents

@ Occam AI | New York

AI Engineer Intern, Agents

@ Occam AI | US

AI Research Scientist

@ Vara | Berlin, Germany and Remote

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

DevOps Engineer (Data Team)

@ Reward Gateway | Sofia/Plovdiv