Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Dueling Optimization with a Monotone Adversary
Avrim Blum, Meghal Gupta, Gene Li +3
We introduce and study the problem of dueling optimization with a monotone adversary, which is a generalization of (noiseless) dueling convex optimization. The goal is to design an…
cs.LG2023
When is Agnostic Reinforcement Learning Statistically Tractable?
Zeyu Jia, Gene Li, Alexander Rakhlin +2
We study the problem of agnostic PAC reinforcement learning (RL): given a policy class , how many rounds of interaction with an unknown MDP (with a potentially large state and a…