Lipschitz Bandits with Arbitrary Feedback Delays

[2608.15036] Lipschitz Bandits with Arbitrary Feedback Delays Skip to main content Search Submit Donate Log in Search arXiv Press Enter to search · Advanced search Computer Science > Machine Learning arXiv:2608.15036 (cs) [Submitted on 15 Aug 2026] Title: Lipschitz Bandits with Arbitrary Feedback Delays Authors: Yuhao Liu , Yu Chen , Longbo Huang View a PDF of the paper titled Lipschitz Bandits with Arbitrary Feedback Delays, by Yuhao Liu and 2 other authors View PDF HTML (experimental) Abstract: The Lipschitz bandit problem extends the traditional multi-armed bandit framework to continuous action spaces by assuming that the reward functions satisfy a Lipschitz condition. This work investigates Lipschitz bandits under arbitrary feedback delays, where reward signals are not received immediately upon taking an action but after an arbitrarily chosen delay. We consider both stochastic and adversarial reward settings, proposing an elimination-based algorithm and an EXP3-based algorithm, respectively. For both settings, our algorithms achieve a regret bound of $\tilde{O}\left(T^{\frac{d_z+1}{d_z+2}}+\sqrt{D}\right)$ over a time horizon $T$ with total delay $D$, where the main difference between settings lies in the definition of the zooming dimension $d_z$. Our bounds match existing delay-free regret guarantees for Lipschitz bandits and characterize the additional $\tilde{O}(\sqrt{D})$ impact introduced by feedback delays. Comments: 10 pages of main contents, 26 pages in total Subjects: Machine Learning (cs.LG) Cite as: arXiv:2608.15036 [cs.LG] (or arXiv:2608.15036v1 [cs.LG] for this version) https://doi.org/10.48550/arXiv.2608.15036 Focus to learn more arXiv-issued DOI via DataCite Submission history From: Yuhao Liu [ view email ] [v1] Sat, 15 Aug 2026 04:39:49 UTC (1,575 KB) Full-text links: Access Paper: View a PDF of the paper titled Lipschitz Bandits with Arbitrary Feedback Delays, by Yuhao Liu and 2 other authors View PDF HTML (experimental) TeX Source view license Current browse context: cs.LG < prev | next > new | recent | 2026-08 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer ( What is the Explorer? ) Connected Papers Toggle Connected Papers ( What is Connected Papers? ) Litmaps Toggle Litmaps ( What is Litmaps? ) scite.ai Toggle scite Smart Citations ( What are Smart Citations? ) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv ( What is alphaXiv? ) Links to Code Toggle CatalyzeX Code Finder for Papers ( What is CatalyzeX? ) DagsHub Toggle DagsHub ( What is DagsHub? ) GotitPub Toggle Gotit.pub ( What is GotitPub? ) Huggingface Toggle Hugging Face ( What is Huggingface? ) ScienceCast Toggle ScienceCast ( What is ScienceCast? ) Demos Demos Replicate Toggle Replicate ( What is Replicate? ) Spaces Toggle Hugging Face Spaces ( What is Spaces? ) Spaces Toggle TXYZ.AI ( What is TXYZ.AI? ) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower ( What are Influence Flowers? ) Core recommender toggle CORE Recommender ( What is CORE? ) IArxiv recommender toggle IArxiv Recommender ( What is IArxiv? ) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs . Which authors of this paper are endorsers? | Disable MathJax ( What is MathJax? ) We gratefully acknowledge support from our major funders , member institutions , , and all contributors. About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab) Major funding support from

Related documents

• Lipschitz Bandits with Arbitrary Feedback Delays#610990
• Dynamic Content Caching with Waiting Costs via Restless Multi-Armed Bandits#1064865
• Visitation measures for non-linear iterations with random perturbations#1142154
• Stabilizing updates in differentially private stochastic gradient descent with buffered rejection.#150196
• Quantum bandits#478173