{"total":113,"rows":[{"id":"2104.11315","title":"SPECTRE: Defending Against Backdoor Attacks Using Robust Statistics","created":"2021-04-22","cited_by_count":130,"area":null},{"id":"2102.09159","title":"Robust and Differentially Private Mean Estimation","created":"2021-02-18","cited_by_count":66,"area":null},{"id":"2111.06578","title":"Differential privacy and robust statistics in high dimensions","created":"2021-11-12","cited_by_count":64,"area":null},{"id":"2205.12173","title":"Byzantine Machine Learning Made Easy by Resilient Averaging of Momentums","created":"2022-05-24","cited_by_count":63,"area":null},{"id":"2305.10633","title":"Smoothing the Landscape Boosts the Signal for SGD: Optimal Sample Complexity for Learning Single Index Models","created":"2023-05-18","cited_by_count":61,"area":null},{"id":"2204.06974","title":"Planting Undetectable Backdoors in Machine Learning Models","created":"2022-04-14","cited_by_count":59,"area":null},{"id":"2102.04401","title":"The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals","created":"2021-02-08","cited_by_count":52,"area":null},{"id":"2212.05015","title":"Robustness Implies Privacy in Statistical Estimation","created":"2022-12-09","cited_by_count":47,"area":null},{"id":"2302.06512","title":"Near-Optimal Cryptographic Hardness of Agnostically Learning Halfspaces and ReLU Regression under Gaussian Marginals","created":"2023-02-13","cited_by_count":31,"area":null},{"id":"2112.00706","title":"Clustering Mixtures with Almost Optimal Separation in Polynomial Time","created":"2021-12-01","cited_by_count":28,"area":null},{"id":"2108.08767","title":"Learning General Halfspaces with General Massart Noise under the Gaussian Distribution","created":"2021-08-19","cited_by_count":27,"area":null},{"id":"2204.02550","title":"Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures","created":"2022-04-06","cited_by_count":26,"area":null},{"id":"2106.09689","title":"Statistical Query Lower Bounds for List-Decodable Linear Regression","created":"2021-06-17","cited_by_count":25,"area":null},{"id":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","cited_by_count":25,"area":null},{"id":"2211.00724","title":"Privacy Induces Robustness: Information-Computation Gaps and Sparse Mean Estimation","created":"2022-11-01","cited_by_count":25,"area":null},{"id":"2206.03441","title":"Robust Sparse Mean Estimation via Sum of Squares","created":"2022-06-07","cited_by_count":24,"area":null},{"id":"2105.15081","title":"Optimal Spectral Recovery of a Planted Vector in a Subspace","created":"2021-05-31","cited_by_count":21,"area":null},{"id":"2108.09805","title":"Efficient Algorithms for Learning from Coarse Labels","created":"2021-08-22","cited_by_count":21,"area":null},{"id":"2303.04288","title":"Polynomial Time and Private Learning of Unbounded Gaussian Mixture Models","created":"2023-03-07","cited_by_count":19,"area":null},{"id":"2307.15804","title":"On Single Index Models beyond Gaussian Data","created":"2023-07-28","cited_by_count":17,"area":null},{"id":"2310.06289","title":"Better and Simpler Lower Bounds for Differentially Private Statistical Estimation","created":"2023-10-10","cited_by_count":17,"area":null},{"id":"2207.14030","title":"Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems","created":"2022-07-28","cited_by_count":16,"area":null},{"id":"2109.11515","title":"Outlier-Robust Sparse Estimation via Non-Convex Optimization","created":"2021-09-23","cited_by_count":14,"area":null},{"id":"2110.01602","title":"Clustering a Mixture of Gaussians with Unknown Covariance","created":"2021-10-04","cited_by_count":14,"area":null},{"id":"2112.09104","title":"Non-Gaussian Component Analysis via Lattice Basis Reduction","created":"2021-12-16","cited_by_count":14,"area":null},{"id":"2206.05245","title":"List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering","created":"2022-06-10","cited_by_count":13,"area":null},{"id":"2211.16333","title":"Outlier-Robust Sparse Mean Estimation for Heavy-Tailed Distributions","created":"2022-11-29","cited_by_count":13,"area":null},{"id":"2403.04744","title":"SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions","created":"2024-03-07","cited_by_count":13,"area":null},{"id":"2104.09665","title":"Learning GMMs with Nearly Optimal Robustness Guarantees","created":"2021-04-19","cited_by_count":12,"area":null},{"id":"2205.14337","title":"List-Decodable Sparse Mean Estimation","created":"2022-05-28","cited_by_count":11,"area":null},{"id":"2305.02544","title":"Nearly-Linear Time and Streaming Algorithms for Outlier-Robust PCA","created":"2023-05-04","cited_by_count":10,"area":null},{"id":"2410.21194","title":"SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications","created":"2024-10-28","cited_by_count":10,"area":null},{"id":"2205.16003","title":"Learning (Very) Simple Generative Models Is Hard","created":"2022-05-31","cited_by_count":9,"area":null},{"id":"2305.05765","title":"On the average-case complexity of learning output distributions of quantum circuits","created":"2023-05-09","cited_by_count":9,"area":null},{"id":"2306.16352","title":"Information-Computation Tradeoffs for Learning Margin Halfspaces with Random Classification Noise","created":"2023-06-28","cited_by_count":9,"area":null},{"id":"2206.10942","title":"List-Decodable Covariance Estimation","created":"2022-06-22","cited_by_count":8,"area":null},{"id":"2108.07880","title":"Statistically Near-Optimal Hypothesis Selection","created":"2021-08-17","cited_by_count":7,"area":null},{"id":"2110.05517","title":"Learnability of the output distributions of local quantum circuits","created":"2021-10-11","cited_by_count":7,"area":null},{"id":"2312.01547","title":"Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression","created":"2023-12-04","cited_by_count":7,"area":null},{"id":"2405.19912","title":"Robust Kernel Hypothesis Testing under Data Corruption","created":"2024-05-30","cited_by_count":7,"area":null},{"id":"2406.11485","title":"Active clustering with bandit feedback","created":"2024-06-17","cited_by_count":7,"area":null},{"id":"2503.23896","title":"Feature learning from non-Gaussian inputs: the case of Independent Component Analysis in high dimensions","created":"2025-03-31","cited_by_count":7,"area":null},{"id":"2202.05096","title":"Near-Optimal Statistical Query Lower Bounds for Agnostically Learning Intersections of Halfspaces with Gaussian Marginals","created":"2022-02-10","cited_by_count":6,"area":null},{"id":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","cited_by_count":6,"area":null},{"id":"2402.15995","title":"Improved Hardness Results for Learning Intersections of Halfspaces","created":"2024-02-25","cited_by_count":6,"area":null},{"id":"2403.02300","title":"Statistical Query Lower Bounds for Learning Truncated Gaussians","created":"2024-03-04","cited_by_count":6,"area":null},{"id":"2410.21426","title":"Sum-of-squares lower bounds for Non-Gaussian Component Analysis","created":"2024-10-28","cited_by_count":6,"area":null},{"id":"2411.15669","title":"Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models","created":"2024-11-23","cited_by_count":6,"area":null},{"id":"2112.05445","title":"Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures","created":"2021-12-10","cited_by_count":5,"area":null},{"id":"2202.06825","title":"Robust Estimation of Discrete Distributions under Local Differential Privacy","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2208.05447","title":"Robust Methods for High-Dimensional Linear Learning","created":"2022-08-10","cited_by_count":5,"area":null},{"id":"2210.02415","title":"A Fourier Approach to Mixture Learning","created":"2022-10-05","cited_by_count":5,"area":null},{"id":"2210.09949","title":"SQ Lower Bounds for Learning Single Neurons with Massart Noise","created":"2022-10-18","cited_by_count":5,"area":null},{"id":"2212.10872","title":"Is it easier to count communities than find them?","created":"2022-12-21","cited_by_count":5,"area":null},{"id":"2307.08438","title":"Near-Optimal Bounds for Learning Gaussian Halfspaces with Random Classification Noise","created":"2023-07-13","cited_by_count":5,"area":null},{"id":"2309.03847","title":"Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples","created":"2023-09-07","cited_by_count":5,"area":null},{"id":"2410.01186","title":"Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate","created":"2024-10-02","cited_by_count":5,"area":null},{"id":"2411.14349","title":"Agnostic Learning of Arbitrary ReLU Activation under Gaussian Marginals","created":"2024-11-21","cited_by_count":5,"area":null},{"id":"2206.04589","title":"Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models","created":"2022-06-09","cited_by_count":4,"area":null},{"id":"2208.11592","title":"Outlier Robust and Sparse Estimation of Linear Regression Coefficients","created":"2022-08-24","cited_by_count":4,"area":null},{"id":"2310.11876","title":"SQ Lower Bounds for Learning Mixtures of Linear Classifiers","created":"2023-10-18","cited_by_count":4,"area":null},{"id":"2402.14103","title":"Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression","created":"2024-02-21","cited_by_count":4,"area":null},{"id":"2406.17814","title":"Distribution Learnability and Robustness","created":"2024-06-25","cited_by_count":4,"area":null},{"id":"2411.12700","title":"Learning multivariate Gaussians with imperfect advice","created":"2024-11-19","cited_by_count":4,"area":null},{"id":"2510.04115","title":"On the Statistical Query Complexity of Learning Semiautomata: a Random Walk Approach","created":"2025-10-05","cited_by_count":4,"area":null},{"id":"2210.13706","title":"Gaussian Mean Testing Made Simple","created":"2022-10-25","cited_by_count":3,"area":null},{"id":"2301.09024","title":"Statistically Optimal Robust Mean and Covariance Estimation for Anisotropic Gaussians","created":"2023-01-21","cited_by_count":3,"area":null},{"id":"2301.11124","title":"SQ Lower Bounds for Random Sparse Planted Vector Problem","created":"2023-01-26","cited_by_count":3,"area":null},{"id":"2306.00673","title":"Attribute-Efficient PAC Learning of Low-Degree Polynomial Threshold Functions with Nasty Noise","created":"2023-06-01","cited_by_count":3,"area":null},{"id":"2312.05645","title":"Sample-Optimal Locally Private Hypothesis Selection and the Provable Benefits of Interactivity","created":"2023-12-09","cited_by_count":3,"area":null},{"id":"2312.14922","title":"Learning from higher-order statistics, efficiently: hypothesis tests, random features, and neural networks","created":"2023-12-22","cited_by_count":3,"area":null},{"id":"2404.03272","title":"Cryptographic Hardness of Score Estimation","created":"2024-04-04","cited_by_count":3,"area":null},{"id":"2412.21203","title":"SoS Certificates for Sparse Singular Values and Their Applications: Robust Statistics, Subspace Distortion, and More","created":"2024-12-30","cited_by_count":3,"area":null},{"id":"2110.01901","title":"Inferring Hidden Structures in Random Graphs","created":"2021-10-05","cited_by_count":2,"area":null},{"id":"2203.02824","title":"Distributional Hardness Against Preconditioned Lasso via Erasure-Robust Designs","created":"2022-03-05","cited_by_count":2,"area":null},{"id":"2302.03658","title":"Planted Bipartite Graph Detection","created":"2023-02-07","cited_by_count":2,"area":null},{"id":"2306.05679","title":"Bayes optimal learning in high-dimensional linear regression with network side information","created":"2023-06-09","cited_by_count":2,"area":null},{"id":"2403.10416","title":"Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2403.10547","title":"Robust Second-Order Nonconvex Optimization and Its Application to Low Rank Matrix Sensing","created":"2024-03-12","cited_by_count":2,"area":null},{"id":"2407.04783","title":"Agnostic Private Density Estimation for GMMs via List Global Stability","created":"2024-07-05","cited_by_count":2,"area":null},{"id":"2412.02670","title":"The Broader Landscape of Robustness in Algorithmic Statistics","created":"2024-12-03","cited_by_count":2,"area":null},{"id":"2502.11413","title":"Statistical Query Hardness of Multiclass Linear Classification with Random Classification Noise","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2505.21430","title":"Attribute-Efficient PAC Learning of Sparse Halfspaces with Constant Malicious Noise Rate","created":"2025-05-27","cited_by_count":2,"area":null},{"id":"2506.06259","title":"An Optimized Franz-Parisi Criterion and its Equivalence with SQ Lower Bounds","created":"2025-06-06","cited_by_count":2,"area":null},{"id":"2511.19398","title":"PTF Testing Lower Bounds for Non-Gaussian Component Analysis","created":"2025-11-24","cited_by_count":2,"area":null},{"id":"2603.02594","title":"Low-Degree Method Fails to Predict Robust Subspace Recovery","created":"2026-03-03","cited_by_count":2,"area":null},{"id":"2105.05555","title":"Robust Learning of Fixed-Structure Bayesian Networks in Nearly-Linear Time","created":"2021-05-12","cited_by_count":1,"area":null},{"id":"2205.07488","title":"Robust Testing in High-Dimensional Sparse Models","created":"2022-05-16","cited_by_count":1,"area":null},{"id":"2211.15744","title":"Sketch-and-solve approaches to k-means clustering by semidefinite programming","created":"2022-11-28","cited_by_count":1,"area":null},{"id":"2305.00966","title":"A Spectral Algorithm for List-Decodable Covariance Estimation in Relative Frobenius Norm","created":"2023-05-01","cited_by_count":1,"area":null},{"id":"2403.04726","title":"A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation","created":"2024-03-07","cited_by_count":1,"area":null},{"id":"2410.23937","title":"Robust Sparse Regression with Non-Isotropic Designs","created":"2024-10-31","cited_by_count":1,"area":null},{"id":"2411.11238","title":"Reliable Learning of Halfspaces under Gaussian Marginals","created":"2024-11-18","cited_by_count":1,"area":null},{"id":"2601.05157","title":"Learning Mixture Models via Efficient High-dimensional Sparse Fourier Transforms","created":"2026-01-08","cited_by_count":1,"area":null},{"id":"2602.21191","title":"Statistical Query Lower Bounds for Smoothed Agnostic Learning","created":"2026-02-24","cited_by_count":1,"area":null},{"id":"2603.16798","title":"High-Dimensional Gaussian Mean Estimation under Realizable Contamination","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2604.04228","title":"Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers","created":"2026-04-05","cited_by_count":1,"area":null},{"id":"2302.00242","title":"The Parametric Stability of Well-separated Spherical Gaussian Mixtures","created":"2023-02-01","cited_by_count":0,"area":null},{"id":"2302.10844","title":"Robust Mean Estimation Without Moments for Symmetric Distributions","created":"2023-02-21","cited_by_count":0,"area":null}],"next_cursor":"100"}