arXiv:2609. 13646v1 Announce Type: new Abstract: This work addresses decentralized online Riemannian optimization on Hadamard manifolds.
By Zhanyuan Cai, Emre Sahinoglu, Shahin Shahrampour
arXiv:2607. 20316v1 Announce Type: cross Abstract: We study decentralized online optimization for strongly geodesically convex (strongly g-convex) losses on Riemannian manifolds with bounded sectional curvature, including positively curved manifolds.
By Zhanyuan Cai, Emre Sahinoglu, Shahin Shahrampour
arXiv:2601.13519v4 Announce Type: replace-cross
Abstract: This paper introduces a new problem-dependent regret measure for online convex optimization with smooth losses. The notion, which we call the...
By Wenzhi Gao, Chang He, Madeleine Udell
The paper presents an improved analysis of non‑consecutive gradient variation in Bandit Convex Optimization (BCO) with two‑point feedback, leading to better dimension dependence for both convex and strongly convex functions compared to prior work. It also derives new problem‑dependent guarantees such as gradient‑variance and small‑loss regret bounds, extends the technique to one‑point bandit linear optimization over hyper‑rectangular domains, and establishes the first gradient‑variation dynamic and universal regret bounds for two‑point BCO.
By Hang Yu, Yu-Hu Yan, Peng Zhao
arXiv:2608. 15050v1 Announce Type: new Abstract: We study online convex optimization with dueling (pairwise comparison) feedback, where the learner observes only a binary preference between two queried points.
By Yiyang Lu, Hareshkumar Jadav, Mohammad Pedramfar, Ranveer Singh, Vaneet Aggarwal
arXiv:2606. 02948v1 Announce Type: new Abstract: Curvature adaptivity is a classical theme in online optimization: for convex Lipschitz losses, adaptive methods interpolate between the optimal $O(\sqrt{T})$ regret for general convex losses and $O(\log T)$ regret under strong convexity.
By Moses Charikar, Chirag Pabbaraju, Ambuj Tewari