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. 2002.00287
  4. Cited By
Efficient and Robust Algorithms for Adversarial Linear Contextual
  Bandits

Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits

1 February 2020
Gergely Neu
Julia Olkhovskaya
ArXivPDFHTML

Papers citing "Efficient and Robust Algorithms for Adversarial Linear Contextual Bandits"

14 / 14 papers shown
Title
Second Order Bounds for Contextual Bandits with Function Approximation
Second Order Bounds for Contextual Bandits with Function Approximation
Aldo Pacchiano
59
4
0
24 Sep 2024
On Bits and Bandits: Quantifying the Regret-Information Trade-off
On Bits and Bandits: Quantifying the Regret-Information Trade-off
Itai Shufaro
Nadav Merlis
Nir Weinberger
Shie Mannor
38
0
0
26 May 2024
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual
  Bandits
LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
Masahiro Kato
Shinji Ito
36
0
0
05 Mar 2024
Refined Sample Complexity for Markov Games with Independent Linear
  Function Approximation
Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
Yan Dai
Qiwen Cui
S. S. Du
47
1
0
11 Feb 2024
Best-of-Both-Worlds Linear Contextual Bandits
Best-of-Both-Worlds Linear Contextual Bandits
Masahiro Kato
Shinji Ito
53
0
0
27 Dec 2023
Harnessing the Power of Federated Learning in Federated Contextual
  Bandits
Harnessing the Power of Federated Learning in Federated Contextual Bandits
Chengshuai Shi
Ruida Zhou
Kun Yang
Cong Shen
FedML
21
0
0
26 Dec 2023
Improved Regret for Efficient Online Reinforcement Learning with Linear
  Function Approximation
Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation
Uri Sherman
Tomer Koren
Yishay Mansour
32
12
0
30 Jan 2023
Refined Regret for Adversarial MDPs with Linear Function Approximation
Refined Regret for Adversarial MDPs with Linear Function Approximation
Yan Dai
Haipeng Luo
Chen-Yu Wei
Julian Zimmert
31
12
0
30 Jan 2023
Reward Imputation with Sketching for Contextual Batched Bandits
Reward Imputation with Sketching for Contextual Batched Bandits
Xiao Zhang
Ninglu Shao
Zihua Si
Jun Xu
Wen Wang
Hanjing Su
Jirong Wen
OffRL
25
1
0
13 Oct 2022
Misspecified Gaussian Process Bandit Optimization
Misspecified Gaussian Process Bandit Optimization
Ilija Bogunovic
Andreas Krause
55
42
0
09 Nov 2021
Linear Contextual Bandits with Adversarial Corruptions
Linear Contextual Bandits with Adversarial Corruptions
Heyang Zhao
Dongruo Zhou
Quanquan Gu
AAML
28
24
0
25 Oct 2021
Contextual Games: Multi-Agent Learning with Side Information
Contextual Games: Multi-Agent Learning with Side Information
Pier Giuseppe Sessa
Ilija Bogunovic
Andreas Krause
Maryam Kamgarpour
52
21
0
13 Jul 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
Kernel-based methods for bandit convex optimization
Kernel-based methods for bandit convex optimization
Sébastien Bubeck
Ronen Eldan
Y. Lee
84
164
0
11 Jul 2016
1