conftrace_

bandit convex optimization

23 papers

Explore in graph

Also known as

BCO

Co-occurring keywords

regret bound (1926) online learning (1777) stochastic optimization (1060) online algorithm (445) zeroth-order optimization (102) strongly-convex functions (4) adaptive adversary (8) second-order method (38) non-stationary environment (61) lipschitz function (22)

Papers

Tight Rates for Bandit Control Beyond Quadratics NIPS 2024
Improved Regret for Bandit Convex Optimization with Delayed Feedback NIPS 2024
Online Newton Method for Bandit Convex Optimisation Extended Abstract COLT 2024
Second Order Methods for Bandit Optimization and Control COLT 2024
A Second-Order Method for Stochastic Bandit Convex Optimisation COLT 2023
Federated Online and Bandit Convex Optimization ICML 2023
Optimal Rates for Bandit Nonstochastic Control NIPS 2023
Adaptive Bandit Convex Optimization with Heterogeneous Curvature COLT 2022
Efficient Bandit Convex Optimization: Beyond Linear Losses COLT 2021
Bandit Convex Optimization in Non-stationary Environments JMLR 2021
Optimal regret algorithm for Pseudo-1d Bandit Convex Optimization ICML 2021
An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss AISTATS 2020
Geometric Exploration for Online Control NIPS 2020
Bandit Convex Optimization in Non-stationary Environments AISTATS 2020
Improved Regret Bounds for Projection-free Bandit Convex Optimization AISTATS 2020
Bandit Online Learning with Unknown Delays AISTATS 2019
Projection-Free Bandit Convex Optimization AISTATS 2019
An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback JMLR 2017
Multi-scale exploration of convex functions and bandit convex optimization COLT 2016
Optimistic Bandit Convex Optimization NIPS 2016
Bandit Smooth Convex Optimization: Improving the Bias-Variance Tradeoff NIPS 2015
Bandit Convex Optimization: \sqrtT Regret in One Dimension COLT 2015
Bandit Convex Optimization: Towards Tight Bounds NIPS 2014