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. 1903.06187
  4. Cited By
No-regret Exploration in Contextual Reinforcement Learning
v1v2v3 (latest)

No-regret Exploration in Contextual Reinforcement Learning

14 March 2019
Aditya Modi
Ambuj Tewari
    OffRL
ArXiv (abs)PDFHTML

Papers citing "No-regret Exploration in Contextual Reinforcement Learning"

12 / 12 papers shown
Title
Sample Complexity of Reinforcement Learning using Linearly Combined
  Model Ensembles
Sample Complexity of Reinforcement Learning using Linearly Combined Model Ensembles
Aditya Modi
Nan Jiang
Ambuj Tewari
Satinder Singh
70
132
0
23 Oct 2019
Policy Certificates: Towards Accountable Reinforcement Learning
Policy Certificates: Towards Accountable Reinforcement Learning
Christoph Dann
Ashutosh Adhikari
Wei Wei
Jimmy J. Lin
OffRL
143
146
0
07 Nov 2018
Efficient online algorithms for fast-rate regret bounds under sparsity
Efficient online algorithms for fast-rate regret bounds under sparsity
Pierre Gaillard
Olivier Wintenberger
35
10
0
23 May 2018
Logistic Regression: The Importance of Being Improper
Logistic Regression: The Importance of Being Improper
Dylan J. Foster
Satyen Kale
Haipeng Luo
M. Mohri
Karthik Sridharan
59
78
0
25 Mar 2018
Markov Decision Processes with Continuous Side Information
Markov Decision Processes with Continuous Side Information
Aditya Modi
Nan Jiang
Satinder Singh
Ambuj Tewari
OffRL
68
62
0
15 Nov 2017
Scalable Generalized Linear Bandits: Online Computation and Hashing
Scalable Generalized Linear Bandits: Online Computation and Hashing
Kwang-Sung Jun
Aniruddha Bhargava
Robert D. Nowak
Rebecca Willett
96
126
0
01 Jun 2017
Minimax Regret Bounds for Reinforcement Learning
Minimax Regret Bounds for Reinforcement Learning
M. G. Azar
Ian Osband
Rémi Munos
95
778
0
16 Mar 2017
Provably Optimal Algorithms for Generalized Linear Contextual Bandits
Provably Optimal Algorithms for Generalized Linear Contextual Bandits
Lihong Li
Yu Lu
Dengyong Zhou
170
94
0
28 Feb 2017
On Lower Bounds for Regret in Reinforcement Learning
On Lower Bounds for Regret in Reinforcement Learning
Ian Osband
Benjamin Van Roy
85
101
0
09 Aug 2016
Online Stochastic Linear Optimization under One-bit Feedback
Online Stochastic Linear Optimization under One-bit Feedback
Lijun Zhang
Tianbao Yang
Rong Jin
Zhi Zhou
60
66
0
25 Sep 2015
Contextual Markov Decision Processes
Contextual Markov Decision Processes
Assaf Hallak
Dotan Di Castro
Shie Mannor
93
248
0
08 Feb 2015
Online learning in MDPs with side information
Online learning in MDPs with side information
Yasin Abbasi-Yadkori
Gergely Neu
OffRL
66
18
0
26 Jun 2014
1