ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2010.00587
  4. Cited By
Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs

Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs

1 October 2020
Jiafan He
Dongruo Zhou
Quanquan Gu
ArXivPDFHTML

Papers citing "Nearly Minimax Optimal Reinforcement Learning for Discounted MDPs"

11 / 11 papers shown
Title
Neural Logistic Bandits
Neural Logistic Bandits
Seoungbin Bae
Dabeen Lee
168
0
0
04 May 2025
Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs
  with Short Burn-In Time
Regret-Optimal Model-Free Reinforcement Learning for Discounted MDPs with Short Burn-In Time
Xiang Ji
Gen Li
OffRL
32
7
0
24 May 2023
Online Reinforcement Learning with Uncertain Episode Lengths
Online Reinforcement Learning with Uncertain Episode Lengths
Debmalya Mandal
Goran Radanović
Jiarui Gan
Adish Singla
R. Majumdar
OffRL
20
5
0
07 Feb 2023
Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision
  Processes
Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes
Jiafan He
Heyang Zhao
Dongruo Zhou
Quanquan Gu
OffRL
51
53
0
12 Dec 2022
CIM: Constrained Intrinsic Motivation for Sparse-Reward Continuous Control
Xiang Zheng
Xingjun Ma
Cong Wang
28
1
0
28 Nov 2022
Multi-armed Bandit Learning on a Graph
Multi-armed Bandit Learning on a Graph
Tianpeng Zhang
Kasper Johansson
Na Li
30
6
0
20 Sep 2022
No-regret Learning in Repeated First-Price Auctions with Budget
  Constraints
No-regret Learning in Repeated First-Price Auctions with Budget Constraints
Rui Ai
Chang Wang
Chenchen Li
Jinshan Zhang
Wenhan Huang
Xiaotie Deng
30
10
0
29 May 2022
Provably Efficient Kernelized Q-Learning
Provably Efficient Kernelized Q-Learning
Shuang Liu
H. Su
MLT
25
4
0
21 Apr 2022
Learning Stochastic Shortest Path with Linear Function Approximation
Learning Stochastic Shortest Path with Linear Function Approximation
Steffen Czolbe
Jiafan He
Adrian V. Dalca
Quanquan Gu
39
30
0
25 Oct 2021
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free
  Reinforcement Learning
Breaking the Sample Complexity Barrier to Regret-Optimal Model-Free Reinforcement Learning
Gen Li
Laixi Shi
Yuxin Chen
Yuejie Chi
OffRL
45
50
0
09 Oct 2021
Achieving Zero Constraint Violation for Constrained Reinforcement
  Learning via Primal-Dual Approach
Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach
Qinbo Bai
Amrit Singh Bedi
Mridul Agarwal
Alec Koppel
Vaneet Aggarwal
107
56
0
13 Sep 2021
1