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. 2208.12483
  4. Cited By
Dynamic Regret of Online Markov Decision Processes

Dynamic Regret of Online Markov Decision Processes

26 August 2022
Peng Zhao
Longfei Li
Zhi-Hua Zhou
    OffRL
ArXivPDFHTML

Papers citing "Dynamic Regret of Online Markov Decision Processes"

13 / 13 papers shown
Title
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation
Long-Fei Li
Yu-Jie Zhang
Peng Zhao
Zhi-Hua Zhou
101
4
0
17 Jan 2025
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs
Long-Fei Li
Peng Zhao
Zhi-Hua Zhou
49
0
0
05 Nov 2024
Optimistic Regret Bounds for Online Learning in Adversarial Markov
  Decision Processes
Optimistic Regret Bounds for Online Learning in Adversarial Markov Decision Processes
Sang Bin Moon
Abolfazl Hashemi
25
1
0
03 May 2024
Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit
  Feedback and Unknown Transition
Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition
Long-Fei Li
Peng Zhao
Zhi-Hua Zhou
56
4
0
07 Mar 2024
Efficient Methods for Non-stationary Online Learning
Efficient Methods for Non-stationary Online Learning
Peng Zhao
Yan-Feng Xie
Lijun Zhang
Zhi-Hua Zhou
44
19
0
16 Sep 2023
Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with
  Q-Value Predictions
Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictions
Tongxin Li
Yiheng Lin
Shaolei Ren
Adam Wierman
AAML
OffRL
34
6
0
20 Jul 2023
Online Resource Allocation in Episodic Markov Decision Processes
Online Resource Allocation in Episodic Markov Decision Processes
Duksang Lee
William Overman
Dabeen Lee
37
1
0
18 May 2023
Adapting to Continuous Covariate Shift via Online Density Ratio
  Estimation
Adapting to Continuous Covariate Shift via Online Density Ratio Estimation
Yu-Jie Zhang
Zhenyu Zhang
Peng Zhao
Masashi Sugiyama
OOD
14
11
0
06 Feb 2023
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic
  Shortest Path
Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path
Liyu Chen
Andrea Tirinzoni
Matteo Pirotta
A. Lazaric
31
3
0
10 Oct 2022
Adapting to Online Label Shift with Provable Guarantees
Adapting to Online Label Shift with Provable Guarantees
Yong Bai
Yu-Jie Zhang
Peng Zhao
Masashi Sugiyama
Zhi-Hua Zhou
OOD
27
25
0
05 Jul 2022
Optimal Dynamic Regret in Exp-Concave Online Learning
Optimal Dynamic Regret in Exp-Concave Online Learning
Dheeraj Baby
Yu-Xiang Wang
45
43
0
23 Apr 2021
Non-stationary Online Learning with Memory and Non-stochastic Control
Non-stationary Online Learning with Memory and Non-stochastic Control
Peng Zhao
Yu-Hu Yan
Yu-Xiang Wang
Zhi-Hua Zhou
33
47
0
07 Feb 2021
Efficient Learning in Non-Stationary Linear Markov Decision Processes
Efficient Learning in Non-Stationary Linear Markov Decision Processes
Ahmed Touati
Pascal Vincent
37
29
0
24 Oct 2020
1