Liyu Chen | DeepAI

AI Chat

Featured Co-authors

Fei Sha
72 publications
Alessandro Lazaric
66 publications
Boqing Gong
59 publications
Haipeng Luo
58 publications
Rahul Jain
52 publications
Matteo Pirotta
41 publications
Hexiang Hu
34 publications
Chen-Yu Wei
33 publications
Yi-Fan Chen
19 publications
Andrea Tirinzoni
19 publications
Aviv Rosenberg
13 publications

∙ 02/07/2023

Layered State Discovery for Incremental Autonomous Exploration

We study the autonomous exploration (AX) problem proposed by Lim Aue...

0 Liyu Chen, et al. ∙

∙ 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...

0 Liyu Chen, et al. ∙

∙ 05/26/2022

Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback

We consider regret minimization for Adversarial Markov Decision Processe...

0 Yan Dai, et al. ∙

∙ 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...

0 Liyu Chen, et al. ∙

∙ 02/16/2022

Policy Learning and Evaluation with Randomized Quasi-Monte Carlo

Reinforcement learning constantly deals with hard integrals, for example...

0 Sébastien M. R. Arnold, et al. ∙

∙ 02/07/2022

Policy Optimization for Stochastic Shortest Path

Policy optimization is among the most popular and successful reinforceme...

0 Liyu Chen, et al. ∙

∙ 01/31/2022

Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints

We study regret minimization for infinite-horizon average-reward Markov ...

0 Liyu Chen, et al. ∙

∙ 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...

0 Liyu Chen, et al. ∙

∙ 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...

0 Liyu Chen, et al. ∙

∙ 06/09/2021

Online Learning for Stochastic Shortest Path Model via Posterior Sampling

We consider the problem of online reinforcement learning for the Stochas...

0 Mehdi Jafarnia-Jahromi, et al. ∙

∙ 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...

0 Liyu Chen, et al. ∙

∙ 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...

0 Liyu Chen, et al. ∙

∙ 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...

0 Liyu Chen, et al. ∙

∙ 04/05/2019

Synthesized Policies for Transfer and Adaptation across Tasks and Environments

The ability to transfer in reinforcement learning is key towards buildin...

6 Hexiang Hu, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world