157 citations · 713 across the 56 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2022
Sufficient Exploration for Convex Q-learning
Fan Lu, Prashant Mehta, Sean Meyn +1
In recent years there has been a collective research effort to find new formulations of reinforcement learning that are simultaneously more efficient and more amenable to analysis.…
math.OC2019★ 4 cited
Faster saddle-point optimization for solving large-scale Markov decision processes
Joan Bas-Serrano, Gergely Neu
We consider the problem of computing optimal policies in average-reward Markov decision processes. This classical problem can be formulated as a linear program directly amenable to…