12 citations · 14 across the 2 of their papers we have counts for
2 papers
math.OC2017★ 2 cited
Accelerated Consensus via Min-Sum Splitting
Patrick Rebeschini, Sekhar Tatikonda
We apply the Min-Sum message-passing protocol to solve the consensus problem in distributed optimization. We show that while the ordinary Min-Sum algorithm does not converge, a mod…
stat.ML2015★ 12 cited
Fast Mixing for Discrete Point Processes
Patrick Rebeschini, Amin Karbasi
We investigate the systematic mechanism for designing fast mixing Markov chain Monte Carlo algorithms to sample from discrete point processes under the Dobrushin uniqueness conditi…