Convergence Analysis of Gradient-Based Learning with Non-Uniform Learning Rates in Non-Cooperative Multi-Agent Settings
Benjamin Chasnov, Lillian J. Ratliff, Eric Mazumdar, Samuel A. Burden

TL;DR
This paper analyzes the convergence of gradient-based multi-agent learning algorithms with non-uniform learning rates in non-cooperative games, providing finite-time guarantees and exploring how non-uniform rates affect convergence dynamics.
Contribution
It introduces a novel analysis of how non-uniform learning rates influence convergence and stability in multi-agent gradient learning, supported by finite-time guarantees and numerical illustrations.
Findings
Non-uniform learning rates act like preconditioning, affecting convergence speed.
Finite-time convergence guarantees are established for deterministic settings.
High-probability convergence to a neighborhood is shown in stochastic settings.
Abstract
Considering a class of gradient-based multi-agent learning algorithms in non-cooperative settings, we provide local convergence guarantees to a neighborhood of a stable local Nash equilibrium. In particular, we consider continuous games where agents learn in (i) deterministic settings with oracle access to their gradient and (ii) stochastic settings with an unbiased estimator of their gradient. Utilizing the minimum and maximum singular values of the game Jacobian, we provide finite-time convergence guarantees in the deterministic case. On the other hand, in the stochastic case, we provide concentration bounds guaranteeing that with high probability agents will converge to a neighborhood of a stable local Nash equilibrium in finite time. Different than other works in this vein, we also study the effects of non-uniform learning rates on the learning dynamics and convergence rates. We…
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.
Taxonomy
TopicsMathematical Biology Tumor Growth · Advanced Bandit Algorithms Research · Stochastic Gradient Optimization Techniques
