Efficient ℤ_2 synchronization on ℤ^d under symmetry-preserving side information

06/03/2021
by   Ahmed El Alaoui, et al.
0

We consider ℤ_2-synchronization on the Euclidean lattice. Every vertex of ℤ^d is assigned an independent symmetric random sign θ_u, and for every edge (u,v) of the lattice, one observes the product θ_uθ_v flipped independently with probability p. The task is to reconstruct products θ_uθ_v for pairs of vertices u and v which are arbitrarily far apart. Abbé, Massoulié, Montanari, Sly and Srivastava (2018) showed that synchronization is possible if and only if p is below a critical threshold p̃_c(d), and efficiently so for p small enough. We augment this synchronization setting with a model of side information preserving the sign symmetry of θ, and propose an efficient algorithm which synchronizes a randomly chosen pair of far away vertices on average, up to a differently defined critical threshold p_c(d). We conjecture that p_c(d)=p̃_c(d) for all d ≥ 2. Our strategy is to renormalize the synchronization model in order to reduce the effective noise parameter, and then apply a variant of the multiscale algorithm of AMMSS. The success of the renormalization procedure is conditional on a plausible but unproved assumption about the regularity of the free energy of an Ising spin glass model on ℤ^d.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

03/30/2021

The Matter of Time – A General and Efficient System for Precise Sensor Synchronization in Robotic Computing

Time synchronization is a critical task in robotic computing such as aut...
04/17/2012

Energy cost reduction in the synchronization of a pair of nonidentical coupled Hindmarsh-Rose neurons

Many biological processes involve synchronization between nonequivalent ...
11/07/2018

Broadcasting on Random Directed Acyclic Graphs

We study a generalization of the well-known model of broadcasting on tre...
06/08/2020

Near-Perfect Recovery in the One-Dimensional Latent Space Model

Suppose a graph G is stochastically created by uniformly sampling vertic...
07/27/2020

Message Passing Least Squares Framework and its Application to Rotation Synchronization

We propose an efficient algorithm for solving group synchronization unde...
06/08/2018

An Information-Percolation Bound for Spin Synchronization on General Graphs

This paper considers the problem of reconstructing n independent uniform...
07/03/2019

The Combinatorics of Barrier Synchronization

In this paper we study the notion of synchronization from the point of v...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.