Communities
Connect sessions
AI calendar
Organizations
Join Slack
Contact Sales
Search
Open menu
Home
Papers
2007.11849
Cited By
v1
v2 (latest)
Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation
International Conference on Artificial Intelligence and Statistics (AISTATS), 2020
23 July 2020
Chen-Yu Wei
Mehdi Jafarnia-Jahromi
Haipeng Luo
Rahul Jain
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation"
32 / 32 papers shown
No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
Jasmine Bayrooti
Sattar Vakili
Amanda Prorok
Carl Henrik Ek
151
2
0
23 Oct 2025
Finite-Time Bounds for Average-Reward Fitted Q-Iteration
Jongmin Lee
Ernest K. Ryu
OffRL
137
0
0
20 Oct 2025
Regret Analysis of Average-Reward Unichain MDPs via an Actor-Critic Approach
Swetha Ganesh
Vaneet Aggarwal
284
6
0
26 May 2025
Influential Bandits: Pulling an Arm May Change the Environment
Ryoma Sato
Shinji Ito
342
0
0
11 Apr 2025
Provably Adaptive Average Reward Reinforcement Learning for Metric Spaces
Conference on Uncertainty in Artificial Intelligence (UAI), 2024
Avik Kar
Rahul Singh
259
1
0
25 Oct 2024
Distributionally Robust Off-Dynamics Reinforcement Learning: Provable Efficiency with Linear Function Approximation
Zhishuai Liu
Pan Xu
OOD
OffRL
309
21
0
23 Feb 2024
Sharper Model-free Reinforcement Learning for Average-reward Markov Decision Processes
Annual Conference Computational Learning Theory (COLT), 2023
Zihan Zhang
Qiaomin Xie
OffRL
290
29
0
28 Jun 2023
Optimistic Planning by Regularized Dynamic Programming
International Conference on Machine Learning (ICML), 2023
Antoine Moulin
Gergely Neu
492
8
0
27 Feb 2023
Best of Both Worlds Policy Optimization
International Conference on Machine Learning (ICML), 2023
Christoph Dann
Chen-Yu Wei
Julian Zimmert
266
17
0
18 Feb 2023
ACPO: A Policy Optimization Algorithm for Average MDPs with Constraints
International Conference on Machine Learning (ICML), 2023
Akhil Agnihotri
R. Jain
Haipeng Luo
828
2
0
02 Feb 2023
Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation
International Conference on Machine Learning (ICML), 2023
Uri Sherman
Tomer Koren
Yishay Mansour
382
14
0
30 Jan 2023
Refined Regret for Adversarial MDPs with Linear Function Approximation
International Conference on Machine Learning (ICML), 2023
Yan Dai
Haipeng Luo
Chen-Yu Wei
Julian Zimmert
327
14
0
30 Jan 2023
Provable Reset-free Reinforcement Learning by No-Regret Reduction
International Conference on Machine Learning (ICML), 2023
Hoai-An Nguyen
Ching-An Cheng
OffRL
387
3
0
06 Jan 2023
Efficient Global Planning in Large MDPs via Stochastic Primal-Dual Optimization
International Conference on Algorithmic Learning Theory (ALT), 2022
Gergely Neu
Nneka Okolo
472
10
0
21 Oct 2022
Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs
International Conference on Algorithmic Learning Theory (ALT), 2022
Ian A. Kash
L. Reyzin
Zishun Yu
485
1
0
18 May 2022
Independent Policy Gradient for Large-Scale Markov Potential Games: Sharper Rates, Function Approximation, and Game-Agnostic Convergence
International Conference on Machine Learning (ICML), 2022
Dongsheng Ding
Chen-Yu Wei
Jianchao Tan
M. Jovanović
519
83
0
08 Feb 2022
Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints
International Conference on Machine Learning (ICML), 2022
Liyu Chen
R. Jain
Haipeng Luo
325
33
0
31 Jan 2022
Improved No-Regret Algorithms for Stochastic Shortest Path with Linear MDP
International Conference on Machine Learning (ICML), 2021
Liyu Chen
Rahul Jain
Haipeng Luo
231
16
0
18 Dec 2021
Adjacency constraint for efficient hierarchical reinforcement learning
IEEE Transactions on Pattern Analysis and Machine Intelligence (TPAMI), 2021
Tianren Zhang
Shangqi Guo
Tian Tan
Xiao M Hu
Feng Chen
615
24
0
30 Oct 2021
Understanding Domain Randomization for Sim-to-real Transfer
Xiaoyu Chen
Jiachen Hu
Chi Jin
Lihong Li
Liwei Wang
474
164
0
07 Oct 2021
Efficient Local Planning with Linear Function Approximation
International Conference on Algorithmic Learning Theory (ALT), 2021
Dong Yin
Botao Hao
Yasin Abbasi-Yadkori
N. Lazić
Csaba Szepesvári
421
24
0
12 Aug 2021
Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses
Neural Information Processing Systems (NeurIPS), 2021
Haipeng Luo
Chen-Yu Wei
Chung-Wei Lee
327
52
0
18 Jul 2021
Provably Efficient Representation Selection in Low-rank Markov Decision Processes: From Online to Offline RL
Conference on Uncertainty in Artificial Intelligence (UAI), 2021
Weitong Zhang
Jiafan He
Dongruo Zhou
Amy Zhang
Quanquan Gu
OffRL
309
12
0
22 Jun 2021
Online Learning for Stochastic Shortest Path Model via Posterior Sampling
Mehdi Jafarnia-Jahromi
Liyu Chen
Rahul Jain
Haipeng Luo
OffRL
302
18
0
09 Jun 2021
Average-Reward Reinforcement Learning with Trust Region Methods
International Joint Conference on Artificial Intelligence (IJCAI), 2021
Xiaoteng Ma
Xiao-Jing Tang
Li Xia
Jun Yang
Qianchuan Zhao
254
25
0
07 Jun 2021
Sample-Efficient Reinforcement Learning for Linearly-Parameterized MDPs with a Generative Model
Neural Information Processing Systems (NeurIPS), 2021
Bingyan Wang
Yuling Yan
Jianqing Fan
512
24
0
28 May 2021
Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting
Neural Information Processing Systems (NeurIPS), 2021
Gen Li
Yuxin Chen
Yuejie Chi
Yuantao Gu
Yuting Wei
OffRL
333
33
0
17 May 2021
Regret Bounds for Stochastic Shortest Path Problems with Linear Function Approximation
International Conference on Machine Learning (ICML), 2021
Daniel Vial
Advait Parulekar
Sanjay Shakkottai
R. Srikant
386
17
0
04 May 2021
Online Learning for Unknown Partially Observable MDPs
International Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Mehdi Jafarnia-Jahromi
Rahul Jain
A. Nayyar
344
24
0
25 Feb 2021
Improved Regret Bound and Experience Replay in Regularized Policy Iteration
International Conference on Machine Learning (ICML), 2021
N. Lazić
Dong Yin
Yasin Abbasi-Yadkori
Csaba Szepesvári
OffRL
166
20
0
25 Feb 2021
Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function Approximation
International Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Yue Wu
Dongruo Zhou
Quanquan Gu
228
23
0
15 Feb 2021
Nonstationary Reinforcement Learning with Linear Function Approximation
Huozhi Zhou
Jinglin Chen
Lav Varshney
A. Jagmohan
433
33
0
08 Oct 2020
1
Page 1 of 1
