activity
20062022
most citedGossip Algorithms for Distributed Signal Processing

740 citations · 2.2k across the 43 of their papers we have counts for

collaborators
Showing 2014Show all

6 papers · 1 filter

cs.SI2014

Measuring the Generalized Friendship Paradox in Networks with Quality-dependent Connectivity

Naghmeh Momeni, Michael G. Rabbat

The friendship paradox is a sociological phenomenon stating that most people have fewer friends than their friends do. The generalized friendship paradox refers to the same observa…

physics.soc-ph2014

Generalized Friendship Paradox: An Analytical Approach

Babak Fotouhi, Naghmeh Momeni, Michael G. Rabbat

The friendship paradox refers to the sociological observation that, while the people's assessment of their own popularity is typically self-aggrandizing, in reality they are less p…

cs.NE2014

Combating Corrupt Messages in Sparse Clustered Associative Memories

Zhe Yao, Vincent Gripon, Michael Rabbat

In this paper we analyze and extend the neural network based associative memory proposed by Gripon and Berrou. This associative memory resembles the celebrated Willshaw model with…

math.OC2014★ 7 cited

On the Convergence of Alternating Direction Lagrangian Methods for Nonconvex Structured Optimization Problems

Sindri Magnússon, Pradeep Chathuranga Weeraddana, Michael G. Rabbat +1

Nonconvex and structured optimization problems arise in many engineering applications that demand scalable and distributed solution methods. The study of the convergence properties…

cs.NE2014

Storing sequences in binary tournament-based neural networks

Xiaoran Jiang, Vincent Gripon, Claude Berrou +1

An extension to a recently introduced architecture of clique-based neural networks is presented. This extension makes it possible to store sequences with high efficiency. To obtain…

cs.IT2014

Efficient Distributed Online Prediction and Stochastic Optimization with Approximate Distributed Averaging

Konstantinos I. Tsianos, Michael G. Rabbat

We study distributed methods for online prediction and stochastic optimization. Our approach is iterative: in each round nodes first perform local computations and then communicate…