Fetching the paper…
Reading the bibliography…
We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems.
Wu, Y. and Zhou, H. H. [2019] · 1908
Earlier work this paper cites.
Optimality of spectral clustering for gaussian mixture model, arXiv preprint arXiv:1911.00538
Löffler, M., Zhang, A. Y. and Zhou, H. H. [2019] · 1911
Earlier work this paper cites.
Zhou, X., Zhu, M. and Daniilidis, K. [2015] · 1911
Earlier work this paper cites.
Robust group synchronization via cycle-edge message passing, arXiv preprint arXiv:1912.11347
Lerman, G. and Shi, Y. [2019] · 1912
Earlier work this paper cites.
Rank analysis of incomplete block designs: The method of paired comparisons, Biometrika
BRADLEY, R. A. and TERRY, M. E. [1952] · 1952
Earlier work this paper cites.
The hungarian method for the assignment problem, Naval research logistics quarterly
Kuhn, H. W. [1955] · 1955
Earlier work this paper cites.
Clustering algorithms
Hartigan, J. A. [1975] · 1975
Earlier work this paper cites.
Maximum likelihood from incomplete data via the EM algorithm, Journal of the Royal Statistical Society: Series B (Methodological)
Dempster, A. P., Laird, N. M. and Rubin, D. B. [1977] · 1977
Earlier work this paper cites.
Maximum likelihood estimation of observer error-rates using the em algorithm, Journal of the Royal Statistical Society: Series C (Applied Statistics)
Dawid, A. P. and Skene, A. M. [1979] · 1979
Earlier work this paper cites.
Least squares quantization in PCM, IEEE transactions on information theory
Lloyd, S. [1982] · 1982
Earlier work this paper cites.
On the convergence properties of the EM algorithm, The Annals of statistics
Wu, C. J. [1983] · 1983
Earlier work this paper cites.
Finding hidden Hamiltonian cycles, Random Structures & Algorithms
Broder, A. Z., Frieze, A. M. and Shamir, E. [1994] · 1994
Earlier work this paper cites.
A maximum-likelihood approach to single-particle image refinement, Journal of structural biology
Sigworth, F. J. [1998] · 1998
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection, The Annals of Statistics
Laurent, B. and Massart, P. [2000] · 2000
Earlier work this paper cites.
Community structure in social and biological networks, Proceedings of the national academy of sciences
Girvan, M. and Newman, M. E. [2002] · 2002
Earlier work this paper cites.
Thirty years of graph matching in pattern recognition, International journal of pattern recognition and artificial intelligence
Conte, D., Foggia, P., Sansone, C. and Vento, M. [2004] · 2004
Earlier work this paper cites.
A local search approximation algorithm for k k -means clustering, Computational Geometry
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R. and Wu, A. Y. [2004] · 2004
Earlier work this paper cites.
A simple linear time ( 1 + ϵ ) (1+\epsilon) -approximation algorithm for k k -means clustering in any dimensions, Annual Symposium on Foundations of Computer Science
Kumar, A., Sabharwal, Y. and Sen, S. [2004] · 2004
Earlier work this paper cites.
Three-dimensional electron microscopy of macromolecular assemblies: visualization of biological molecules in their native state
Frank, J. [2006] · 2006
Earlier work this paper cites.
Ling, S. [2020b] · 2006
Earlier work this paper cites.
High-dimensional graphs and variable selection with the Lasso, The annals of statistics
Meinshausen, N. and Bühlmann, P. [2006] · 2006
Earlier work this paper cites.
On model selection consistency of Lasso, Journal of Machine learning research
Zhao, P. and Yu, B. [2006] · 2006
Earlier work this paper cites.
k k -means++: The advantages of careful seeding, Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Arthur, D. and Vassilvitskii, S. [2007] · 2007
Earlier work this paper cites.
Noisy sorting without resampling, Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Braverman, M. and Mossel, E. [2008] · 2008
Earlier work this paper cites.
The hardness of k k -means clustering
Dasgupta, S. [2008] · 2008
Earlier work this paper cites.
Complexity penalized m-estimation: fast computation, Journal of Computational and Graphical Statistics
Friedrich, F., Kempe, A., Liebscher, V. and Winkler, G. [2008] · 2008
Earlier work this paper cites.
Ling, S. [2020a] · 2008
Earlier work this paper cites.
Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators, Electronic Journal of statistics
Lounici, K. [2008] · 2008
Earlier work this paper cites.
NP-hardness of Euclidean sum-of-squares clustering, Machine learning
Aloise, D., Deshpande, A., Hansen, P. and Popat, P. [2009] · 2009
Earlier work this paper cites.
Iterative hard thresholding for compressed sensing, Applied and computational harmonic analysis
Blumensath, T. and Davies, M. E. [2009] · 2009
Earlier work this paper cites.
Necessary and sufficient conditions for sparsity pattern recovery, IEEE Transactions on Information Theory
Fletcher, A. K., Rangan, S. and Goyal, V. K. [2009] · 2009
Earlier work this paper cites.
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting, IEEE Transactions on Information Theory
Wainwright, M. J. [2009] · 2009
Earlier work this paper cites.
High-dimensional variable selection, The Annals of Statistics
Wasserman, L. and Roeder, K. [2009] · 2009
Earlier work this paper cites.
Information theoretic bounds for compressed sensing, IEEE Transactions on Information Theory
Aeron, S., Saligrama, V. and Zhao, M. [2010] · 2010
Earlier work this paper cites.
Clustering with spectral norm and the k k -means algorithm, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Kumar, A. and Kannan, R. [2010] · 2010
Cited alongside, same era.
Empirical comparison of algorithms for network community detection, Proceedings of the 19th international conference on World wide web
Leskovec, J., Lang, K. J. and Mahoney, M. [2010] · 2010
Cited alongside, same era.
Introduction to the non-asymptotic analysis of random matrices, arXiv preprint arXiv:1011.3027
Vershynin, R. [2010] · 2010
Cited alongside, same era.
Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices, IEEE Transactions on Information Theory
Wang, W., Wainwright, M. J. and Ramchandran, K. [2010] · 2010
Cited alongside, same era.
Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements, IEEE Transactions on Information Theory
Group synchronization on grids, arXiv preprint arXiv:1706.08561
Abbe, E., Massoulie, L., Montanari, A., Sly, A. and Srivastava, N. [2017] · 2017
Later among the works it cites.
Statistical guarantees for the EM algorithm: From population to sample-based analysis, The Annals of Statistics
Balakrishnan, S., Wainwright, M. J. and Yu, B. [2017] · 2017
Later among the works it cites.
Tightness of the maximum likelihood semidefinite relaxation for angular synchronization, Mathematical Programming
Bandeira, A. S., Boumal, N. and Singer, A. [2017] · 2017
Later among the works it cites.
Optimal rates of estimation for multi-reference alignment, arXiv preprint arXiv:1702.08546
Bandeira, A. S., Rigollet, P. and Weed, J. [2017] · 2017
Later among the works it cites.
Bispectrum inversion with application to multireference alignment, IEEE Transactions on signal processing
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Candes, E. J. and Plan, Y. [2011] · 2011
Cited alongside, same era.
Hard thresholding pursuit: an algorithm for compressive sensing, SIAM Journal on Numerical Analysis
Foucart, S. [2011] · 2011
Cited alongside, same era.
Nearly sharp sufficient conditions on exact sparsity pattern recovery, IEEE Transactions on Information Theory
Rad, K. R. [2011] · 2011
Cited alongside, same era.
Thresholded basis pursuit: Lp algorithm for order-wise optimal support recovery for sparse and approximately sparse signals from noisy random measurements, IEEE Transactions on Information Theory
Saligrama, V. and Zhao, M. [2011] · 2011
Cited alongside, same era.
Angular synchronization by eigenvectors and semidefinite programming, Applied and computational harmonic analysis
Singer, A. [2011] · 2011
Cited alongside, same era.
Improved spectral-norm bounds for clustering, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Awasthi, P. and Sheffet, O. [2012] · 2012
Cited alongside, same era.
UPS delivers optimal phase diagram in high-dimensional variable selection, The Annals of Statistics
Ji, P. and Jin, J. [2012] · 2012
Cited alongside, same era.
Individual choice behavior: A theoretical analysis
Luce, R. D. [2012] · 2012
Cited alongside, same era.
Bendory, T., Boumal, N., Ma, C., Zhao, Z. and Singer, A. [2017] · 2017
Later among the works it cites.
Phase transitions in approximate ranking, arXiv preprint arXiv:1711.11189
Gao, C. [2017] · 2017
Later among the works it cites.
Minimax rates and efficient algorithms for noisy sorting, arXiv preprint arXiv:1710.10388
Mao, C., Weed, J. and Rigollet, P. [2017] · 2017
Later among the works it cites.
Linear regression with shuffled data: Statistical and computational limits of permutation recovery, IEEE Transactions on Information Theory
Pananjady, A., Wainwright, M. J. and Courtade, T. A. [2017] · 2017
Later among the works it cites.
Simple, robust and optimal ranking from pairwise comparisons, The Journal of Machine Learning Research
Shah, N. B. and Wainwright, M. J. [2017] · 2017
Later among the works it cites.
Theoretical and computational guarantees of mean field variational inference for community detection, The Annals of Statistics, to appear
Zhang, A. Y. and Zhou, H. H. [2017] · 2017
Later among the works it cites.
Multireference alignment is easier with an aperiodic translation distribution, IEEE Transactions on Information Theory
Abbe, E., Bendory, T., Leeb, W., Pereira, J. M., Sharon, N. and Singer, A. [2018] · 2018
Later among the works it cites.
Hidden hamiltonian cycle recovery via linear programming, arXiv preprint arXiv:1804.05436
Bagaria, V., Ding, J., Tse, D., Wu, Y. and Xu, J. [2018] · 2018
Later among the works it cites.
Slope meets lasso: improved oracle bounds and optimality, The Annals of Statistics
Bellec, P. C., Lecué, G. and Tsybakov, A. B. [2018] · 2018
Later among the works it cites.
Variable selection with Hamming loss, The Annals of Statistics
Butucea, C., Ndaoud, M., Stepanova, N. A. and Tsybakov, A. B. [2018] · 2018
Later among the works it cites.
The projected power method: An efficient algorithm for joint alignment from pairwise differences, Communications on Pure and Applied Mathematics
Chen, Y. and Candès, E. J. [2018] · 2018
Later among the works it cites.
Improved bounds for square-root lasso and square-root slope, Electronic Journal of Statistics
Derumigny, A. [2018] · 2018
Later among the works it cites.
Efficient random graph matching via degree profiles, arXiv preprint arXiv:1811.07821
Ding, J., Ma, Z., Wu, Y. and Xu, J. [2018] · 2018
Later among the works it cites.
Singularity, misspecification, and the convergence rate of em, arXiv preprint arXiv:1810.00828
Dwivedi, R., Ho, N., Khamaru, K., Jordan, M. I., Wainwright, M. J. and Yu, B. [2018] · 2018
Later among the works it cites.
Exponential error rates of sdp for block models: Beyond grothendieck’s inequality, IEEE Transactions on Information Theory
Fei, Y. and Chen, Y. [2018] · 2018
Later among the works it cites.
Minimax rates in network analysis: Graphon estimation, community detection and hypothesis testing, Statistical Science, to appear
Gao, C. and Ma, Z. [2018] · 2018
Later among the works it cites.
Community detection in degree-corrected block models, The Annals of Statistics
Gao, C., Ma, Z., Zhang, A. Y. and Zhou, H. H. [2018] · 2018
Later among the works it cites.
Partial recovery bounds for clustering with the relaxed k k means, arXiv preprint arXiv:1807.07547
Giraud, C. and Verzelen, N. [2018] · 2018
Later among the works it cites.
A proof of the block model threshold conjecture, Combinatorica
Mossel, E., Neeman, J. and Sly, A. [2018] · 2018
Later among the works it cites.
Sharp optimal recovery in the two gaussian mixture model, arXiv preprint arXiv:1812.08078
Ndaoud, M. [2018] · 2018
Later among the works it cites.
Optimal variable selection and adaptive noisy compressed sensing, arXiv preprint arXiv:1809.03145
Ndaoud, M. and Tsybakov, A. B. [2018] · 2018
Later among the works it cites.
Benefits of over-parameterization with em, Advances in Neural Information Processing Systems
Xu, J., Hsu, D. J. and Maleki, A. [2018] · 2018
Later among the works it cites.
Near-optimal bounds for phase synchronization, SIAM Journal on Optimization
Zhong, Y. and Boumal, N. [2018] · 2018
Later among the works it cites.
Alleviating label switching with optimal transport, Advances in Neural Information Processing Systems
Monteiller, P., Claici, S., Chien, E., Mirzazadeh, F., Solomon, J. M. and Yurochkin, M. [2019] · 2019
Closest in time.
The sample complexity of multireference alignment, SIAM Journal on Mathematics of Data Science
Perry, A., Weed, J., Bandeira, A. S., Rigollet, P. and Singer, A. [2019] · 2019
Closest in time.
Entrywise eigenvector analysis of random matrices with low expected rank, Annals of Statistics
Abbe, E., Fan, J., Wang, K. and Zhong, Y. [2020] · 2020
Closest in time.
Achieving the bayes error rate in synchronization and block models by sdp, robustly, IEEE Transactions on Information Theory
Fei, Y. and Chen, Y. [2020] · 2020
Closest in time.
Achieving optimal misclassification proportion in stochastic block models, The Journal of Machine Learning Research
Gao, C., Ma, Z., Zhang, A. Y. and Zhou, H. H. [2017] · 2024
Closest in time.
Resolving phase ambiguity in dual-echo dixon imaging using a projected power method, Magnetic resonance in medicine
Zhang, T., Chen, Y., Bao, S., Alley, M. T., Pauly, J. M., Hargreaves, B. A. and Vasanawala, S. S. [2017] · 2076
Closest in time.