Fetching the paper…
Reading the bibliography…
Various alignment problems arising in cryo-electron microscopy, community detection, time synchronization, computer vision, and other fields fall into a common framework of synchronization problems over compact groups such as Z/L, U(1), or SO(3).
Solution of ‘Solvable model of a spin glass’
David J Thouless, Philip W Anderson, and Robert G Palmer · 1977
Earlier work this paper cites.
SK model: The replica solution without replicas
Marc Mézard, Giorgio Parisi, and MA Virasoro · 1986
Earlier work this paper cites.
Fusion, propagation, and structuring in belief networks
Judea Pearl · 1986
Earlier work this paper cites.
Common factors affecting bond returns
Robert B Litterman and Jose Scheinkman · 1991
Earlier work this paper cites.
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
Michel X Goemans and David P Williamson · 1995
Earlier work this paper cites.
Bayesian PCA
Christopher M Bishop · 1999
Earlier work this paper cites.
Spectral partitioning of random graphs
Frank McSherry · 2001
Earlier work this paper cites.
Reconstruction of optical surfaces from ray data
J Rubinstein and G Wolansky · 2001
Earlier work this paper cites.
What is the range of surface reconstructions from a gradient field?
Amit Agrawal, Ramesh Raskar, and Rama Chellappa · 2006
Earlier work this paper cites.
Distributed clock synchronization over wireless networks: Algorithms and analysis
Arvind Giridhar and PR Kumar · 2006
Earlier work this paper cites.
The largest eigenvalue of rank one deformation of large Wigner matrices
Delphine Féral and Sandrine Péché · 2007
Earlier work this paper cites.
High-dimensional analysis of semidefinite relaxations for sparse principal components
Arash A Amini and Martin J Wainwright · 2008
Earlier work this paper cites.
Message-passing algorithms for compressed sensing
David L Donoho, Arian Maleki, and Andrea Montanari · 2009
Earlier work this paper cites.
Information, physics, and computation
Marc Mezard and Andrea Montanari · 2009
Earlier work this paper cites.
Reference free structure determination through eigenvectors of center of mass operators
Ronald R Coifman, Yoel Shkolnisky, Fred J Sigworth, and Amit Singer · 2010
Earlier work this paper cites.
Message passing algorithms for compressed sensing: I. motivation and construction
David L Donoho, Arian Maleki, and Andrea Montanari · 2010
Earlier work this paper cites.
The term structure of variance swap rates and optimal variance swap investments
Daniel Egloff, Markus Leippold, and Liuren Wu · 2010
Earlier work this paper cites.
The eigenvalues and eigenvectors of finite, low rank perturbations of large random matrices
Florent Benaych-Georges and Raj Rao Nadakuditi · 2011
Earlier work this paper cites.
The dynamics of message passing on dense graphs, with applications to compressed sensing
Mohsen Bayati and Andrea Montanari · 2011
Cited alongside, same era.
Angular synchronization by eigenvectors and semidefinite programming
Amit Singer · 2011
Cited alongside, same era.
Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
Amit Singer and Yoel Shkolnisky · 2011
Cited alongside, same era.
Sensor network localization by eigenvector synchronization over the euclidean group
Mihai Cucuringu, Yaron Lipman, and Amit Singer · 2012
Cited alongside, same era.
Iterative estimation of constrained rank-one matrices in noise
Sundeep Rangan and Alyson K Fletcher · 2012
Cited alongside, same era.
Complexity theoretic lower bounds for sparse principal component detection
Non-unique games over compact groups and orientation estimation in cryo-EM
Afonso S. Bandeira, Yutong Chen, and Amit Singer · 2015
Later among the works it cites.
Finding hidden cliques of size N / e \sqrt{N/e} in nearly linear time
Yash Deshpande and Andrea Montanari · 2015
Later among the works it cites.
Mmse of probabilistic low-rank matrix estimation: Universality with respect to the output channel
Thibault Lesieur, Florent Krzakala, and Lenka Zdeborov · 2015
Later among the works it cites.
Phase transitions in sparse PCA
Thibault Lesieur, Florent Krzakala, and Lenka Zdeborová · 2015
Later among the works it cites.
Computational barriers in minimax submatrix detection
Zongming Ma and Yihong Wu · 2015
Later among the works it cites.
Exact recovery in the stochastic block model
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quentin Berthet and Philippe Rigollet · 2013
Cited alongside, same era.
Optimal detection of sparse principal components in high dimension
Quentin Berthet and Philippe Rigollet · 2013
Cited alongside, same era.
Representations of compact Lie groups
Theodor Bröcker and Tammo tom Dieck · 2013
Cited alongside, same era.
Is high-tech view of HIV too good to be true?
Jon Cohen · 2013
Cited alongside, same era.
State evolution for general approximate message passing algorithms, with applications to spatial coupling
Adel Javanmard and Andrea Montanari · 2013
Cited alongside, same era.
Asymptotic analysis of complex LASSO via complex approximate message passing (CAMP)
Arian Maleki, Laura Anitori, Zai Yang, and Richard G Baraniuk · 2013
Cited alongside, same era.
Decoding binary node labels from censored edge measurements: Phase transition and efficient recovery
Emmanuel Abbe, Afonso S Bandeira, Annina Bracher, and Amit Singer · 2014
Cited alongside, same era.
Emmanuel Abbe, Afonso S Bandeira, and Georgina Hall · 2016
Closest in time.
Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula
Jean Barbier, Mohamad Dia, Nicolas Macris, Florent Krzakala, Thibault Lesieur, and Lenka Zdeborova · 2016
Closest in time.
Nonconvex phase synchronization
Nicolas Boumal · 2016
Closest in time.
The projected power method: An efficient algorithm for joint alignment from pairwise differences
Yuxin Chen and Emmanuel Candès · 2016
Closest in time.
Asymptotic mutual information for the binary stochastic block model
Yash Deshpande, Emmanuel Abbe, and Andrea Montanari · 2016
Closest in time.
Achieving exact cluster recovery threshold via semidefinite programming
Bruce Hajek, Yihong Wu, and Jiaming Xu · 2016
Closest in time.
Phase transitions in semidefinite relaxations
Adel Javanmard, Andrea Montanari, and Federico Ricci-Tersenghi · 2016
Closest in time.
Mutual information in rank-one matrix estimation
Florent Krzakala, Jiaming Xu, and Lenka Zdeborová · 2016
Closest in time.
Non-negative principal component analysis: Message passing algorithms and sharp asymptotics
Andrea Montanari and Emile Richard · 2016
Closest in time.
Semidefinite programs on sparse random graphs and their application to community detection
Andrea Montanari and Subhabrata Sen · 2016
Closest in time.
Optimality and sub-optimality of PCA for spiked random matrices and synchronization
Amelia Perry, Alexander S Wein, Afonso S Bandeira, and Ankur Moitra · 2016
Closest in time.
Finite sample analysis of approximate message passing
Cynthia Rush and Ramji Venkataramanan · 2016
Closest in time.