Co-occurring keywords · papers mentioning both
Papers
High-Dimensional Gaussian Mean Estimation under Realizable Contamination
COLT 2026
Invited Open Problem: Is the Power of Deep Learning over Linear Models Inherently Distribution Dependent?
COLT 2026
On the Statistical Query Complexity of Learning Semiautomata: a Random Walk Approach
COLT 2026
Statistical and Computational Limits for Tensor-on-Tensor Association Detection
COLT 2023
Learning (Very) Simple Generative Models Is Hard
NeurIPS 2022
Near-Optimal Statistical Query Hardness of Learning Halfspaces with Massart Noise
COLT 2022
Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models
COLT 2022
Realizable Learning is All You Need
COLT 2022
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent
COLT 2021
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model
COLT 2021
Gradient Descent for One-Hidden-Layer Neural Networks: Polynomial Convergence and SQ Lower Bounds
COLT 2019
Learning Shuffle Ideals Under Restricted Distributions
NeurIPS 2014
Map-Reduce for Machine Learning on Multicore
NeurIPS 2006