low-degree polynomial

Recovery of Planted Subgraphs COLT 2026 Shallow Neural Networks Learn Low-Degree Spherical Polynomials with Feature Learning by Learnable Channel Attention ALT 2026 Spectral Recovery of a Planted Triangle-Dense Subgraph COLT 2026 Stable algorithms Lower Bounds for Estimation from MMSE Discontinuities: Extended Abstract COLT 2026 Testing for a Hidden Geometry in Random Graphs COLT 2026 The Monotonicity of the Franz–Parisi Potential Is Equivalent to Low-Degree MMSE Lower Bounds: Extended Abstract COLT 2026 Computational-Statistical Gaps in Gaussian Single-Index Models (Extended Abstract) COLT 2024 Computation-information gap in high-dimensional clustering COLT 2024 Low Degree Hardness for Broadcasting on Trees NeurIPS 2024 Low-degree phase transitions for detecting a planted clique in sublinear time COLT 2024 Testable Learning with Distribution Shift COLT 2024 Detection-Recovery Gap for Planted Dense Cycles COLT 2023 Is Planted Coloring Easier than Planted Clique? COLT 2023 SQ Lower Bounds for Random Sparse Planted Vector Problem ALT 2023 Statistical-Computational Tradeoffs in Mixed Sparse Linear Regression COLT 2023 Lattice-Based Methods Surpass Sum-of-Squares in Clustering COLT 2022 On the well-spread property and its relation to linear regression COLT 2022 Reconstruction on Trees and Low-Degree Polynomials NeurIPS 2022 Statistical and Computational Phase Transitions in Group Testing COLT 2022 Hypothesis testing with low-degree polynomials in the Morris class of exponential families COLT 2021 Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent COLT 2021 On the Connection Between Learning Two-Layer Neural Networks and Tensor Decomposition AISTATS 2019 Tight Bounds on ℓ_1 Approximation and Learning of Self-Bounding Functions ALT 2017