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. 2303.13604
  4. Cited By
Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback

Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback

23 March 2023
M. Pedramfar
Vaneet Aggarwal
ArXivPDFHTML

Papers citing "Stochastic Submodular Bandits with Delayed Composite Anonymous Bandit Feedback"

11 / 11 papers shown
Title
Reinforcement Learning with Delayed, Composite, and Partially Anonymous
  Reward
Reinforcement Learning with Delayed, Composite, and Partially Anonymous Reward
Washim Uddin Mondal
Vaneet Aggarwal
60
2
0
04 May 2023
A Framework for Adapting Offline Algorithms to Solve Combinatorial
  Multi-Armed Bandit Problems with Bandit Feedback
A Framework for Adapting Offline Algorithms to Solve Combinatorial Multi-Armed Bandit Problems with Bandit Feedback
G. Nie
Yididiya Y. Nadew
Yanhui Zhu
Vaneet Aggarwal
Christopher J. Quinn
OffRL
42
14
0
30 Jan 2023
Nonstochastic Bandits with Composite Anonymous Feedback
Nonstochastic Bandits with Composite Anonymous Feedback
Nicolò Cesa-Bianchi
Tommaso Cesari
Roberto Colomboni
Claudio Gentile
Yishay Mansour
138
39
0
06 Dec 2021
Online Learning via Offline Greedy Algorithms: Applications in Market
  Design and Optimization
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
Rad Niazadeh
Negin Golrezaei
Joshua R. Wang
Fransisca Susan
Ashwinkumar Badanidiyuru
42
43
0
18 Feb 2021
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous
  Feedback
Adaptive Algorithms for Multi-armed Bandit with Composite and Anonymous Feedback
Siwei Wang
Haoyun Wang
Longbo Huang
26
11
0
13 Dec 2020
Submodular Bandit Problem Under Multiple Constraints
Submodular Bandit Problem Under Multiple Constraints
S. Takemori
Masahiro Sato
Takashi Sonoda
Janmajay Singh
Tomoko Ohkuma
26
15
0
01 Jun 2020
Online Continuous Submodular Maximization: From Full-Information to
  Bandit Feedback
Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback
Mingrui Zhang
Lin Chen
Hamed Hassani
Amin Karbasi
25
51
0
28 Oct 2019
Stochastic Bandits with Delayed Composite Anonymous Feedback
Stochastic Bandits with Delayed Composite Anonymous Feedback
Siddhant Garg
A. K. Akash
22
9
0
02 Oct 2019
Top-k Combinatorial Bandits with Full-Bandit Feedback
Top-k Combinatorial Bandits with Full-Bandit Feedback
Idan Rejwan
Yishay Mansour
41
51
0
28 May 2019
Projection-Free Online Optimization with Stochastic Gradient: From
  Convexity to Submodularity
Projection-Free Online Optimization with Stochastic Gradient: From Convexity to Submodularity
Lin Chen
Christopher Harshaw
Hamed Hassani
Amin Karbasi
52
77
0
22 Feb 2018
Online Learning under Delayed Feedback
Online Learning under Delayed Feedback
Pooria Joulani
András Gyorgy
Csaba Szepesvári
84
279
0
04 Jun 2013
1