← Back to all news
arXiv Machine Learning By Nived Rajaraman

The Price of Hidden Curvature: An $\widetilde{\Omega} (d^{5/4} \sqrt{T})$ Lower Bound for Bandit Convex Optimization

Read the original on arXiv Machine Learning →

arXiv:2607. 18652v1 Announce Type: cross Abstract: We establish a $\widetilde\Omega(d^{5/4}\sqrt T)$ lower bound on the minimax expected regret of stochastic bandit convex optimization of $1$-Lipschitz functions on the Euclidean ball.

Summary generated by The Flow from the publisher's feed. The full article lives at arXiv Machine Learning.

Related stories

Hugging Face Trending Papers
Jul 21

The Price of Hidden Curvature: An $\widetildeΩ (d^{5/4} \sqrt{T})$ Lower Bound for Bandit Convex Optimization

We establish a $\widetildeΩ(d^{5/4}\sqrt T)$ lower bound on the minimax expected regret of stochastic bandit convex optimization of $1$-Lipschitz functions on the Euclidean ball. This presents the first nontrivial regret lower bound that grows faster than $d\sqrt{T}$ for this problem, establishing that stochastic bandit convex optimization is fundamentally harder than linear bandits.

reinforcement-learning
More like this →
arXiv Machine Learning
Jul 14

Bandit PCA with Minimax Optimal Regret

arXiv:2607. 10936v1 Announce Type: new Abstract: We study the bandit-feedback version of online principal component analysis (Bandit PCA): in each round $t = 1,\dots,T$, the adversary selects a $d \times d$ symmetric gain matrix $G_t$ with spectrum in $[0,1]$ and rank at most $r$; the learner simultaneously selects a unit vector $w_t \in S^{d-1}$ and receives the reward $w_t^\top G_t w_t$.

By Mo\"ise Blanchard, Dmitrii Ostrovskii, Aadirupa Saha
reinforcement-learning
More like this →