Exploiting Curvature in Online Convex Optimization with Delayed Feedback
Fuente:
arXiv
Saved in:
| Main Authors: | Qiu, Hao, Esposito, Emmanuel, Zhang, Mengxiao |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Decentralized Online Convex Optimization with Unknown Feedback Delays
by: Qiu, Hao, et al.
Published: (2026)
by: Qiu, Hao, et al.
Published: (2026)
Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
by: Qiu, Hao, et al.
Published: (2026)
by: Qiu, Hao, et al.
Published: (2026)
Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025)
by: Hait, Soumita, et al.
Published: (2025)
Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
by: Tsuchiya, Taira, et al.
Published: (2024)
by: Tsuchiya, Taira, et al.
Published: (2024)
Improved Regret for Bandit Convex Optimization with Delayed Feedback
by: Wan, Yuanyu, et al.
Published: (2024)
by: Wan, Yuanyu, et al.
Published: (2024)
Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
by: Yang, Sifan, et al.
Published: (2025)
by: Yang, Sifan, et al.
Published: (2025)
Safe Online Convex Optimization with Multi-Point Feedback
by: Hutchinson, Spencer, et al.
Published: (2024)
by: Hutchinson, Spencer, et al.
Published: (2024)
Contextual Linear Bandits with Delay as Payoff
by: Zhang, Mengxiao, et al.
Published: (2025)
by: Zhang, Mengxiao, et al.
Published: (2025)
Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
by: Wan, Yuanyu, et al.
Published: (2023)
by: Wan, Yuanyu, et al.
Published: (2023)
Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)
by: Qiu, Hao, et al.
Published: (2026)
Learning on the Edge: Online Learning with Stochastic Feedback Graphs
by: Esposito, Emmanuel, et al.
Published: (2022)
by: Esposito, Emmanuel, et al.
Published: (2022)
Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
by: Sahinoglu, Emre, et al.
Published: (2025)
by: Sahinoglu, Emre, et al.
Published: (2025)
Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
by: Bao, Lingchan, et al.
Published: (2025)
by: Bao, Lingchan, et al.
Published: (2025)
Bandit and Delayed Feedback in Online Structured Prediction
by: Shibukawa, Yuki, et al.
Published: (2025)
by: Shibukawa, Yuki, et al.
Published: (2025)
Efficient Contextual Bandits with Uninformed Feedback Graphs
by: Zhang, Mengxiao, et al.
Published: (2024)
by: Zhang, Mengxiao, et al.
Published: (2024)
Optimal High-Probability Regret for Online Convex Optimization with Two-Point Bandit Feedback
by: Ye, Haishan
Published: (2026)
by: Ye, Haishan
Published: (2026)
Follow the TRACE: Exploiting Post-Click Trajectories for Online Delayed Conversion Rate Prediction
by: Zhang, Xinyue, et al.
Published: (2026)
by: Zhang, Xinyue, et al.
Published: (2026)
Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback
by: Liu, Shanqi, et al.
Published: (2024)
by: Liu, Shanqi, et al.
Published: (2024)
Interaction-Grounded Learning for Contextual Markov Decision Processes with Personalized Feedback
by: Zhang, Mengxiao, et al.
Published: (2026)
by: Zhang, Mengxiao, et al.
Published: (2026)
Unconstrained Robust Online Convex Optimization
by: Zhang, Jiujia, et al.
Published: (2025)
by: Zhang, Jiujia, et al.
Published: (2025)
A Reduction from Delayed to Immediate Feedback for Online Convex Optimization with Improved Guarantees
by: Ryabchenko, Alexander, et al.
Published: (2026)
by: Ryabchenko, Alexander, et al.
Published: (2026)
Handling Delayed Feedback in Distributed Online Optimization : A Projection-Free Approach
by: Nguyen, Tuan-Anh, et al.
Published: (2024)
by: Nguyen, Tuan-Anh, et al.
Published: (2024)
Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
by: Chen, Sijia, et al.
Published: (2023)
by: Chen, Sijia, et al.
Published: (2023)
Optimal and Efficient Algorithms for Decentralized Online Convex Optimization
by: Wan, Yuanyu, et al.
Published: (2024)
by: Wan, Yuanyu, et al.
Published: (2024)
Near-Optimal Last-Iterate Convergence for Zero-Sum Games with Bandit Feedback and Opponent Actions
by: Hait, Soumita, et al.
Published: (2026)
by: Hait, Soumita, et al.
Published: (2026)
Constrained Online Convex Optimization with Memory and Predictions
by: Abdullah, Mohammed, et al.
Published: (2026)
by: Abdullah, Mohammed, et al.
Published: (2026)
Online Convex Optimization with Unbounded Memory
by: Kumar, Raunak, et al.
Published: (2022)
by: Kumar, Raunak, et al.
Published: (2022)
Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
by: Yang, Sifan, et al.
Published: (2026)
by: Yang, Sifan, et al.
Published: (2026)
Distributed Online Optimization with Stochastic Agent Availability
by: Achddou, Juliette, et al.
Published: (2024)
by: Achddou, Juliette, et al.
Published: (2024)
Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
by: Zhao, Peng, et al.
Published: (2021)
by: Zhao, Peng, et al.
Published: (2021)
Modeling Cascaded Delay Feedback for Online Net Conversion Rate Prediction: Benchmark, Insights and Solutions
by: Luo, Mingxuan, et al.
Published: (2026)
by: Luo, Mingxuan, et al.
Published: (2026)
Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
by: Yang, Wenhao, et al.
Published: (2025)
by: Yang, Wenhao, et al.
Published: (2025)
Online Convex Optimization with Memory and Limited Predictions
by: Wang, Zhengmiao, et al.
Published: (2024)
by: Wang, Zhengmiao, et al.
Published: (2024)
Online Convex Optimization with a Separation Oracle
by: Mhammedi, Zakaria
Published: (2024)
by: Mhammedi, Zakaria
Published: (2024)
Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
by: Yang, Sifan, et al.
Published: (2026)
by: Yang, Sifan, et al.
Published: (2026)
Universal Online Convex Optimization with $1$ Projection per Round
by: Yang, Wenhao, et al.
Published: (2024)
by: Yang, Wenhao, et al.
Published: (2024)
Multi-Objective $\textit{min-max}$ Online Convex Optimization
by: Vaze, Rahul, et al.
Published: (2025)
by: Vaze, Rahul, et al.
Published: (2025)
Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)
by: Sarkar, Dhruv, et al.
Published: (2025)
Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
by: Sarkar, Dhruv, et al.
Published: (2025)
by: Sarkar, Dhruv, et al.
Published: (2025)
Universal Online Convex Optimization Meets Second-order Bounds
by: Zhang, Lijun, et al.
Published: (2021)
by: Zhang, Lijun, et al.
Published: (2021)
Similar Items
-
Decentralized Online Convex Optimization with Unknown Feedback Delays
by: Qiu, Hao, et al.
Published: (2026) -
Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory
by: Qiu, Hao, et al.
Published: (2026) -
Alternating Regret for Online Convex Optimization
by: Hait, Soumita, et al.
Published: (2025) -
Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets
by: Tsuchiya, Taira, et al.
Published: (2024) -
Improved Regret for Bandit Convex Optimization with Delayed Feedback
by: Wan, Yuanyu, et al.
Published: (2024)