v1v2 (latest)

Lipschitz Bandits without the Lipschitz Constant

25 May 2011

Papers citing "Lipschitz Bandits without the Lipschitz Constant"

48 / 48 papers shown

Title
Quick-Draw Bandits: Quickly Optimizing in Nonstationary Environments with Extremely Many Arms Derek Everett Fred Lu Edward Raff Fernando Camacho James Holt 32 0 0 30 May 2025
Non-Stationary Lipschitz Bandits Nicolas Nguyen Solenne Gaucher Claire Vernade 31 0 0 24 May 2025
Multiplayer Information Asymmetric Bandits in Metric Spaces William Chang Aditi Kartik 102 1 0 11 Mar 2025
Bandit Optimal Transport Lorenzo Croissant 134 0 0 11 Feb 2025
Pretraining Decision Transformers with Reward Prediction for In-Context Multi-task Structured Bandit Learning Subhojyoti Mukherjee Josiah P. Hanna Qiaomin Xie Robert Nowak 245 2 0 07 Jun 2024
Batched Stochastic Bandit for Nondegenerate Functions Yu Liu Yunlu Shu Tianyu Wang 186 0 0 09 May 2024
Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions Sungwoo Park Junyeop Kwon Byeongnoh Kim Suhyun Chae Jeeyong Lee Dabeen Lee 76 0 0 23 Feb 2024
Certified Multi-Fidelity Zeroth-Order Optimization Étienne de Montbrun Sébastien Gerchinovitz 83 1 0 02 Aug 2023
A Lipschitz Bandits Approach for Continuous Hyperparameter Optimization Yasong Feng Weijian Luo Yimin Huang Tianyu Wang 54 8 0 03 Feb 2023
Invariant Lipschitz Bandits: A Side Observation Approach Nam-Phuong Tran Long Tran-Thanh 80 1 0 14 Dec 2022
Distributed Task Management in Fog Computing: A Socially Concave Bandit Game Xiaotong Cheng S. Maghsudi 44 2 0 28 Mar 2022
Regret Minimization with Performative Feedback Meena Jagadeesan Tijana Zrnic Celestine Mendler-Dünner 97 35 0 01 Feb 2022
Rotting Infinitely Many-armed Bandits Jung-hun Kim Milan Vojnović Se-Young Yun 73 6 0 31 Jan 2022
Lipschitz Bandits with Batched Feedback Yasong Feng Zengfeng Huang Tianyu Wang 73 14 0 19 Oct 2021
Efficient Sampling in POMDPs with Lipschitz Bandits for Motion Planning in Continuous Spaces Omer Sahin Tas Felix Hauser Martin Lauer 27 4 0 08 Jun 2021
Optimal Stochastic Nonconvex Optimization with Bandit Feedback Puning Zhao Lifeng Lai 121 3 0 30 Mar 2021
Pareto Optimal Model Selection in Linear Bandits Yinglun Zhu Robert D. Nowak 43 14 0 12 Feb 2021
Sequential Choice Bandits with Feedback for Personalizing users' experience A. Rangi M. Franceschetti Long Tran-Thanh 15 2 0 05 Jan 2021
Be Greedy in Multi-Armed Bandits Matthieu Jedor Jonathan Louëdec Vianney Perchet 397 8 0 04 Jan 2021
Smooth Bandit Optimization: Generalization to Hölder Space Yusha Liu Yining Wang Aarti Singh 49 10 0 11 Dec 2020
Continuum-Armed Bandits: A Function Space Perspective Shashank Singh 40 10 0 15 Oct 2020
Filtered Poisson Process Bandit on a Continuum James A. Grant R. Szechtman 51 7 0 20 Jul 2020
Bandits for BMO Functions Tianyu Wang Cynthia Rudin 22 5 0 17 Jul 2020
On Regret with Multiple Best Arms Yinglun Zhu Robert D. Nowak 63 18 0 26 Jun 2020
Nearly Optimal Regret for Stochastic Linear Bandits with Heavy-Tailed Payoffs Bo Xue Guanghui Wang Yimu Wang Lijun Zhang 71 50 0 28 Apr 2020
Regret and Belief Complexity Trade-off in Gaussian Process Bandits via Information Thresholding Amrit Singh Bedi Dheeraj Peddireddy Vaneet Aggarwal Brian M. Sadler Alec Koppel 23 1 0 23 Mar 2020
Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimization Clément Bouttier Tommaso Cesari Mélanie Ducoffe Sébastien Gerchinovitz 31 15 0 06 Feb 2020
On Thompson Sampling for Smoother-than-Lipschitz Bandits James A. Grant David S. Leslie 58 6 0 08 Jan 2020
Fair Contextual Multi-Armed Bandits: Theory and Experiments Yifang Chen Alex Cuellar Haipeng Luo Jignesh Modi Heramb Nemlekar Stefanos Nikolaidis FaML 83 61 0 13 Dec 2019
Polynomial Cost of Adaptation for X -Armed Bandits Hédi Hadiji 96 11 0 24 May 2019
Derivative-Free Global Optimization Algorithms: Bayesian Method and Lipschitzian Approaches Jiawei Zhang 8 1 0 19 Apr 2019
Introduction to Multi-Armed Bandits Aleksandrs Slivkins 675 1,024 0 15 Apr 2019
Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting A. Krishnamurthy John Langford Aleksandrs Slivkins Chicheng Zhang OffRL 173 65 0 05 Feb 2019
Learning Approximately Optimal Contracts Alon Cohen Moran Koren Argyrios Deligkas 51 17 0 16 Nov 2018
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption Peter L. Bartlett Victor Gabillon Michal Valko 40 33 0 01 Oct 2018
Continuous Assortment Optimization with Logit Choice Probabilities under Incomplete Information Yannik Peeters A. V. D. Boer Michel Mandjes 29 4 0 17 Jul 2018
Global optimization of Lipschitz functions C. Malherbe Nicolas Vayatis 79 120 0 07 Mar 2017
Algorithmic Chaining and the Role of Partial Feedback in Online Nonparametric Learning Nicolò Cesa-Bianchi Pierre Gaillard Claudio Gentile Sébastien Gerchinovitz 56 0 0 27 Feb 2017
Global Continuous Optimization with Error Bound and Fast Convergence Kenji Kawaguchi Y. Maruyama Xiaoyu Zheng 44 24 0 17 Jul 2016
Bayesian Optimization with Exponential Convergence Kenji Kawaguchi L. Kaelbling Tomás Lozano-Pérez 110 108 0 05 Apr 2016
Unimodal Bandits without Smoothness Richard Combes Alexandre Proutiere 122 18 0 28 Jun 2014
Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems Chien-Ju Ho Aleksandrs Slivkins Jennifer Wortman Vaughan 165 149 0 12 May 2014
Online Stochastic Optimization under Correlated Bandit Feedback M. G. Azar A. Lazaric Emma Brunskill OffRL 68 52 0 04 Feb 2014
Bandits and Experts in Metric Spaces Robert D. Kleinberg Aleksandrs Slivkins E. Upfal 188 125 0 04 Dec 2013
Stochastic continuum armed bandit problem of few linear parameters in high dimensions Hemant Tyagi Sebastian U. Stich B. Gärtner 47 0 0 01 Dec 2013
Continuum armed bandit problem of few variables in high dimensions Hemant Tyagi B. Gärtner 76 14 0 21 Apr 2013
Adaptive-treed bandits Adam D. Bull 104 26 0 11 Feb 2013
Contextual Bandits with Similarity Information Aleksandrs Slivkins 497 450 0 23 Jul 2009