{"total":26,"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":"2201.08430","title":"Reproducibility in Learning","created":"2022-01-20","cited_by_count":44,"area":null},{"id":"2406.06467","title":"How Far Can Transformers Reason? The Globality Barrier and Inductive Scratchpad","created":"2024-06-10","cited_by_count":36,"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":"2108.09805","title":"Efficient Algorithms for Learning from Coarse Labels","created":"2021-08-22","cited_by_count":21,"area":null},{"id":"2302.13849","title":"Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension","created":"2023-02-27","cited_by_count":18,"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":"2206.02765","title":"Communication-constrained hypothesis testing: Optimality, robustness, and reverse data processing inequalities","created":"2022-06-06","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":"2410.13548","title":"Adaptive and oblivious statistical adversaries are equivalent","created":"2024-10-17","cited_by_count":9,"area":null},{"id":"2207.03933","title":"A law of adversarial risk, interpolation, and label noise","created":"2022-07-08","cited_by_count":8,"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":"2306.03161","title":"On the Role of Entanglement and Statistics in Learning","created":"2023-06-05","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.02075","title":"Learning Quantum Processes with Quantum Statistical Queries","created":"2023-10-03","cited_by_count":4,"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":"2502.15024","title":"Low degree conjecture implies sharp computational thresholds in stochastic block model","created":"2025-02-20","cited_by_count":3,"area":null},{"id":"2510.14331","title":"LLM Priors for ERM over Programs","created":"2025-10-16","cited_by_count":3,"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":"2210.15439","title":"Learning versus Refutation in Noninteractive Local Differential Privacy","created":"2022-10-26","cited_by_count":0,"area":null},{"id":"2405.12085","title":"Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness","created":"2024-05-20","cited_by_count":0,"area":null},{"id":"2511.21876","title":"Differential privacy from axioms","created":"2025-11-26","cited_by_count":0,"area":null},{"id":"2602.12449","title":"Computationally sufficient statistics for Ising models","created":"2026-02-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":"2605.02350","title":"A Near-optimal SQ Lower Bound for Smoothed Agnostic Learning of Boolean Halfspaces","created":"2026-05-04","cited_by_count":0,"area":null},{"id":"2610.02749","title":"Learning Query Encoders Can Be Hard Even When Vector Retrieval Is Geometrically Easy","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}