Image de couverture de livre

Optimal and Efficient Algorithms for Decentralized Online Convex Optimization

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Wan, Yuanyu, Wei, Tong, Xue, Bo, Song, Mingli, Zhang, Lijun
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

Improved Regret for Bandit Convex Optimization with Delayed Feedback
par: Wan, Yuanyu, et autres
Publié: (2024)

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

Improved Dynamic Regret for Online Frank-Wolfe
par: Wan, Yuanyu, et autres
Publié: (2023)

Improved Approximate Regret for Decentralized Online Continuous Submodular Maximization via Reductions
par: Wan, Yuanyu, et autres
Publié: (2026)

Projection-free Online Learning over Strongly Convex Sets
par: Wan, Yuanyu, et autres
Publié: (2020)

Revisiting Multi-Agent Asynchronous Online Optimization with Delays: the Strongly Convex Case
par: Bao, Lingchan, et autres
Publié: (2025)

Online Nonsubmodular Optimization with Delayed Feedback in the Bandit Setting
par: Yang, Sifan, et autres
Publié: (2025)

Distributed Online Convex Optimization with Efficient Communication: Improved Algorithm and Lower bounds
par: Yang, Sifan, et autres
Publié: (2026)

Revisiting Projection-Free Online Learning with Time-Varying Constraints
par: Wang, Yibo, et autres
Publié: (2025)

Approximate Multiplication of Sparse Matrices with Limited Space
par: Wan, Yuanyu, et autres
Publié: (2020)

Distributed Online Convex Optimization with Compressed Communication: Optimal Regret and Applications
par: Yang, Sifan, et autres
Publié: (2026)

Optimal Decentralized Smoothed Online Convex Optimization
par: Bhuyan, Neelkamal, et autres
Publié: (2024)

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

Optimal Anytime Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

Optimal Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sinha, Abhishek, et autres
Publié: (2023)

Decentralized Online Convex Optimization with Unknown Feedback Delays
par: Qiu, Hao, et autres
Publié: (2026)

Discounted Online Convex Optimization: Uniform Regret Across a Continuous Interval
par: Yang, Wenhao, et autres
Publié: (2025)

Projection-Free Variance Reduction Methods for Stochastic Constrained Multi-Level Compositional Optimization
par: Jiang, Wei, et autres
Publié: (2024)

Continuous Subspace Optimization for Continual Learning
par: Cheng, Quan, et autres
Publié: (2025)

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits
par: Xue, Bo, et autres
Publié: (2025)

Mixture of Online and Offline Experts for Non-stationary Time Series
par: Zhao, Zhilin, et autres
Publié: (2022)

Learning-Augmented Decentralized Online Convex Optimization in Networks
par: Li, Pengfei, et autres
Publié: (2023)

Sign-Based Optimizers Are Effective Under Heavy-Tailed Noise
par: Yu, Dingzhi, et autres
Publié: (2026)

Universal Online Convex Optimization with $1$ Projection per Round
par: Yang, Wenhao, et autres
Publié: (2024)

Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization
par: Zhao, Peng, et autres
Publié: (2021)

Universal Online Convex Optimization Meets Second-order Bounds
par: Zhang, Lijun, et autres
Publié: (2021)

Efficient Algorithms for Empirical Group Distributionally Robust Optimization and Beyond
par: Yu, Dingzhi, et autres
Publié: (2024)

Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks
par: Kovalev, Dmitry, et autres
Publié: (2024)

Projection-free Algorithms for Online Convex Optimization with Adversarial Constraints
par: Sarkar, Dhruv, et autres
Publié: (2025)

Decentralized Multi-Task Online Convex Optimization Under Random Link Failures
par: Yan, Wenjing, et autres
Publié: (2024)

Dual Adaptivity: Universal Algorithms for Minimizing the Adaptive Regret of Convex Functions
par: Zhang, Lijun, et autres
Publié: (2025)

Optimal Guarantees for Algorithmic Reproducibility and Gradient Complexity in Convex Optimization
par: Zhang, Liang, et autres
Publié: (2023)

An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints
par: Lekeufack, Jordan, et autres
Publié: (2024)

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

Topology-aware Generalization of Decentralized SGD
par: Zhu, Tongtian, et autres
Publié: (2022)

SpatiaLQA: A Benchmark for Evaluating Spatial Logical Reasoning in Vision-Language Models
par: Xie, Yuechen, et autres
Publié: (2026)

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

A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization
par: Wang, Yi-Han, et autres
Publié: (2025)

Optimal Bounds for Adversarial Constrained Online Convex Optimization
par: Ferreira, Ricardo N., et autres
Publié: (2025)

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