No article text was recorded for this version.
statistical query model limitations
Version 1 of 131 papers34 conceptsfrozen 2026-10-04
Papers in this version
- Blog: SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
- Blog: Matching the Statistical Query Lower Bound for $k$-Sparse Parity Problems with Sign Stochastic Gradient Descent
- Blog: Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise
- Blog: The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model
- Blog: Learning (Very) Simple Generative Models Is Hard
- Blog: SQ Lower Bounds for Learning Single Neurons with Massart Noise
- Blog: SQ Lower Bounds for Learning Mixtures of Linear Classifiers
- Blog: Statistical Query Lower Bounds for Learning Truncated Gaussians
- Blog: Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals
- Blog: On the Complexity of Learning Neural Networks
- Blog: Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models
- Blog: Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
- Blog: Open Problem: The Statistical Query Complexity of Learning Sparse Halfspaces
- Blog: Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise
- Blog: On the Complexity of Random Satisfiability Problems with Planted Solutions
- Blog: Computational-Statistical Gaps in Gaussian Single-Index Models (Extended Abstract)
- Blog: Statistical Query Lower Bounds for List-Decodable Linear Regression
- Blog: Statistical Query Lower Bounds for Robust Estimation of High-dimensional Gaussians and Gaussian Mixtures
- Blog: SQ Lower Bounds for Learning Mixtures of Separated and Bounded Covariance Gaussians
- Blog: Approximate resilience, monotonicity, and the complexity of agnostic learning
- Blog: The Edge Density Barrier: Computational-Statistical Tradeoffs in Combinatorial Inference
- Blog: Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise
- Blog: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
- Blog: Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent
- Blog: Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals
- Blog: Statistical-Computational Tradeoff in Single Index Models
- Blog: More Supervision, Less Computation: Statistical-Computational Tradeoffs in Weakly Supervised Learning
- Blog: Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginals
- Blog: Statistical Algorithms and a Lower Bound for Detecting Planted Clique
- Blog: Cryptographic Hardness of Learning Halfspaces with Massart Noise
- Blog: On Mean Estimation for General Norms with Statistical Queries
History & citation
Current · Permanent link
- This direction split from Computational Hardness and the Statistical Query Barrier (100% overlap)
- This direction split from Statistical Query Lower Bounds and Computational Statistical Gaps (74% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_statistical_query_model_limitations_48546790,
title = {statistical query model limitations},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/statistical-query-model-limitations/rdr_485467907b6b427ea8236c1e03dae3e2},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_statistical_query_model_limitations_48546790_v1,
title = {statistical query model limitations},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/statistical-query-model-limitations/rdr_485467907b6b427ea8236c1e03dae3e2/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}