No article text was recorded for this version.
adversarial delay robustness
Version 1 of 199 papers139 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Nonstochastic Multiarmed Bandits with Unrestricted Delays
- Blog: Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function
- Blog: Banker Online Mirror Descent
- Blog: Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function
- Blog: Online Learning under Delayed Feedback
- Blog: Stochastic Submodular Bandits With Delayed Composite Anonymous Bandit Feedback
- Blog: No Discounted-Regret Learning in Adversarial Bandits with Delays
- Blog: Learning from Delayed Feedback in Games via Extra Prediction
- Blog: Online Optimization with Feedback Delay and Nonlinear Switching Cost
- Blog: A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays
- Blog: Bandit Online Learning with Unknown Delays
- Blog: A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback
- Blog: Delay and Cooperation in Nonstochastic Bandits
- Blog: Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning
- Blog: Online Learning with Adversarial Delays
- Blog: Improved Regret for Bandit Convex Optimization with Delayed Feedback
- Blog: A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs
- Blog: Online Frank-Wolfe with Arbitrary Delays
- Blog: Linear bandits with Stochastic Delayed Feedback
- Blog: Regret Bounds for Adaptive Nonlinear Control
- Blog: Online Frank-Wolfe with Unknown Delays
- Blog: Continuous Submodular Maximization: Boosting via Non-oblivious Function
- Blog: Online Strongly Convex Optimization with Unknown Delays
- Blog: Delay and Cooperation in Nonstochastic Bandits
- Blog: Improved Regret for Bandit Convex Optimization with Delayed Feedback
- Blog: Adapting to Delays and Data in Adversarial Multi-Armed Bandits
- Blog: An Improved Best-of-both-worlds Algorithm for Bandits with Delayed Feedback
- Blog: Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
- Blog: Procrastinated Tree Search: Black-Box Optimization with Delayed, Noisy, and Multi-Fidelity Feedback
- Blog: Passivity, No-Regret, and Convergent Learning in Contractive Games
- Blog: Biased Dueling Bandits with Stochastic Delayed Feedback
- Blog: Biased Dueling Bandits with Stochastic Delayed Feedback
- Blog: Capacity and Pricing Management with Demand Learning
- Blog: Online EXP3 Learning in Adversarial Bandits with Delayed Feedback
- Blog: Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback
- Blog: Gradient-free Online Learning in Continuous Games with Delayed Rewards
- Blog: Delay as Payoff in MAB
- Blog: Distributed Stochastic Bandit Learning with Context Distributions
- Blog: Effective Dimension in Bandit Problems under Censorship
- Blog: Bandit Learning with Delayed Impact of Actions
- Blog: The Blinded Bandit: Learning with Adaptive Feedback
- Blog: Nonstochastic Bandits with Composite Anonymous Feedback
- Blog: Is Stochastic Mirror Descent Vulnerable to Adversarial Delay Attacks? A Traffic Assignment Resilience Study
- Blog: Bandit and Delayed Feedback in Online Structured Prediction
- Blog: Multi-Agent Online Optimization with Delays: Asynchronicity, Adaptivity, and Optimism
- Blog: Delay and Cooperation in Nonstochastic Linear Bandits
- Blog: Projection-free Online Learning with Arbitrary Delays
- Blog: Aggregating Strategies for Long-term Forecasting
- Blog: Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
- Blog: Minimax Optimal Strategy for Delayed Observations in Online Reinforcement Learning
- Blog: Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
- Blog: Continuous Submodular Maximization: Boosting via Non-oblivious Function
- Blog: Adaptive Aggregation of Arbitrary Online Trackers with a Regret Bound
- Blog: Learning from Delayed Outcomes via Proxies with Applications to Recommender Systems
- Blog: Not-a-Bandit: Provably No-Regret Drafter Selection in Speculative Decoding for LLMs
- Blog: Online Sequential Decision-Making with Unknown Delays
- Blog: Online Scoring with Delayed Information: A Convex Optimization Viewpoint
- Blog: Improved Best-of-Both-Worlds Regret for Bandits with Delayed Feedback
- Blog: Decentralized Nash Equilibria Learning for Online Game With Bandit Feedback
- Blog: Distributed Online Learning for Joint Regret with Communication Constraints
Showing 60 of 99 papers.
History & citation
Current · Permanent link
- Multiarmed Bandits with Strategic Feedback Skipping merged into this direction (58% overlap)
- Algorithmic Stability and Robustness to Feedback Latency merged into this direction (77% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_adversarial_delay_robustness_5b339869,
title = {adversarial delay robustness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/adversarial-delay-robustness/rdr_5b339869504c45288efd742c6c86e019},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_adversarial_delay_robustness_5b339869_v1,
title = {adversarial delay robustness},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/adversarial-delay-robustness/rdr_5b339869504c45288efd742c6c86e019/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}