Skip to content
conftrace_

statistical query

60 papers

SQ

Papers

Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals COLT 2025 Can Neural Networks Achieve Optimal Computational-statistical Tradeoff? An Analysis on Single-Index Model ICLR 2025 On Learning Parallel Pancakes with Mostly Uniform Weights ICML 2025 Active Classification with Few Queries under Misspecification NeurIPS 2024 Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression COLT 2024 Computational-Statistical Gaps in Gaussian Single-Index Models (Extended Abstract) COLT 2024 Hardness of Learning Neural Networks under the Manifold Hypothesis NeurIPS 2024 Improved Hardness Results for Learning Intersections of Halfspaces COLT 2024 Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds COLT 2024 Learning sum of diverse features: computational hardness and efficient gradient-based training for ridge combinations COLT 2024 Statistical Query Lower Bounds for Learning Truncated Gaussians COLT 2024 Adaptive Data Analysis in a Balanced Adversarial Model NeurIPS 2023 Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures COLT 2023 Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise COLT 2023 List and Certificate Complexities in Replicable Learning NeurIPS 2023 Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise NeurIPS 2023 On the Role of Entanglement and Statistics in Learning NeurIPS 2023 SQ Lower Bounds for Learning Mixtures of Linear Classifiers NeurIPS 2023 SQ Lower Bounds for Learning Mixtures of Separated and Bounded Covariance Gaussians COLT 2023 SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions NeurIPS 2023 Hardness of Learning a Single Neuron with Adversarial Label Noise AISTATS 2022 List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering NeurIPS 2022 Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise COLT 2022 Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals COLT 2022 On the power of adaptivity in statistical adversaries COLT 2022