The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences
From MaRDI portal
Publication:4581298
DOI10.1002/cpa.21760zbMath1480.90199arXiv1609.05820OpenAlexW2963829083WikidataQ129471153 ScholiaQ129471153MaRDI QIDQ4581298
Yuxin Chen, Emmanuel J. Candès
Publication date: 16 August 2018
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.05820
Related Items
Iterative algorithm for discrete structure recovery, Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods, Estimation of low-rank matrices via approximate message passing, Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method, Optimal rates of estimation for multi-reference alignment, Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis, Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution, Fundamental limits of weak recovery with applications to phase retrieval, A unified approach to synchronization problems over subgroups of the orthogonal group, Unnamed Item, Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval, A representation theory perspective on simultaneous alignment and classification, Near-optimal bounds for generalized orthogonal Procrustes problem via generalized power method, Power spectrum unbiasing for dilation-invariant multi-reference alignment, Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization, Median-Truncated Gradient Descent: A Robust and Scalable Nonconvex Approach for Signal Estimation, Near-Optimal Bounds for Phase Synchronization, Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees, Bridging convex and nonconvex optimization in robust PCA: noise, outliers and missing data, Spectral method and regularized MLE are both optimal for top-\(K\) ranking, $$L^p$$ Continuity and Microlocal Properties for Pseudodifferential Operators, On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization, A Kaczmarz algorithm for sequences of projections, infinite products, and applications to frames in IFS \(L^2\) spaces, Robust group synchronization via cycle-edge message passing
