Bandit Convex Optimization: Towards Tight Bounds

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Neural Information Processing Systems

• Publication date

  2014-12-08

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

  2012cited by this paper
• On the Complexity of Bandit and Derivative-Free Stochastic Convex Optimization

  2012influential reference
• Online Learning and Online Convex Optimization

  2012cited by this paper
• Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback

  2011influential reference
• The convex optimization approach to regret minimization

  2011cited by this paper
• Optimal Algorithms for Online Convex Optimization with Multi-Point Bandit Feedback.

  2010cited by this paper
• Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization

  2008cited by this paper
• The Price of Bandit Information for Online Optimization

  2007cited by this paper
• Logarithmic regret algorithms for online convex optimization

  2006cited by this paper
• Efficient algorithms for online decision problems

  2005cited by this paper
• Nearly Tight Bounds for the Continuum-Armed Bandit Problem

  2004cited by this paper
• Online convex optimization in the bandit setting: gradient descent without a gradient

  2004influential reference
• Online Convex Programming and Generalized Infinitesimal Gradient Ascent

  2003cited by this paper

• Bandits in Flux: Adversarial Constraints in Dynamic Environments

  2026cites this paper
• The Hidden Cost of Approximation in Online Mirror Descent

  2025cites this paper
• Asymptotic Proximal Point Methods for Global Optimization

  2025cites this paper
• Self-Concordant Perturbations for Linear Bandits

  2025cites this paper
• Quantization Enabled Differential Privacy in Bandit Games With Cooperative Players

  2025cites this paper
• Non-stationary Bandit Convex Optimization: A Comprehensive Study

  2025cites this paper
• Online Episodic Convex Reinforcement Learning

  2025cites this paper
• A Regularized Online Newton Method for Stochastic Convex Bandits with Linear Vanishing Noise

  2025cites this paper
• One-Point Sampling for Distributed Bandit Convex Optimization With Time-Varying Constraints

  2025cites this paper
• Online Convex Optimization with Memory and Limited Predictions

  2024cites this paper
• Online Decision Deferral under Budget Constraints

  2024cites this paper
• Handling Heterogeneous Curvatures in Bandit LQR Control

  2024cites this paper
• Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback

  2024cites this paper
• PUROS: A Cpx-Ievered Framework for Ad Procurement in Autobidding Worlds

  2024cites this paper
• Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity

  2024cites this paper
• Online Stackelberg Optimization via Nonlinear Control

  2024cites this paper
• A conversion theorem and minimax optimality for continuum contextual bandits

  2024influential citation
• Online Newton Method for Bandit Convex Optimisation Extended Abstract

  2024cites this paper
• Online Learning in Betting Markets: Profit versus Prediction

  2024cites this paper
• Distributed Management of Fluctuating Energy Resources in Dynamic Networked Systems

  2024cites this paper
• Learning from Imperfect Human Feedback: a Tale from Corruption-Robust Dueling

  2024cites this paper
• Demand Balancing in Primal-Dual Optimization for Blind Network Revenue Management

  2024cites this paper
• Bandit Profit-Maximization for Targeted Marketing

  2024cites this paper
• Improved Regret for Bandit Convex Optimization with Delayed Feedback

  2024cites this paper
• A Unified Framework for Analyzing Meta-algorithms in Online Convex Optimization

  2024cites this paper
• Forgetting-Factor Regrets for Online Convex Optimization

  2024cites this paper
• Distributed zeroth-order optimization: Convergence rates that match centralized counterpart

  2024cites this paper
• Analyzing Queueing Problems via Bandits With Linear Reward & Nonlinear Workload Fairness

  2024cites this paper
• Learning Fair Division from Bandit Feedback

  2023influential citation
• Bandit Learning to Rank with Position-Based Click Models: Personalized and Equal Treatments

  2023cites this paper
• Online mixed discrete and continuous optimization: Algorithms, regret analysis and applications

  2023cites this paper
• Online Submodular Maximization via Online Convex Optimization

  2023cites this paper
• Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms

  2023cites this paper
• Optimal Sample Complexity Bounds for Non-convex Optimization under Kurdyka-Lojasiewicz Condition

  2023cites this paper
• Optimal Rates for Bandit Nonstochastic Control

  2023cites this paper
• A Certified Radius-Guided Attack Framework to Image Segmentation Models

  2023cites this paper
• A Second-Order Method for Stochastic Bandit Convex Optimisation

  2023cites this paper
• Bandit Convex Optimisation Revisited: FTRL Achieves $\tilde{O}(t^{1/2})$ Regret

  2023cites this paper
• Optimisation methods for dispatch and control of energy storage with renewable integration

  2022cites this paper
• Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression

  2022cites this paper
• A Note on Zeroth-Order Optimization on the Simplex

  2022cites this paper
• Adaptive Bandit Convex Optimization with Heterogeneous Curvature

  2022influential citation
• Stochastic Direct Search Methods for Blind Resource Allocation

  2022cites this paper
• Dueling Convex Optimization with General Preferences

  2022cites this paper
• Online Learning for Traffic Routing under Unknown Preferences

  2022cites this paper
• An Efficient Algorithm for Fair Multi-Agent Multi-Armed Bandit with Low Regret

  2022cites this paper
• From the Greene-Wu Convolution to Gradient Estimation over Riemannian Manifolds

  2021cites this paper
• Small Errors in Random Zeroth-Order Optimization Are Imaginary

  2021cites this paper
• Linear Bandits on Uniformly Convex Sets

  2021cites this paper
• Taming Wild Price Fluctuations: Monotone Stochastic Convex Optimization with Bandit Feedback

  2021cites this paper
• Projection-free Distributed Online Learning with Strongly Convex Losses

  2021cites this paper
• Structured Projection-free Online Convex Optimization with Multi-point Bandit Feedback

  2021cites this paper
• Optimal Stochastic Nonconvex Optimization with Bandit Feedback

  2021cites this paper
• Distributed Derivative-Free Learning Method for Stochastic Optimization Over a Network With Sparse Activity

  2021cites this paper
• Distributed Zeroth-Order Stochastic Optimization in Time-varying Networks

  2021cites this paper
• Minimax Regret for Bandit Convex Optimisation of Ridge Functions

  2021cites this paper
• Efficient Bandit Convex Optimization: Beyond Linear Losses

  2021influential citation
• Improved Regret for Zeroth-Order Stochastic Convex Bandits

  2021cites this paper
• Almost sure convergence of randomised‐difference descent algorithm for stochastic convex optimisation

  2021cites this paper
• Online convex combination of ranking models

  2021cites this paper
• Elastic Job Scheduling with Unknown Utility Functions

  2021cites this paper
• Optimal No-Regret Learning in Strongly Monotone Games with Bandit Feedback

  2021influential citation
• Imaginary Zeroth-Order Optimization

  2021cites this paper
• Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback

  2021influential citation
• Algorithmic Challenges in Ensuring Fairness at the Time of Decision

  2021cites this paper
• Regularized asymptotic descents for a class of nonconvex optimization problems

  2020cites this paper
• Reserve Price Optimization for First Price Auctions

  2020cites this paper
• Unbiased Gradient Simulation for Zeroth-Order Optimization

  2020cites this paper
• A Distributed Primal-Dual Algorithm for Bandit Online Convex Optimization with Time-Varying Coupled Inequality Constraints

  2020cites this paper
• Comparator-adaptive Convex Bandits

  2020cites this paper
• Fair Algorithms for Multi-Agent Multi-Armed Bandits

  2020cites this paper
• Online Convex Optimization Over Erdos-Renyi Random Networks

  2020cites this paper
• Bandit Linear Control

  2020cites this paper
• Boosting One-Point Derivative-Free Online Optimization via Residual Feedback

  2020cites this paper
• An Optimal Algorithm for Bandit Convex Optimization with Strongly-Convex and Smooth Loss

  2020influential citation
• Derivative-free global minimization for a class of multiple minima problems

  2020cites this paper
• Simultaneously Learning Stochastic and Adversarial Episodic MDPs with Known Transition

  2020cites this paper
• Locally Differentially Private (Contextual) Bandits Learning

  2020influential citation
• Improved Regret for Zeroth-Order Adversarial Bandit Convex Optimisation

  2020influential citation
• Regularized asymptotic descents: finding the global minima for a class of multiple minima problems

  2020cites this paper
• Submodular Function Minimization with Noisy Evaluation Oracle

  2019cites this paper
• Stochastic gradient-free descents

  2019cites this paper
• Distributed Bandit Online Convex Optimization With Time-Varying Coupled Inequality Constraints

  2019influential citation
• Improved Regret Bounds for Projection-free Bandit Convex Optimization

  2019cites this paper
• Online Continuous Submodular Maximization: From Full-Information to Bandit Feedback

  2019cites this paper
• Bandit Convex Optimization in Non-stationary Environments

  2019cites this paper
• Introduction to Multi-Armed Bandits

  2019cites this paper
• Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints

  2019influential citation
• Distributed Online Linear Regressions

  2019cites this paper
• Projection-Free Bandit Convex Optimization

  2018cites this paper
• Low-rank Bandit Methods for High-dimensional Dynamic Pricing

  2018cites this paper
• Non-stationary Stochastic Optimization under L p,q -Variation Measures

  2018influential citation
• Online learning with kernel losses

  2018cites this paper
• An Accelerated Method for Derivative-Free Smooth Stochastic Convex Optimization

  2018cites this paper
• Zeroth-Order Nonconvex Stochastic Optimization: Handling Constraints, High Dimensionality, and Saddle Points

  2018cites this paper
• An Optimal Algorithm for Online Non-Convex Learning

  2018cites this paper
• Adversarial Bandits with Knapsacks

  2018cites this paper
• Online Newton Step Algorithm with Estimated Gradient

  2018cites this paper
• An Optimal Algorithm for Online Non-Convex Learning

  2018cites this paper
• Introduction to Bandit Convex Optimization Algorithms

  2018cites this paper