one-dimensional 1optimal convergence rate 1stochastic convex optimization 1subgaussian noise 1zero-order optimization 1
From the 1 of 6 linked papers with an AI index.
79 citations · 97 across the 6 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2026★ 15 cited
Revealing graph bandits for maximizing local influence
Alexandra Carpentier, Michal Valko
We study a graph bandit setting where the objective of the learner is to detect the most influential node of a graph by requesting as little information from the graph as possible.…
cs.LG2026★ 79 cited
Stochastic simultaneous optimistic optimization
Michal Valko, Alexandra Carpentier, Rémi Munos
We study the problem of global maximization of a function f given a finite number of evaluations perturbed by noise. We consider a very weak assumption on the function, namely that…