{"total":41,"rows":[{"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":"2107.05585","title":"Differentially Private Stochastic Optimization: New Results in Convex and Non-Convex Settings","created":"2021-07-12","cited_by_count":45,"area":null},{"id":"2102.12099","title":"Lossless Compression of Efficient Private Local Randomizers","created":"2021-02-24","cited_by_count":27,"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":"2304.01541","title":"Privacy Amplification via Compression: Achieving the Optimal Privacy-Accuracy-Communication Trade-off in Distributed Mean Estimation","created":"2023-04-04","cited_by_count":22,"area":null},{"id":"2108.09805","title":"Efficient Algorithms for Learning from Coarse Labels","created":"2021-08-22","cited_by_count":21,"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":"2201.09818","title":"Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise","created":"2022-01-24","cited_by_count":14,"area":null},{"id":"2309.03800","title":"Pareto Frontiers in Neural Feature Learning: Data, Compute, Width, and Luck","created":"2023-09-07","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":"2404.02364","title":"Learning Intersections of Halfspaces with Distribution Shift: Improved Algorithms and SQ Lower Bounds","created":"2024-04-02","cited_by_count":13,"area":null},{"id":"2111.10352","title":"On the power of adaptivity in statistical adversaries","created":"2021-11-19","cited_by_count":12,"area":null},{"id":"2407.00966","title":"Smoothed Analysis for Learning Concepts with Low Intrinsic Dimension","created":"2024-07-01","cited_by_count":11,"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":"2501.14349","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2311.05398","title":"The Sample Complexity Of ERMs In Stochastic Convex Optimization","created":"2023-11-09","cited_by_count":8,"area":null},{"id":"2602.01682","title":"Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets","created":"2026-02-02","cited_by_count":8,"area":null},{"id":"2311.08168","title":"Time-Uniform Confidence Spheres for Means of Random Vectors","created":"2023-11-14","cited_by_count":6,"area":null},{"id":"2403.03856","title":"Public-data Assisted Private Stochastic Optimization: Power and Limitations","created":"2024-03-06","cited_by_count":6,"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":"2404.10201","title":"Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages","created":"2024-04-16","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":"2310.11876","title":"SQ Lower Bounds for Learning Mixtures of Linear Classifiers","created":"2023-10-18","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":"2405.17079","title":"Learning with User-Level Local Differential Privacy","created":"2024-05-27","cited_by_count":3,"area":null},{"id":"2503.20879","title":"Quantum advantage for learning shallow neural networks with natural data distributions","created":"2025-03-26","cited_by_count":3,"area":null},{"id":"2310.12660","title":"Gradient Descent Fails to Learn High-frequency Functions and Modular Arithmetic","created":"2023-10-19","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":"2310.01611","title":"Intractability of Learning the Discrete Logarithm with Gradient-Based Methods","created":"2023-10-02","cited_by_count":1,"area":null},{"id":"2406.19040","title":"On Convex Optimization with Semi-Sensitive Features","created":"2024-06-27","cited_by_count":1,"area":null},{"id":"2501.03222","title":"Characterizing the Accuracy-Communication-Privacy Trade-off in Distributed Stochastic Convex Optimization","created":"2025-01-06","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":"2204.08809","title":"Making Progress Based on False Discoveries","created":"2022-04-19","cited_by_count":0,"area":null},{"id":"2207.09916","title":"The Poisson binomial mechanism for secure and private federated learning","created":"2022-07-09","cited_by_count":0,"area":null},{"id":"2410.12045","title":"Differential Privacy on Trust Graphs","created":"2024-10-15","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":"2505.22158","title":"The informativeness of the gradient revisited","created":"2025-05-28","cited_by_count":0,"area":null},{"id":"2510.10665","title":"Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination","created":"2025-10-12","cited_by_count":0,"area":null},{"id":"2602.22300","title":"Testable Learning of General Halfspaces under Massart Noise","created":"2026-02-25","cited_by_count":0,"area":null},{"id":"2604.28032","title":"Shuffling-Aware Optimization for Private Vector Mean Estimation","created":"2026-04-30","cited_by_count":0,"area":null},{"id":"2609.13057","title":"Benign Loss Landscapes Can Coexist with Worst-Case Hardness","created":"2026-09-11","cited_by_count":0,"area":null}],"next_cursor":null}