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.12870
  4. Cited By
Efficient Learning in Non-Stationary Linear Markov Decision Processes

Efficient Learning in Non-Stationary Linear Markov Decision Processes

24 October 2020
Ahmed Touati
Pascal Vincent
ArXivPDFHTML

Papers citing "Efficient Learning in Non-Stationary Linear Markov Decision Processes"

7 / 7 papers shown
Title
Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
Zhiyong Wang
Jize Xie
Yi Chen
J. C. Lui
Dongruo Zhou
28
0
0
15 Mar 2024
Revisiting Weighted Strategy for Non-stationary Parametric Bandits
Revisiting Weighted Strategy for Non-stationary Parametric Bandits
Jing Wang
Peng Zhao
Zhihong Zhou
30
5
0
05 Mar 2023
MNL-Bandit in non-stationary environments
MNL-Bandit in non-stationary environments
Ayoub Foussoul
Vineet Goyal
Varun Gupta
26
2
0
04 Mar 2023
Dynamic Regret of Online Markov Decision Processes
Dynamic Regret of Online Markov Decision Processes
Peng Zhao
Longfei Li
Zhi-Hua Zhou
OffRL
24
17
0
26 Aug 2022
Recent Advances in Reinforcement Learning in Finance
Recent Advances in Reinforcement Learning in Finance
B. Hambly
Renyuan Xu
Huining Yang
OffRL
27
166
0
08 Dec 2021
Sample-Efficient Reinforcement Learning Is Feasible for Linearly
  Realizable MDPs with Limited Revisiting
Sample-Efficient Reinforcement Learning Is Feasible for Linearly Realizable MDPs with Limited Revisiting
Gen Li
Yuxin Chen
Yuejie Chi
Yuantao Gu
Yuting Wei
OffRL
24
28
0
17 May 2021
Weighted Linear Bandits for Non-Stationary Environments
Weighted Linear Bandits for Non-Stationary Environments
Yoan Russac
Claire Vernade
Olivier Cappé
82
101
0
19 Sep 2019
1