Fetching the paper…
Reading the bibliography…
Various applications involve assigning discrete label values to a collection of objects based on some pairwise noisy data.
A shortest augmenting path algorithm for dense and sparse linear assignment problems
R. Jonker and A. Volgenant · 1987
Earlier work this paper cites.
Concentration of measure and isoperimetric inequalities in product spaces
M. Talagrand · 1995
Earlier work this paper cites.
Upper and lower bounds for Csiszár’s f-divergence in terms of the Kullback-Leibler distance and applications
S. Dragomir · 2000
Earlier work this paper cites.
The expected norm of random matrices
Y. Seginer · 2000
Earlier work this paper cites.
Quadratic programming relaxations for metric labeling and Markov random field MAP estimation
P. Ravikumar and J. Lafferty · 2006
Earlier work this paper cites.
Shape retrieval contest 2007: Watertight models track
D. Giorgi, S. Biasotti, and L. Paraboschi · 2007
Earlier work this paper cites.
Efficient projections onto the ℓ 1 \ell_{1} -ball for learning in high dimensions
J. Duchi, S. Shalev-Shwartz, Y. Singer, and T. Chandra · 2008
Earlier work this paper cites.
Introduction to nonparametric estimation
A. B. Tsybakov · 2008
Earlier work this paper cites.
Bernstein inequality and moderate deviations under strong mixing conditions
F. Merlevède, M. Peligrad, E. Rio, et al · 2009
Earlier work this paper cites.
Graph partitioning via adaptive spectral techniques
A. Coja-Oghlan · 2010
Earlier work this paper cites.
Dense error correction for low-rank matrices via principal component pursuit
A. Ganesh, J. Wright, X. Li, E. Candes, and Y. Ma · 2010
Earlier work this paper cites.
An inverse power method for nonlinear eigenproblems with applications in 1-spectral clustering and sparse pca
M. Hein and T. Bühler · 2010
Earlier work this paper cites.
Robust water/fat separation in the presence of large field inhomogeneities using a graph cut algorithm
D. Hernando, P. Kellman, J. Haldar, and Z.-P. Liang · 2010
Earlier work this paper cites.
Generalized power method for sparse principal component analysis
M. Journée, Y. Nesterov, P. Richtárik, and R. Sepulchre · 2010
Earlier work this paper cites.
Matrix completion from a few entries
R. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Matrix completion from noisy entries
R. Keshavan, A. Montanari, and S. Oh · 2010
Earlier work this paper cites.
Two-point dixon method with flexible echo times
J. Berglund, H. Ahlström, L. Johansson, and J. Kullberg · 2011
Earlier work this paper cites.
Markov random fields for vision and image processing
A. Blake, P. Kohli, and C. Rother · 2011
Earlier work this paper cites.
Robust principal component analysis?
E. Candès, X. Li, Y. Ma, and J. Wright · 2011
Earlier work this paper cites.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky · 2011
Earlier work this paper cites.
Clustering partially observed graphs via convex optimization
A. Jalali, Y. Chen, S. Sanghavi, and H. Xu · 2011
Earlier work this paper cites.
Stochastic blockmodels and community structure in networks
B. Karrer and M. E. Newman · 2011
Earlier work this paper cites.
Finding dense clusters via" low rank+ sparse" decomposition
S. Oymak and B. Hassibi · 2011
Earlier work this paper cites.
Angular synchronization by eigenvectors and semidefinite programming
A. Singer · 2011
Earlier work this paper cites.
Spectral clustering of graphs with general degrees in the extended planted partition model
K. Chaudhuri, F. C. Graham, and A. Tsiatas · 2012
Earlier work this paper cites.
Clustering sparse graphs
Y. Chen, S. Sanghavi, and H. Xu · 2012
Earlier work this paper cites.
Matrix computations
G. H. Golub and C. F. Van Loan · 2012
Earlier work this paper cites.
Exploring collections of 3d models using fuzzy correspondences
V. G. Kim, W. Li, N. J. Mitra, S. DiVerdi, and T. Funkhouser · 2012
Earlier work this paper cites.
Topics in random matrix theory
T. Tao · 2012
Earlier work this paper cites.
Automated network analysis by projected power method
Z. Wang, W. Li, and Y. Sun · 2012
Earlier work this paper cites.
Low-rank matrix recovery from errors and erasures
Y. Chen, A. Jalali, S. Sanghavi, and C. Caramanis · 2013
Cited alongside, same era.
Consistent shape maps via semidefinite programming
Q. Huang and L. Guibas · 2013
Cited alongside, same era.
Fine-grained semi-supervised labeling of large shape collections
Q.-X. Huang, H. Su, and L. Guibas · 2013
Cited alongside, same era.
Low-rank matrix completion using alternating minimization
P. Jain, P. Netrapalli, and S. Sanghavi · 2013
Cited alongside, same era.
Phase retrieval using alternating minimization
P. Netrapalli, P. Jain, and S. Sanghavi · 2013
Cited alongside, same era.
Solving the multi-way matching problem by permutation synchronization
D. Pachauri, R. Kondor, and V. Singh · 2013
Cited alongside, same era.
Low-rank solutions of linear matrix equations via procrustes flow
S. Tu, R. Boczar, M. Soltanolkotabi, and B. Recht · 2015
Later among the works it cites.
An introduction to matrix concentration inequalities
J. A. Tropp · 2015
Later among the works it cites.
A convergent gradient descent algorithm for rank minimization and semidefinite programming from random linear measurements
Q. Zheng and J. Lafferty · 2015
Later among the works it cites.
Nonconvex low rank matrix factorization via inexact first order oracle
T. Zhao, Z. Wang, and H. Liu · 2015
Later among the works it cites.
Exact recovery in the stochastic block model
E. Abbe, A. Bandeira, and G. Hall · 2016
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Exact and stable recovery of rotations for robust synchronization
L. Wang and A. Singer · 2013
Cited alongside, same era.
Truncated power method for sparse eigenvalue problems
X.-T. Yuan and T. Zhang · 2013
Cited alongside, same era.
Multireference alignment using semidefinite programming
A. S. Bandeira, M. Charikar, A. Singer, and A. Zhu · 2014
Cited alongside, same era.
Sharp nonasymptotic bounds on the norm of random matrices with independent entries
A. Bandeira and R. van Handel · 2014
Cited alongside, same era.
Near-optimal joint object matching via convex relaxation
Y. Chen, L. J. Guibas, and Q.-X. Huang · 2014
Cited alongside, same era.
Cone-constrained principal component analysis
Y. Deshpande, A. Montanari, and E. Richard · 2014
Cited alongside, same era.
A. Bandeira, N. Boumal, and V. Voroninski · 2016
Closest in time.
Recovery and rigidity in a regular stochastic block model
G. Brito, I. Dumitriu, S. Ganguly, C. Hoffman, and L. V. Tran · 2016
Closest in time.
Global optimality of local search for low rank matrix recovery
S. Bhojanapalli, B. Neyshabur, and N. Srebro · 2016
Closest in time.
Nonconvex phase synchronization
N. Boumal · 2016
Closest in time.
Community recovery in graphs with locality
Y. Chen, G. Kamath, C. Suh, and D. Tse · 2016
Closest in time.
Kaczmarz method for solving quadratic equations
Y. Chi and Y. M. Lu · 2016
Closest in time.
Information recovery from pairwise measurements
Y. Chen, C. Suh, and A. J. Goldsmith · 2016
Closest in time.
The geometry of synchronization problems and learning group actions
T. Gao, J. Brodzki, and S. Mukherjee · 2016
Closest in time.
Matrix completion has no spurious local minimum
R. Ge, J. D. Lee, and T. Ma · 2016
Closest in time.
Achieving exact cluster recovery threshold via semidefinite programming
B. Hajek, Y. Wu, and J. Xu · 2016
Closest in time.
Phase transitions in semidefinite relaxations
A. Javanmard, A. Montanari, and F. Ricci-Tersenghi · 2016
Closest in time.
Rapid, robust, and reliable blind deconvolution via nonconvex optimization
X. Li, S. Ling, T. Strohmer, and K. Wei · 2016
Closest in time.
Gradient descent only converges to minimizers
J. D. Lee, M. Simchowitz, M. I. Jordan, and B. Recht · 2016
Closest in time.
H. Liu, M.-C. Yue, and A. M.-C. So · 2016
Closest in time.
The landscape of empirical risk for non-convex losses
S. Mei, Y. Bai, and A. Montanari · 2016
Closest in time.
D. Park, A. Kyrillidis, S. Bhojanapalli, C. Caramanis, and S. Sanghavi · 2016
Closest in time.
Normalized spectral map synchronization
Y. Shen, Q. Huang, N. Srebro, and S. Sanghavi · 2016
Closest in time.
A geometric analysis of phase retrieval
J. Sun, Q. Qu, and J. Wright · 2016
Closest in time.
Solving systems of random quadratic equations via truncated amplitude flow
G. Wang, G. B. Giannakis, and Y. C. Eldar · 2016
Closest in time.
Fast algorithms for robust PCA via gradient descent
X. Yi, D. Park, Y. Chen, and C. Caramanis · 2016
Closest in time.
Provable non-convex phase retrieval with outliers: Median truncated Wirtinger flow
H. Zhang, Y. Chi, and Y. Liang · 2016
Closest in time.
Reshaped Wirtinger flow for solving quadratic systems of equations
H. Zhang and Y. Liang · 2016
Closest in time.
Solving random quadratic systems of equations is nearly as easy as solving linear systems
Y. Chen and E. Candes · 2017
Closest in time.
C. Ma, K. Wang, Y. Chi, and Y. Chen · 2017
Closest in time.
Resolving phase ambiguity in dual-echo dixon imaging using a projected power method
T. Zhang, Y. Chen, S. Bao, M. Alley, J. Pauly, B. Hargreaves, and S. Vasanawala · 2017
Closest in time.