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. 2112.02866
  4. Cited By
Nonstochastic Bandits with Composite Anonymous Feedback

Nonstochastic Bandits with Composite Anonymous Feedback

6 December 2021
Nicolò Cesa-Bianchi
Tommaso Cesari
Roberto Colomboni
Claudio Gentile
Yishay Mansour
ArXivPDFHTML

Papers citing "Nonstochastic Bandits with Composite Anonymous Feedback"

5 / 5 papers shown
Title
Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback
M. Pedramfar
Vaneet Aggarwal
55
2
0
23 Mar 2023
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays
Julian Zimmert
Yevgeny Seldin
43
52
0
14 Oct 2019
Introduction to Online Convex Optimization
Introduction to Online Convex Optimization
Elad Hazan
OffRL
170
1,929
0
07 Sep 2019
On the Complexity of Bandit Linear Optimization
On the Complexity of Bandit Linear Optimization
Ohad Shamir
100
14
0
11 Aug 2014
Online Learning under Delayed Feedback
Online Learning under Delayed Feedback
Pooria Joulani
András Gyorgy
Csaba Szepesvári
90
279
0
04 Jun 2013
1