ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1908.10479
  4. Cited By
Exploration-Enhanced POLITEX

Exploration-Enhanced POLITEX

27 August 2019
Yasin Abbasi-Yadkori
N. Lazić
Csaba Szepesvári
Gellert Weisz
ArXiv (abs)PDFHTML

Papers citing "Exploration-Enhanced POLITEX"

19 / 19 papers shown
Sharper Model-free Reinforcement Learning for Average-reward Markov
  Decision Processes
Sharper Model-free Reinforcement Learning for Average-reward Markov Decision ProcessesAnnual Conference Computational Learning Theory (COLT), 2023
Zihan Zhang
Qiaomin Xie
OffRL
271
29
0
28 Jun 2023
The Role of Coverage in Online Reinforcement Learning
The Role of Coverage in Online Reinforcement LearningInternational Conference on Learning Representations (ICLR), 2022
Tengyang Xie
Dylan J. Foster
Yu Bai
Nan Jiang
Sham Kakade
OffRL
398
77
0
09 Oct 2022
Proximal Point Imitation Learning
Proximal Point Imitation LearningNeural Information Processing Systems (NeurIPS), 2022
Luca Viano
Angeliki Kamoutsi
Gergely Neu
Igor Krawczuk
Volkan Cevher
577
22
0
22 Sep 2022
Towards General Function Approximation in Zero-Sum Markov Games
Towards General Function Approximation in Zero-Sum Markov GamesInternational Conference on Learning Representations (ICLR), 2021
Baihe Huang
Jason D. Lee
Zhaoran Wang
Zhuoran Yang
291
49
0
30 Jul 2021
Going Beyond Linear RL: Sample Efficient Neural Function Approximation
Going Beyond Linear RL: Sample Efficient Neural Function Approximation
Baihe Huang
Kaixuan Huang
Sham Kakade
Jason D. Lee
Qi Lei
Runzhe Wang
Jiaqi Yang
226
10
0
14 Jul 2021
Online Learning for Unknown Partially Observable MDPs
Online Learning for Unknown Partially Observable MDPsInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Mehdi Jafarnia-Jahromi
Rahul Jain
A. Nayyar
325
24
0
25 Feb 2021
Nearly Minimax Optimal Regret for Learning Infinite-horizon
  Average-reward MDPs with Linear Function Approximation
Nearly Minimax Optimal Regret for Learning Infinite-horizon Average-reward MDPs with Linear Function ApproximationInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2021
Yue Wu
Dongruo Zhou
Quanquan Gu
214
23
0
15 Feb 2021
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample
  Efficient
Sparse Feature Selection Makes Batch Reinforcement Learning More Sample Efficient
Botao Hao
Yaqi Duan
Tor Lattimore
Csaba Szepesvári
Mengdi Wang
OffRL
374
29
0
08 Nov 2020
Online Sparse Reinforcement Learning
Online Sparse Reinforcement Learning
Botao Hao
Tor Lattimore
Csaba Szepesvári
Mengdi Wang
OffRL
784
32
0
08 Nov 2020
Single-Timescale Actor-Critic Provably Finds Globally Optimal Policy
Single-Timescale Actor-Critic Provably Finds Globally Optimal PolicyInternational Conference on Learning Representations (ICLR), 2020
Zuyue Fu
Zhuoran Yang
Zhaoran Wang
362
52
0
02 Aug 2020
Learning Infinite-horizon Average-reward MDPs with Linear Function
  Approximation
Learning Infinite-horizon Average-reward MDPs with Linear Function ApproximationInternational Conference on Artificial Intelligence and Statistics (AISTATS), 2020
Chen-Yu Wei
Mehdi Jafarnia-Jahromi
Haipeng Luo
Rahul Jain
362
53
0
23 Jul 2020
PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient
  Learning
PC-PG: Policy Cover Directed Exploration for Provable Policy Gradient LearningNeural Information Processing Systems (NeurIPS), 2020
Alekh Agarwal
Mikael Henaff
Sham Kakade
Wen Sun
OffRL
335
123
0
16 Jul 2020
Online learning in MDPs with linear function approximation and bandit
  feedback
Online learning in MDPs with linear function approximation and bandit feedback
Gergely Neu
Julia Olkhovskaya
302
39
0
03 Jul 2020
Learning and Planning in Average-Reward Markov Decision Processes
Learning and Planning in Average-Reward Markov Decision Processes
Yi Wan
A. Naik
R. Sutton
OffRL
310
80
0
29 Jun 2020
A Model-free Learning Algorithm for Infinite-horizon Average-reward MDPs with Near-optimal Regret
Mehdi Jafarnia-Jahromi
Chen-Yu Wei
Rahul Jain
Haipeng Luo
334
7
0
08 Jun 2020
Upper Confidence Primal-Dual Reinforcement Learning for CMDP with
  Adversarial Loss
Upper Confidence Primal-Dual Reinforcement Learning for CMDP with Adversarial LossNeural Information Processing Systems (NeurIPS), 2020
Delin Qu
Xiaohan Wei
Zhuoran Yang
Jieping Ye
Zhaoran Wang
462
59
0
02 Mar 2020
Learning Zero-Sum Simultaneous-Move Markov Games Using Function
  Approximation and Correlated Equilibrium
Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated EquilibriumAnnual Conference Computational Learning Theory (COLT), 2020
Qiaomin Xie
Yudong Chen
Zhaoran Wang
Zhuoran Yang
495
137
0
17 Feb 2020
Provably Efficient Exploration in Policy Optimization
Provably Efficient Exploration in Policy OptimizationInternational Conference on Machine Learning (ICML), 2019
Qi Cai
Zhuoran Yang
Chi Jin
Zhaoran Wang
368
303
0
12 Dec 2019
Model-free Reinforcement Learning in Infinite-horizon Average-reward
  Markov Decision Processes
Model-free Reinforcement Learning in Infinite-horizon Average-reward Markov Decision ProcessesInternational Conference on Machine Learning (ICML), 2019
Chen-Yu Wei
Mehdi Jafarnia-Jahromi
Haipeng Luo
Hiteshi Sharma
R. Jain
378
120
0
15 Oct 2019
1
Page 1 of 1