Stochastic Multi-Armed Bandits with Unrestricted Delay Distributions
Not on the map. Why?
Abstract (arXiv)
We study the stochastic Multi-Armed Bandit (MAB) problem with random delays in the feedback received by the algorithm. We consider two settings: the reward-dependent delay setting, where realized delays may depend on the stochastic rewards, and the reward-independent delay setting. Our main contribution is algorithms that achieve near-optimal regret in each of the settings, with an additional additive dependence on the quantiles of the delay distribution. Our results do not make any assumptions on the delay distributions: in particular, we do not assume they come from any parametric family of distributions and allow for unbounded support and expectation; we further allow for infinite delays where the algorithm might occasionally not observe any feedback.
Key facts. Cited by 34 papers in the map (data through 14 Oct 2026). Builds on 7 of its 23 references that are in the map. First posted on arXiv 4 Jun 2021.
Builds on
7 of 23 references.
References · 7
- 2013Online Learning under Delayed Feedbackcited by 141
- 2016Delay and Cooperation in Nonstochastic Banditscited by 71
- 2017Stochastic Bandit Models for Delayed Conversionscited by 54
- 2019Nonstochastic Multiarmed Bandits with Unrestricted Delayscited by 46
- 2019An Optimal Algorithm for Adversarial Bandits with Arbitrary Delayscited by 44
- 2020Stochastic bandits with arm-dependent delayscited by 36
- 2020Adapting to Delays and Data in Adversarial Multi-Armed Banditscited by 29
Built on by
Citing papers per year: 2021: 2; 2022: 7; 2023: 10; 2024: 7; 2025: 5; 2026: 3.
34 papers.
Sort:
By area:
- 2022Learning in Stackelberg Games with Non-myopic Agentscited by 29
- 2022Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedbackcited by 22
- 2021Nonstochastic Bandits and Experts with Arm-Dependent Delayscited by 18
- 2023A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPscited by 15
- 2021Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Banditscited by 9
- 2023Practical Bandits: An Industry Perspectivecited by 9
- 2023A Reduction-based Framework for Sequential Decision Making with Delayed Feedbackcited by 7
- 2025Contextual Linear Bandits with Delay as Payoffcited by 7
- 2022Thompson Sampling with Unrestricted Delayscited by 6
- 2023Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedbackcited by 6
- 2024Delay as Payoff in MABcited by 6
- 2025Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offscited by 6
22 more
- 2023Regret Analysis of Repeated Delegated Choicecited by 5
- 2025Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedbackcited by 5
- 2023Efficient Reinforcement Learning with Impaired Observability: Learning to Act with Delayed and Missing State Observationscited by 4
- 2024Non-stochastic Bandits With Evolving Observationscited by 4
- 2022Partial Likelihood Thompson Samplingcited by 3
- 2022Dynamical Linear Banditscited by 3
- 2024Biased Dueling Bandits with Stochastic Delayed Feedbackcited by 3
- 2022Extending Open Bandit Pipeline to Simulate Industry Challengescited by 2
- 2023Effective Dimension in Bandit Problems under Censorshipcited by 2
- 2023Reinforcement Learning with Delayed, Composite, and Partially Anonymous Rewardcited by 2
- 2024Robust Thompson Sampling Algorithms Against Reward Poisoning Attackscited by 2
- 2025Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedbackcited by 2
- 2022Some performance considerations when using multi-armed bandit algorithms in the presence of missing datacited by 1
- 2023Stochastic Contextual Bandits with Long Horizon Rewardscited by 1
- 2023Adversarial Bandits with Multi-User Delayed Feedback: Theory and Applicationcited by 1
- 2024Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delayscited by 1
- 2024Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batchingcited by 1
- 2025Lipschitz Bandits with Stochastic Delayed Feedbackcited by 1
- 2024Multi-armed Bandits with Missing Outcomecited by 0
- 2026Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learningcited by 0
- 2026Near-Optimal Stochastic Linear Bandits with Delaycited by 0
- 2026DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedbackcited by 0
- 2026DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback9 Oct 2026
- 2026Near-Optimal Stochastic Linear Bandits with Delay15 Jun 2026
- 2026Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learning3 Mar 2026
- 2025Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback10 Oct 2025
- 2025Lipschitz Bandits with Stochastic Delayed Feedback30 Sep 2025
- 2025Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback30 May 2025
- 2025Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs25 Mar 2025
- 2025Contextual Linear Bandits with Delay as Payoff18 Feb 2025
- 2024Multi-armed Bandits with Missing Outcome8 Nov 2024
- 2024Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks25 Oct 2024
- 2024Delay as Payoff in MAB27 Aug 2024
- 2024Biased Dueling Bandits with Stochastic Delayed Feedback26 Aug 2024
22 more
- 2024Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching14 Aug 2024
- 2024Merit-based Fair Combinatorial Semi-Bandit with Unrestricted Feedback Delays22 Jul 2024
- 2024Non-stochastic Bandits With Evolving Observations27 May 2024
- 2023Adversarial Bandits with Multi-User Delayed Feedback: Theory and Application17 Oct 2023
- 2023Regret Analysis of Repeated Delegated Choice7 Oct 2023
- 2023Efficient Reinforcement Learning with Impaired Observability: Learning to Act with Delayed and Missing State Observations2 Jun 2023
- 2023A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs15 May 2023
- 2023Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedback13 May 2023
- 2023Reinforcement Learning with Delayed, Composite, and Partially Anonymous Reward4 May 2023
- 2023Effective Dimension in Bandit Problems under Censorship14 Feb 2023
- 2023A Reduction-based Framework for Sequential Decision Making with Delayed Feedback3 Feb 2023
- 2023Practical Bandits: An Industry Perspective2 Feb 2023
- 2023Stochastic Contextual Bandits with Long Horizon Rewards2 Feb 2023
- 2022Dynamical Linear Bandits16 Nov 2022
- 2022Extending Open Bandit Pipeline to Simulate Industry Challenges9 Sep 2022
- 2022Learning in Stackelberg Games with Non-myopic Agents19 Aug 2022
- 2022Some performance considerations when using multi-armed bandit algorithms in the presence of missing data8 May 2022
- 2022Partial Likelihood Thompson Sampling2 Mar 2022
- 2022Thompson Sampling with Unrestricted Delays24 Feb 2022
- 2022Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback31 Jan 2022
- 2021Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits6 Nov 2021
- 2021Nonstochastic Bandits and Experts with Arm-Dependent Delays2 Nov 2021
- 2022Learning in Stackelberg Games with Non-myopic Agentscited by 29
- 2022Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedbackcited by 22
- 2021Nonstochastic Bandits and Experts with Arm-Dependent Delayscited by 18
- 2023A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPscited by 15
- 2021Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Banditscited by 9
- 2023Practical Bandits: An Industry Perspectivecited by 9
- 2023A Reduction-based Framework for Sequential Decision Making with Delayed Feedbackcited by 7
- 2025Contextual Linear Bandits with Delay as Payoffcited by 7
- 2022Thompson Sampling with Unrestricted Delayscited by 6
- 2023Delay-Adapted Policy Optimization and Improved Regret for Adversarial MDP with Delayed Bandit Feedbackcited by 6
- 2024Delay as Payoff in MABcited by 6
- 2025Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offscited by 6
12 most cited of 33 All 33 (JSON)
- 2026DataCupid: Stable Matching Repair for Training Data Acquisition with Delayed Feedback9 Oct 2026
- 2026Near-Optimal Stochastic Linear Bandits with Delay15 Jun 2026
- 2025Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback10 Oct 2025
- 2025Lipschitz Bandits with Stochastic Delayed Feedback30 Sep 2025
- 2025Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback30 May 2025
- 2025Capacity-Constrained Online Learning with Delays: Scheduling Frameworks and Regret Trade-offs25 Mar 2025
- 2025Contextual Linear Bandits with Delay as Payoff18 Feb 2025
- 2024Multi-armed Bandits with Missing Outcome8 Nov 2024
- 2024Robust Thompson Sampling Algorithms Against Reward Poisoning Attacks25 Oct 2024
- 2024Delay as Payoff in MAB27 Aug 2024
- 2024Biased Dueling Bandits with Stochastic Delayed Feedback26 Aug 2024
- 2024Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching14 Aug 2024
12 newest of 33 All 33 (JSON)