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. 2405.16843
  4. Cited By
Non-stochastic Bandits With Evolving Observations

Non-stochastic Bandits With Evolving Observations

27 May 2024
Yogev Bar-On
Yishay Mansour
ArXivPDFHTML

Papers citing "Non-stochastic Bandits With Evolving Observations"

6 / 6 papers shown
Title
Contextual Linear Bandits with Delay as Payoff
Contextual Linear Bandits with Delay as Payoff
Mengxiao Zhang
Yingfei Wang
Haipeng Luo
43
0
0
18 Feb 2025
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback
Saeed Masoudian
Julian Zimmert
Yevgeny Seldin
31
18
0
29 Jun 2022
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial
  Corruptions
Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions
Jiafan He
Dongruo Zhou
Tong Zhang
Quanquan Gu
66
46
0
13 May 2022
Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback
Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback
Tiancheng Jin
Tal Lancewicki
Haipeng Luo
Yishay Mansour
Aviv A. Rosenberg
74
21
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
108
39
0
06 Dec 2021
On Optimal Robustness to Adversarial Corruption in Online Decision
  Problems
On Optimal Robustness to Adversarial Corruption in Online Decision Problems
Shinji Ito
42
22
0
22 Sep 2021
1