A simple parameter-free and adaptive approach to optimization under a
minimal local smoothness assumption

v1v2 (latest)

A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption

1 October 2018

Peter L. Bartlett

Victor Gabillon

ArXiv (abs)PDF HTML

Papers citing "A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption"

6 / 6 papers shown

Title
Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants Fares Fourati Salma Kharrat Vaneet Aggarwal Mohamed-Slim Alouini 109 0 0 06 Feb 2025
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
Pure Exploration in Kernel and Neural Bandits Yinglun Zhu Dongruo Zhou Ruoxi Jiang Quanquan Gu Rebecca Willett Robert D. Nowak 59 16 0 22 Jun 2021
Instance-Dependent Bounds for Zeroth-order Lipschitz Optimization with Error Certificates François Bachoc Tommaso Cesari Sébastien Gerchinovitz 41 10 0 03 Feb 2021
On Regret with Multiple Best Arms Yinglun Zhu Robert D. Nowak 67 18 0 26 Jun 2020
Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits A. Akhavan Massimiliano Pontil Alexandre B. Tsybakov 49 41 0 14 Jun 2020