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. 2201.13172
  4. Cited By
Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback

Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback

31 January 2022
Tiancheng Jin
Tal Lancewicki
Haipeng Luo
Yishay Mansour
Aviv A. Rosenberg
ArXivPDFHTML

Papers citing "Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback"

3 / 3 papers shown
Title
Cooperative Online Learning in Stochastic and Adversarial MDPs
Cooperative Online Learning in Stochastic and Adversarial MDPs
Tal Lancewicki
Aviv A. Rosenberg
Yishay Mansour
43
2
0
31 Jan 2022
Nonstochastic Bandits with Composite Anonymous Feedback
Nonstochastic Bandits with Composite Anonymous Feedback
Nicolò Cesa-Bianchi
Tommaso Cesari
Roberto Colomboni
Claudio Gentile
Yishay Mansour
53
38
0
06 Dec 2021
Near-optimal Policy Optimization Algorithms for Learning Adversarial
  Linear Mixture MDPs
Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs
Jiafan He
Dongruo Zhou
Quanquan Gu
67
20
0
17 Feb 2021
1