{"total":33,"rows":[{"id":"2204.06974","title":"Planting Undetectable Backdoors in Machine Learning Models","created":"2022-04-14","cited_by_count":59,"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":"2202.05258","title":"Hardness of Noise-Free Learning for Two-Hidden-Layer Neural Networks","created":"2022-02-10","cited_by_count":28,"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":"2112.03898","title":"Lattice-Based Methods Surpass Sum-of-Squares in Clustering","created":"2021-12-07","cited_by_count":25,"area":null},{"id":"2207.14266","title":"Cryptographic Hardness of Learning Halfspaces with Massart Noise","created":"2022-07-28","cited_by_count":25,"area":null},{"id":"2106.10744","title":"On the Cryptographic Hardness of Learning Single Periodic Neurons","created":"2021-06-20","cited_by_count":20,"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":"2112.09104","title":"Non-Gaussian Component Analysis via Lattice Basis Reduction","created":"2021-12-16","cited_by_count":14,"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":"2106.03131","title":"The Fine-Grained Hardness of Sparse Linear Regression","created":"2021-06-06","cited_by_count":12,"area":null},{"id":"2205.16003","title":"Learning (Very) Simple Generative Models Is Hard","created":"2022-05-31","cited_by_count":9,"area":null},{"id":"2409.05284","title":"Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics","created":"2024-09-09","cited_by_count":8,"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":"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":"2402.14103","title":"Computational-Statistical Gaps for Improper Learning in Sparse Linear Regression","created":"2024-02-21","cited_by_count":4,"area":null},{"id":"2405.15084","title":"Efficient Certificates of Anti-Concentration Beyond Gaussians","created":"2024-05-23","cited_by_count":4,"area":null},{"id":"2501.09189","title":"Testing Noise Assumptions of Learning Algorithms","created":"2025-01-15","cited_by_count":4,"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":"2404.03272","title":"Cryptographic Hardness of Score Estimation","created":"2024-04-04","cited_by_count":3,"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":"2210.06509","title":"Understanding Impacts of Task Similarity on Backdoor Attack and Detection","created":"2022-10-12","cited_by_count":1,"area":null},{"id":"2402.14645","title":"Sparse Linear Regression and Lattice Problems","created":"2024-02-22","cited_by_count":1,"area":null},{"id":"2410.03477","title":"On the Hardness of Learning One Hidden Layer Neural Networks","created":"2024-10-04","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":"2607.09532","title":"Statistically Undetectable Backdoors in Deep Neural Networks","created":"2026-07-10","cited_by_count":1,"area":null},{"id":"2306.13057","title":"SQ Lower Bounds for Learning Bounded Covariance GMMs","created":"2023-06-22","cited_by_count":0,"area":null},{"id":"2308.09199","title":"Polynomial Bounds for Learning Noisy Optical Physical Unclonable Functions and Connections to Learning With Errors","created":"2023-08-17","cited_by_count":0,"area":null},{"id":"2411.02298","title":"Sample-Efficient Private Learning of Mixtures of Gaussians","created":"2024-11-04","cited_by_count":0,"area":null},{"id":"2504.03097","title":"A Computational Transition for Detecting Multivariate Shuffled Linear Regression by Low-Degree Polynomials","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2504.15251","title":"On Learning Parallel Pancakes with Mostly Uniform Weights","created":"2025-04-21","cited_by_count":0,"area":null},{"id":"2609.16403","title":"Implementing a White-Box Undetectable Backdoor for Random Fourier Features","created":"2026-09-14","cited_by_count":0,"area":null}],"next_cursor":null}