In this paper, we study federated optimization for solving stochastic variational inequalities (VIs), a problem that has attracted growing attention in recent years. Despite substantial progress, a significant gap remains between existing convergence rates and the state-of-the-art bounds known for federated convex optimization. In this work, we address this limitation by establishing a series of improved convergence rates. First, we show that, for general smooth and monotone variational inequalities, the classical Local Extra SGD algorithm admits tighter guarantees under a refined analysis… Read More
Faster Rates For Federated Variational Inequalities
In this paper, we study federated optimization for solving stochastic variational inequalities (VIs), a problem that has attracted growing attention in recent years. Despite substantial progress, a significant gap remains between existing convergence rates and the state-of-the-art bounds known for federated convex optimization. In this work, we address this limitation by establishing a series of improved convergence rates. First, we show that, for general smooth and monotone variational inequalities, the classical Local Extra SGD algorithm admits tighter guarantees under a refined analysis…
Related Posts
1,001 real-world gen AI use cases from the world’s leading organizations
A snapshot of how top companies, governments, researchers and startups are enhancing their work with…
From Habits to Tools
This article is part of a series on the Sens-AI Framework—practical habits for learning and…
The AI Teaching Toolkit: Practical Guidance for Teams
Teaching developers to work effectively with AI means building habits that keep critical thinking active…