Image de couverture de livre

Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Tsuchiya, Taira, Ito, Shinji
Format:	Preprint
Publié:	2024
Sujets:	Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $Θ(T^{2/3})$ and its Application to Best-of-Both-Worlds
par: Tsuchiya, Taira, et autres
Publié: (2024)

Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds
par: Ito, Shinji, et autres
Publié: (2024)

Scale-Invariant Fast Convergence in Games
par: Tsuchiya, Taira, et autres
Publié: (2026)

Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring
par: Tsuchiya, Taira, et autres
Publié: (2024)

Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds
par: Tsuchiya, Taira, et autres
Publié: (2023)

Reinforcement Learning from Adversarial Preferences in Tabular MDPs
par: Tsuchiya, Taira, et autres
Publié: (2025)

Exploiting Curvature in Online Convex Optimization with Delayed Feedback
par: Qiu, Hao, et autres
Publié: (2025)

Adapting to Stochastic and Adversarial Losses in Episodic MDPs with Aggregate Bandit Feedback
par: Ito, Shinji, et autres
Publié: (2025)

Online Control of Linear Systems under Unbounded Noise
par: Ito, Kaito, et autres
Publié: (2024)

Corrupted Learning Dynamics in Games
par: Tsuchiya, Taira, et autres
Publié: (2024)

Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis
par: Sakaue, Shinsaku, et autres
Publié: (2025)

Online $\mathrm{L}^{\natural}$-Convex Minimization
par: Yokoyama, Ken, et autres
Publié: (2024)

Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
par: Sachs, Sarah, et autres
Publié: (2023)

Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound
par: Sakaue, Shinsaku, et autres
Publié: (2025)

Data- and Variance-dependent Regret Bounds for Online Tabular MDPs
par: Li, Mingyi, et autres
Publié: (2026)

Tight Regret Upper and Lower Bounds for Optimistic Hedge in Two-Player Zero-Sum Games
par: Tsuchiya, Taira
Publié: (2025)

Online Structured Prediction with Fenchel--Young Losses and Improved Surrogate Regret for Online Multiclass Classification with Logistic Loss
par: Sakaue, Shinsaku, et autres
Publié: (2024)

Constrained Online Convex Optimization with Polyak Feasibility Steps
par: Hutchinson, Spencer, et autres
Publié: (2025)

Convex Optimization with Nested Evolving Feasible Sets
par: M., Karthick Krishna, et autres
Publié: (2026)

Bandit and Delayed Feedback in Online Structured Prediction
par: Shibukawa, Yuki, et autres
Publié: (2025)

Instance-Dependent Regret Bounds for Learning Two-Player Zero-Sum Games with Bandit Feedback
par: Ito, Shinji, et autres
Publié: (2025)

Optimal Rates for Robust Stochastic Convex Optimization
par: Gao, Changyu, et autres
Publié: (2024)

Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization
par: Chen, Sijia, et autres
Publié: (2023)

Online Non-Stationary Stochastic Quasar-Convex Optimization
par: Pun, Yuen-Man, et autres
Publié: (2024)

Fast EXP3 Algorithms
par: Sato, Ryoma, et autres
Publié: (2025)

Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
par: Sahinoglu, Emre, et autres
Publié: (2025)

Adversarial Learning in Games with Bandit Feedback: Logarithmic Pure-Strategy Maximin Regret
par: Ito, Shinji, et autres
Publié: (2026)

Online Inventory Problems: Beyond the i.i.d. Setting with Online Convex Optimization
par: Hihat, Massil, et autres
Publié: (2023)

Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting
par: Wan, Yuanyu, et autres
Publié: (2023)

Contaminated Online Convex Optimization
par: Kamijima, Tomoya, et autres
Publié: (2024)

Alternating Regret for Online Convex Optimization
par: Hait, Soumita, et autres
Publié: (2025)

Optimal Rates for Pure $\varepsilon$-Differentially Private Stochastic Convex Optimization with Heavy Tails
par: Lowy, Andrew
Publié: (2026)

On Traceability in $\ell_p$ Stochastic Convex Optimization
par: Voitovych, Sasha, et autres
Publié: (2025)

Enhancing Parallelism in Decentralized Stochastic Convex Optimization
par: Eisen, Ofri, et autres
Publié: (2025)

The Price of Adaptivity in Stochastic Convex Optimization
par: Carmon, Yair, et autres
Publié: (2024)

Stochastic Difference-of-Convex Optimization with Momentum
par: Chayti, El Mahdi, et autres
Publié: (2025)

Constrained Online Convex Optimization with Memory and Predictions
par: Abdullah, Mohammed, et autres
Publié: (2026)

LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits
par: Kato, Masahiro, et autres
Publié: (2024)

Online Convex Optimization with Unbounded Memory
par: Kumar, Raunak, et autres
Publié: (2022)

Unconstrained Robust Online Convex Optimization
par: Zhang, Jiujia, et autres
Publié: (2025)