7 citations · 16 across the 6 of their papers we have counts for
6 papers · 1 filter
Smooth Fictitious Play in Potential Games
Brian Swenson, H. Vincent Poor
The paper shows that smooth fictitious play converges to a neighborhood of a pure-strategy Nash equilibrium with probability 1 in almost all (-player, two-action) po…
On Distributed Stochastic Gradient Algorithms for Global Optimization
Brian Swenson, Anirudh Sridhar, H. Vincent Poor
The paper considers the problem of network-based computation of global minima in smooth nonconvex optimization problems. It is known that distributed gradient-descent-type algorith…
Distributed Gradient Descent: Nonconvergence to Saddle Points and the Stable-Manifold Theorem
Brian Swenson, Ryan Murray, H. Vincent Poor +1
The paper studies a distributed gradient descent (DGD) process and considers the problem of showing that in nonconvex optimization problems, DGD typically converges to local minima…
Distributed Global Optimization by Annealing
Brian Swenson, Soummya Kar, H. Vincent Poor +1
The paper considers a distributed algorithm for global minimization of a nonconvex function. The algorithm is a first-order consensus + innovations type algorithm that incorporates…
Annealing for Distributed Global Optimization
Brian Swenson, Soummya Kar, H. Vincent Poor +1
The paper proves convergence to global optima for a class of distributed algorithms for nonconvex optimization in network-based multi-agent settings. Agents are permitted to commun…
Clustering with Distributed Data
Soummya Kar, Brian Swenson
We consider -means clustering in networked environments (e.g., internet of things (IoT) and sensor networks) where data is inherently distributed across nodes and processing pow…