Distributed stochastic optimization via matrix exponential learning
Panayotis Mertikopoulos, E. Veronica Belmega, Romain Negrel and, Luca Sanguinetti

TL;DR
This paper introduces a distributed stochastic optimization algorithm based on matrix exponential learning for wireless communication systems, demonstrating robust convergence and significant energy efficiency gains under uncertainty.
Contribution
It proposes a novel MXL-based distributed learning algorithm with proven convergence properties and explicit speed bounds, applicable to stochastic games in signal processing.
Findings
Algorithm converges globally to stable Nash equilibria.
Achieves 100-500% increase in energy efficiency in wireless scenarios.
Effective under high measurement errors and uncertainties.
Abstract
In this paper, we investigate a distributed learning scheme for a broad class of stochastic optimization problems and games that arise in signal processing and wireless communications. The proposed algorithm relies on the method of matrix exponential learning (MXL) and only requires locally computable gradient observations that are possibly imperfect and/or obsolete. To analyze it, we introduce the notion of a stable Nash equilibrium and we show that the algorithm is globally convergent to such equilibria - or locally convergent when an equilibrium is only locally stable. We also derive an explicit linear bound for the algorithm's convergence speed, which remains valid under measurement errors and uncertainty of arbitrarily high variance. To validate our theoretical analysis, we test the algorithm in realistic multi-carrier/multiple-antenna wireless scenarios where several users seek to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
