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. 1911.05873
  4. Cited By
A Reduction from Reinforcement Learning to No-Regret Online Learning

A Reduction from Reinforcement Learning to No-Regret Online Learning

14 November 2019
Ching-An Cheng
Rémi Tachet des Combes
Byron Boots
Geoffrey J. Gordon
    OffRL
ArXivPDFHTML

Papers citing "A Reduction from Reinforcement Learning to No-Regret Online Learning"

13 / 13 papers shown
Title
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
175
1,932
0
07 Sep 2019
Online Learning with Continuous Variations: Dynamic Regret and
  Reductions
Online Learning with Continuous Variations: Dynamic Regret and Reductions
Ching-An Cheng
Jonathan Lee
Ken Goldberg
Byron Boots
63
16
0
19 Feb 2019
Predictor-Corrector Policy Optimization
Predictor-Corrector Policy Optimization
Ching-An Cheng
Xinyan Yan
Nathan D. Ratliff
Byron Boots
OnRL
45
23
0
15 Oct 2018
Accelerating Imitation Learning with Predictive Models
Accelerating Imitation Learning with Predictive Models
Ching-An Cheng
Xinyan Yan
Evangelos A. Theodorou
Byron Boots
70
21
0
12 Jun 2018
Scalable Bilinear $π$ Learning Using State and Action Features
Scalable Bilinear πππ Learning Using State and Action Features
Yichen Chen
Lihong Li
Mengdi Wang
56
46
0
27 Apr 2018
Convergence of Value Aggregation for Imitation Learning
Convergence of Value Aggregation for Imitation Learning
Ching-An Cheng
Byron Boots
47
28
0
22 Jan 2018
Boosting the Actor with Dual Critic
Boosting the Actor with Dual Critic
Bo Dai
Albert Eaton Shaw
Niao He
Lihong Li
Le Song
64
46
0
29 Dec 2017
Primal-Dual $π$ Learning: Sample Complexity and Sublinear Run Time for
  Ergodic Markov Decision Problems
Primal-Dual πππ Learning: Sample Complexity and Sublinear Run Time for Ergodic Markov Decision Problems
Mengdi Wang
147
70
0
17 Oct 2017
Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement
  Learning
Stochastic Primal-Dual Methods and Sample Complexity of Reinforcement Learning
Yichen Chen
Mengdi Wang
63
64
0
08 Dec 2016
Online Learning with Predictable Sequences
Online Learning with Predictable Sequences
Alexander Rakhlin
Karthik Sridharan
207
359
0
18 Aug 2012
Blackwell Approachability and Low-Regret Learning are Equivalent
Blackwell Approachability and Low-Regret Learning are Equivalent
Jacob D. Abernethy
Peter L. Bartlett
Elad Hazan
128
122
0
08 Nov 2010
A Reduction of Imitation Learning and Structured Prediction to No-Regret
  Online Learning
A Reduction of Imitation Learning and Structured Prediction to No-Regret Online Learning
Stéphane Ross
Geoffrey J. Gordon
J. Andrew Bagnell
OffRL
222
3,221
0
02 Nov 2010
Solving variational inequalities with Stochastic Mirror-Prox algorithm
Solving variational inequalities with Stochastic Mirror-Prox algorithm
A. Juditsky
A. Nemirovskii
Claire Tauvel
135
443
0
04 Sep 2008
1