research
∙
02/07/2023
Layered State Discovery for Incremental Autonomous Exploration
We study the autonomous exploration (AX) problem proposed by Lim Aue...
share
research
∙
10/10/2022
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path
We study the sample complexity of learning an ϵ-optimal policy in the St...
research
∙
05/26/2022
Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback
We consider regret minimization for Adversarial Markov Decision Processe...
research
∙
05/25/2022
Near-Optimal Goal-Oriented Reinforcement Learning in Non-Stationary Environments
We initiate the study of dynamic regret minimization for goal-oriented r...
research
∙
02/16/2022
Policy Learning and Evaluation with Randomized Quasi-Monte Carlo
Reinforcement learning constantly deals with hard integrals, for example...
research
∙
02/07/2022
Policy Optimization for Stochastic Shortest Path
Policy optimization is among the most popular and successful reinforceme...
research
∙
01/31/2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints
We study regret minimization for infinite-horizon average-reward Markov ...
research
∙
12/18/2021
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP
We introduce two new no-regret algorithms for the stochastic shortest pa...
research
∙
06/15/2021
Implicit Finite-Horizon Approximation and Efficient Optimal Algorithms for Stochastic Shortest Path
We introduce a generic template for developing regret minimization algor...
research
∙
06/09/2021
Online Learning for Stochastic Shortest Path Model via Posterior Sampling
We consider the problem of online reinforcement learning for the Stochas...
research
∙
02/10/2021
Finding the Stochastic Shortest Path with Low Regret: The Adversarial Cost and Unknown Transition Case
We make significant progress toward the stochastic shortest path problem...
research
∙
02/01/2021
Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications
We resolve the long-standing "impossible tuning" issue for the classic e...
research
∙
12/07/2020
Minimax Regret for Stochastic Shortest Path with Adversarial Costs and Known Transition
We study the stochastic shortest path problem with adversarial costs and...
research
∙
04/05/2019
