statistical query lower bound

On efficient robust regression with subquadratic samples COLT 2026 Quiet Planting for k-SAT, Multiple Solutions of Arbitrary Geometry COLT 2026 Improved Hardness Results for Learning Intersections of Halfspaces COLT 2024 Learning sum of diverse features: computational hardness and efficient gradient-based training for ridge combinations COLT 2024 Matching the Statistical Query Lower Bound for k-Sparse Parity Problems with Sign Stochastic Gradient Descent NeurIPS 2024 Reliable Learning of Halfspaces under Gaussian Marginals NeurIPS 2024 Statistical Query Lower Bounds for Learning Truncated Gaussians COLT 2024 SQ Lower Bounds for Learning Mixtures of Linear Classifiers NeurIPS 2023 SQ Lower Bounds for Random Sparse Planted Vector Problem ALT 2023 Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks NeurIPS 2022 List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering NeurIPS 2022 SQ Lower Bounds for Learning Single Neurons with Massart Noise NeurIPS 2022 Statistical Query Lower Bounds for Tensor PCA JMLR 2021 Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks COLT 2020 Gradient Descent for One-Hidden-Layer Neural Networks: Polynomial Convergence and SQ Lower Bounds COLT 2019