Cover Image

Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wan, Yuanyu, Yao, Chang, Ma, Yitao, Song, Mingli, Zhang, Lijun
Format:	Preprint
Published:	2023
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improved Regret for Bandit Convex Optimization with Delayed Feedback
by: Wan, Yuanyu, et al.
Published: (2024)

Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
by: Yang, Sifan, et al.
Published: (2025)

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
by: Wan, Yuanyu, et al.
Published: (2024)

Projection-free Online Learning over Strongly Convex Sets
by: Wan, Yuanyu, et al.
Published: (2020)

Improved Dynamic Regret for Online Frank-Wolfe
by: Wan, Yuanyu, et al.
Published: (2023)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
by: Bao, Lingchan, et al.
Published: (2025)

Mixture of Online and Offline Experts for Non-stationary Time Series
by: Zhao, Zhilin, et al.
Published: (2022)

Revisiting Projection-Free Online Learning with Time-Varying Constraints
by: Wang, Yibo, et al.
Published: (2025)

Non-stationary Bandit Convex Optimization: A Comprehensive Study
by: Liu, Xiaoqi, et al.
Published: (2025)

Approximate Multiplication of Sparse Matrices with Limited Space
by: Wan, Yuanyu, et al.
Published: (2020)

Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions
by: Wan, Yuanyu, et al.
Published: (2026)

Efficient Methods for Non-stationary Online Learning
by: Zhao, Peng, et al.
Published: (2023)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2021)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
by: Qiu, Hao, et al.
Published: (2025)

Decentralized Online Convex Optimization with Unknown Feedback Delays
by: Qiu, Hao, et al.
Published: (2026)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
by: Yang, Wenhao, et al.
Published: (2025)

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
by: Xue, Bo, et al.
Published: (2025)

Continuous Subspace Optimization for Continual Learning
by: Cheng, Quan, et al.
Published: (2025)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
by: Chen, Sijia, et al.
Published: (2023)

Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise
by: Yu, Dingzhi, et al.
Published: (2026)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
by: Yang, Sifan, et al.
Published: (2026)

Universal Online Convex Optimization with $1$ Projection per Round
by: Yang, Wenhao, et al.
Published: (2024)

Bandit and Delayed Feedback in Online Structured Prediction
by: Shibukawa, Yuki, et al.
Published: (2025)

Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)

Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
by: Jiang, Wei, et al.
Published: (2024)

Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
by: Ye, Haishan
Published: (2026)

Online Newton Method for Bandit Convex Optimisation
by: Fokkema, Hidde, et al.
Published: (2024)

Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs
by: Wang, Jing, et al.
Published: (2026)

Incentivized Exploration of Non-Stationary Stochastic Bandits
by: Chakraborty, Sourav, et al.
Published: (2024)

Biased Dueling Bandits with Stochastic Delayed Feedback
by: Yi, Bongsoo, et al.
Published: (2024)

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
by: Tsuchiya, Taira, et al.
Published: (2024)

Variance-Dependent Regret Bounds for Non-stationary Linear Bandits
by: Wang, Zhiyong, et al.
Published: (2024)

Bandit Convex Optimization with Gradient Prediction Adaptivity
by: Wang, Shuche, et al.
Published: (2026)

Efficient Online Set-valued Classification with Bandit Feedback
by: Wang, Zhou, et al.
Published: (2024)

Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)

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

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
by: Hihat, Massil, et al.
Published: (2023)

Impatient Bandits: Optimizing for the Long-Term Without Delay
by: Zhang, Kelly W., et al.
Published: (2025)

Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations
by: Yu, Hang, et al.
Published: (2026)