Efficient $\mathbb{Z}_2$ synchronization on $\mathbb{Z}^d$ under symmetry-preserving side information
Ahmed El Alaoui

TL;DR
This paper introduces an efficient algorithm for $bZ_2$-synchronization on $bZ^d$ with symmetry-preserving side information, achieving near-optimal reconstruction of distant vertex pairs under certain noise conditions.
Contribution
It proposes a novel renormalization approach combined with a multiscale algorithm to improve synchronization performance with side information.
Findings
Synchronization is possible below a critical noise threshold.
The proposed method achieves efficient synchronization up to a new threshold.
Conditional on a conjecture about the Ising spin glass free energy.
Abstract
We consider -synchronization on the Euclidean lattice. Every vertex of is assigned an independent symmetric random sign , and for every edge of the lattice, one observes the product flipped independently with probability . The task is to reconstruct products for pairs of vertices and which are arbitrarily far apart. Abb\'e, Massouli\'e, Montanari, Sly and Srivastava (2018) showed that synchronization is possible if and only if is below a critical threshold , and efficiently so for small enough. We augment this synchronization setting with a model of side information preserving the sign symmetry of , and propose an \emph{efficient} algorithm which synchronizes a randomly chosen pair of far away vertices on average, up to a differently defined critical threshold…
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
TopicsTheoretical and Computational Physics · Markov Chains and Monte Carlo Methods · Stochastic processes and statistical mechanics
