Cover Image

Non-Stationary Bandit Convex Optimization: An Optimal Algorithm with Two-Point Feedback

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	He, Chang, Jiang, Bo, Zhang, Shuzhong
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Relatively Smooth Optimization over Riemannian Manifolds
by: He, Chang, et al.
Published: (2025)

Complexity Analysis of Convex Majorization Schemes for Nonconvex Constrained Optimization
by: Wang, Nuozhou, et al.
Published: (2025)

One-Point Residual Feedback Algorithms for Distributed Online Convex and Non-convex Optimization
by: Wang, Yaowen, et al.
Published: (2025)

On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem
by: Jiang, Xiaotian, et al.
Published: (2026)

History-Aware Adaptive High-Order Tensor Regularization
by: He, Chang, et al.
Published: (2025)

A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization
by: Meng, Qing-xin, et al.
Published: (2025)

An Accelerated Variance Reduced Extra-Point Approach to Finite-Sum VI and Optimization
by: Huang, Kevin, et al.
Published: (2022)

The Computational Complexity of Finding Stationary Points in Non-Convex Optimization
by: Hollender, Alexandros, et al.
Published: (2023)

New Results on the Polyak Stepsize: Tight Convergence Analysis and Universal Function Classes
by: He, Chang, et al.
Published: (2025)

Adversarial Network Optimization under Bandit Feedback: Maximizing Utility in Non-Stationary Multi-Hop Networks
by: Dai, Yan, et al.
Published: (2024)

Online Non-Stationary Stochastic Quasar-Convex Optimization
by: Pun, Yuen-Man, et al.
Published: (2024)

Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback
by: Barakat, Anas, et al.
Published: (2026)

Efficient First Order Method for Saddle Point Problems with Higher Order Smoothness
by: Wang, Nuozhou, et al.
Published: (2023)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
by: Zhang, Liang, et al.
Published: (2023)

Near-Optimal Algorithms for Convex Simple Bilevel Optimization under Weak Assumptions
by: Jiang, Rujun, et al.
Published: (2024)

Optimal Decentralized Composite Optimization for Convex Functions
by: Ye, Haishan, et al.
Published: (2023)

On Approximation Algorithms for Commutative Quaternion Polynomial Optimization
by: He, Chang, et al.
Published: (2025)

A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms
by: Jiang, Xiaotian, et al.
Published: (2024)

Safe Online Convex Optimization with Multi-Point Feedback
by: Hutchinson, Spencer, et al.
Published: (2024)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints
by: Zhang, Kunpeng, et al.
Published: (2024)

Smooth Non-Stationary Bandits
by: Jia, Su, et al.
Published: (2023)

Optimization Algorithms as Robust Feedback Controllers
by: Hauswirth, Adrian, et al.
Published: (2021)

Customized Interior-Point Methods Solver for Embedded Real-Time Convex Optimization
by: Jang, Jae-Il, et al.
Published: (2025)

Prediction-Correction Algorithm for Time-Varying Smooth Non-Convex Optimization
by: Iwakiri, Hidenori, et al.
Published: (2024)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sinha, Abhishek, et al.
Published: (2023)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

Near-Optimal Convex Simple Bilevel Optimization with a Bisection Method
by: Wang, Jiulin, et al.
Published: (2024)

A Parameter-Free and Near-Optimal Zeroth-Order Algorithm for Stochastic Convex Optimization
by: Ren, Kunjie, et al.
Published: (2025)

Distributed Adaptive Gradient Algorithm with Gradient Tracking for Stochastic Non-Convex Optimization
by: Han, Dongyu, et al.
Published: (2024)

A Note on Complexity for Two Classes of Structured Non-Smooth Non-Convex Compositional Optimization
by: Yao, Yao, et al.
Published: (2024)

On Linear Convergence in Smooth Convex-Concave Bilinearly-Coupled Saddle-Point Optimization: Lower Bounds and Optimal Algorithms
by: Kovalev, Dmitry, et al.
Published: (2024)

On the Complexity of Finding Stationary Points in Nonconvex Simple Bilevel Optimization
by: Cao, Jincheng, et al.
Published: (2025)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
by: Kovalev, Dmitry, et al.
Published: (2024)

Median Clipping for Zeroth-order Non-Smooth Convex Optimization and Multi-Armed Bandit Problem with Heavy-tailed Symmetric Noise
by: Kornilov, Nikita, et al.
Published: (2024)

Optimal Primal-Dual Algorithm with Last iterate Convergence Guarantees for Stochastic Convex Optimization Problems
by: Boob, Digvijay, et al.
Published: (2024)

Distributed Online Bandit Nonconvex Optimization with One-Point Residual Feedback via Dynamic Regret
by: Hua, Youqing, et al.
Published: (2024)

Bandit Convex Optimisation
by: Lattimore, Tor
Published: (2024)

Optimal $\mathbb{H}_2$ Control with Passivity-Constrained Feedback: Convex Approach
by: Scruggs, J. T.
Published: (2025)