activity
20112023
most citedRefined Lower Bounds for Adversarial Bandits

55 citations · 121 across the 18 of their papers we have counts for

collaborators
Showing cs.LGShow all

5 papers · 1 filter

cs.LG2023

Adaptive approximation of monotone functions

Pierre Gaillard, Sébastien Gerchinovitz, Étienne de Montbrun

We study the classical problem of approximating a non-decreasing function in norm by sequentially querying its values, for known compact r…

cs.LG2023

Certified Multi-Fidelity Zeroth-Order Optimization

Étienne de Montbrun, Sébastien Gerchinovitz

We consider the problem of multi-fidelity zeroth-order optimization, where one can evaluate a function at various approximation levels (of varying costs), and the goal is to op…

cs.LG2022

A general approximation lower bound in norm, with applications to feed-forward neural networks

El Mehdi Achour, Armand Foucault, Sébastien Gerchinovitz +1

We study the fundamental limits to the expressive power of neural networks. Given two sets , of real-valued functions, we first prove a general lower bound on how well funct…

cs.LG2020★ 5 cited

Regret analysis of the Piyavskii-Shubert algorithm for global Lipschitz optimization

Clément Bouttier, Tommaso Cesari, Mélanie Ducoffe +1

We consider the problem of maximizing a non-concave Lipschitz multivariate function over a compact domain by sequentially querying its (possibly perturbed) values. We study a natur…

cs.LG2018★ 9 cited

Optimization of a SSP's Header Bidding Strategy using Thompson Sampling

Grégoire Jauvion, Nicolas Grislain, Pascal Sielenou Dkengne +2

Over the last decade, digital media (web or app publishers) generalized the use of real time ad auctions to sell their ad spaces. Multiple auction platforms, also called Supply-Sid…