{"list":"other","total":57,"rows":[{"id":"1607.01668","title":"Tensor Decomposition for Signal Processing and Machine Learning","created":"2016-07-06","cited_by_count":224},{"id":"1611.03473","title":"Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures","created":"2016-11-10","cited_by_count":115},{"id":"1907.11636","title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","created":"2019-07-26","cited_by_count":85},{"id":"1411.1076","title":"A statistical model for tensor PCA","created":"2014-11-04","cited_by_count":72},{"id":"1710.05017","title":"The power of sum-of-squares for detecting hidden structures","created":"2017-10-13","cited_by_count":54},{"id":"2005.08099","title":"Reducibility and Statistical-Computational Gaps from Secret Leakage","created":"2020-05-16","cited_by_count":51},{"id":"2009.06107","title":"Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent","created":"2020-09-13","cited_by_count":51},{"id":"1711.10781","title":"Introduction to Tensor Decompositions and their Applications in Machine Learning","created":"2017-11-29","cited_by_count":46},{"id":"1907.11635","title":"Subexponential-Time Algorithms for Sparse PCA","created":"2019-07-26","cited_by_count":41},{"id":"2008.02269","title":"Computational Barriers to Estimation from Low-Degree Polynomials","created":"2020-08-05","cited_by_count":39},{"id":"1512.02337","title":"Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors","created":"2015-12-08","cited_by_count":38},{"id":"1507.03269","title":"Tensor principal component analysis via sum-of-squares proofs","created":"2015-07-12","cited_by_count":35},{"id":"1806.07508","title":"Reducibility and Computational Lower Bounds for Problems with Planted Sparse Structure","created":"2018-06-19","cited_by_count":35},{"id":"2205.09727","title":"The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics","created":"2022-05-19","cited_by_count":31},{"id":"1902.07324","title":"Computational Hardness of Certifying Bounds on Constrained PCA Problems","created":"2019-02-19","cited_by_count":30},{"id":"2002.04457","title":"Community Detection on Mixture Multi-layer Networks via Regularized Tensor Decomposition","created":"2020-02-10","cited_by_count":30},{"id":"2005.10743","title":"Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits","created":"2020-05-21","cited_by_count":30},{"id":"1503.00424","title":"Learning Mixtures of Gaussians in High Dimensions","created":"2015-03-02","cited_by_count":29},{"id":"1710.00264","title":"Bayesian estimation from few samples: community detection and related problems","created":"2017-09-30","cited_by_count":28},{"id":"1902.00139","title":"Passed & Spurious: Descent Algorithms and Local Minima in Spiked Matrix-Tensor Models","created":"2019-02-01","cited_by_count":28},{"id":"1807.11419","title":"High-dimensional estimation via sum-of-squares proofs","created":"2018-07-30","cited_by_count":25},{"id":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","cited_by_count":25},{"id":"1304.1831","title":"Limits of local algorithms over sparse random graphs","created":"2013-04-05","cited_by_count":23},{"id":"1406.6625","title":"Computational Lower Bounds for Community Detection on Random Graphs","created":"2014-06-25","cited_by_count":22},{"id":"1407.1543","title":"Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method","created":"2014-07-06","cited_by_count":22},{"id":"1507.03857","title":"MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channel","created":"2015-07-14","cited_by_count":22},{"id":"1610.01980","title":"Polynomial-time Tensor Decompositions with Sum-of-Squares","created":"2016-10-06","cited_by_count":22},{"id":"1706.05598","title":"On the Optimization Landscape of Tensor Decompositions","created":"2017-06-18","cited_by_count":21},{"id":"1311.3651","title":"Smoothed Analysis of Tensor Decompositions","created":"2013-11-14","cited_by_count":19},{"id":"1311.2891","title":"The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures","created":"2013-11-12","cited_by_count":18},{"id":"2010.06563","title":"Optimal Low-Degree Hardness of Maximum Independent Set","created":"2020-10-13","cited_by_count":16},{"id":"1904.03858","title":"The Kikuchi Hierarchy and Tensor PCA","created":"2019-04-08","cited_by_count":15},{"id":"1706.08672","title":"Fast and robust tensor decomposition with applications to dictionary learning","created":"2017-06-27","cited_by_count":14},{"id":"1712.10163","title":"Estimation under group actions: recovering orbits from invariants","created":"2017-12-29","cited_by_count":14},{"id":"1905.12294","title":"How to iron out rough landscapes and get optimal performances: Averaged Gradient Descent and its application to tensor PCA","created":"2019-05-29","cited_by_count":14},{"id":"1911.01960","title":"Local Statistics, Semidefinite Programming, and Community Detection","created":"2019-11-05","cited_by_count":14},{"id":"2106.02129","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials","created":"2021-06-03","cited_by_count":14},{"id":"2112.09104","title":"Non-Gaussian Component Analysis via Lattice Basis Reduction","created":"2021-12-16","cited_by_count":14},{"id":"2008.12237","title":"Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs","created":"2020-08-27","cited_by_count":13},{"id":"2004.08454","title":"Counterexamples to the Low-Degree Conjecture","created":"2020-04-17","cited_by_count":12},{"id":"1504.05287","title":"Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms","created":"2015-04-21","cited_by_count":10},{"id":"2109.06915","title":"Reconstruction on Trees and Low-Degree Polynomials","created":"2021-09-14","cited_by_count":10},{"id":"2206.07640","title":"Statistical and Computational Phase Transitions in Group Testing","created":"2022-06-15","cited_by_count":10},{"id":"1904.07174","title":"The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property","created":"2019-04-15","cited_by_count":9},{"id":"2002.11835","title":"Tensor Decompositions in Deep Learning","created":"2020-02-26","cited_by_count":9},{"id":"2004.00041","title":"Likelihood landscape and maximum likelihood estimation for the discrete orbit recovery model","created":"2020-03-31","cited_by_count":9},{"id":"2006.10689","title":"Free Energy Wells and Overlap Gap Property in Sparse PCA","created":"2020-06-18","cited_by_count":9},{"id":"1306.5825","title":"Fourier PCA and Robust Tensor Decomposition","created":"2013-06-25","cited_by_count":8},{"id":"2011.03693","title":"Hypothesis testing with low-degree polynomials in the Morris class of exponential families","created":"2020-11-07","cited_by_count":7},{"id":"2203.02790","title":"A Robust Spectral Algorithm for Overcomplete Tensor Decomposition","created":"2022-03-05","cited_by_count":7},{"id":"2204.01911","title":"Almost-Linear Planted Cliques Elude the Metropolis Process","created":"2022-04-05","cited_by_count":7},{"id":"1811.00944","title":"Spectral Methods from Tensor Networks","created":"2018-11-02","cited_by_count":6},{"id":"1711.04952","title":"Sparse High-Dimensional Linear Regression. Algorithmic Barriers and a Local Search Algorithm","created":"2017-11-14","cited_by_count":5},{"id":"2202.06442","title":"Fast algorithm for overcomplete order-3 tensor decomposition","created":"2022-02-14","cited_by_count":5},{"id":"1411.1488","title":"Analyzing Tensor Power Method Dynamics in Overcomplete Regime","created":"2014-11-06","cited_by_count":3},{"id":"2011.09416","title":"Exact nuclear norm, completion and decomposition for random overcomplete tensors via degree-4 SOS","created":"2020-11-18","cited_by_count":3},{"id":"2106.02680","title":"Algorithms from Invariants: Smoothed Analysis of Orbit Recovery over $SO(3)$","created":"2021-06-04","cited_by_count":2}],"next_cursor":null}