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. 2403.10732
  4. Cited By
Variance-Dependent Regret Bounds for Non-stationary Linear Bandits

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits

15 March 2024
Zhiyong Wang
Jize Xie
Yi Chen
J. C. Lui
Dongruo Zhou
ArXivPDFHTML

Papers citing "Variance-Dependent Regret Bounds for Non-stationary Linear Bandits"

5 / 5 papers shown
Title
A Simple Approach for Non-stationary Linear Bandits
A Simple Approach for Non-stationary Linear Bandits
Peng Zhao
Lijun Zhang
Yuan Jiang
Zhi Zhou
50
83
0
09 Mar 2021
Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov
  Decision Processes
Nearly Minimax Optimal Reinforcement Learning for Linear Mixture Markov Decision Processes
Dongruo Zhou
Quanquan Gu
Csaba Szepesvári
56
205
0
15 Dec 2020
Combinatorial Semi-Bandit in the Non-Stationary Environment
Combinatorial Semi-Bandit in the Non-Stationary Environment
Wei Chen
Liwei Wang
Haoyu Zhao
Kai Zheng
54
18
0
10 Feb 2020
Randomized Exploration for Non-Stationary Stochastic Linear Bandits
Randomized Exploration for Non-Stationary Stochastic Linear Bandits
Baekjin Kim
Ambuj Tewari
19
17
0
11 Dec 2019
Weighted Linear Bandits for Non-Stationary Environments
Weighted Linear Bandits for Non-Stationary Environments
Yoan Russac
Claire Vernade
Olivier Cappé
115
106
0
19 Sep 2019
1