{"total":63,"rows":[{"id":"2107.08444","title":"A Theory of PAC Learnability of Partial Concept Classes","created":"2021-07-18","cited_by_count":60,"area":null},{"id":"2102.08446","title":"Smoothed Analysis with Adaptive Adversaries","created":"2021-02-16","cited_by_count":57,"area":null},{"id":"2201.08430","title":"Reproducibility in Learning","created":"2022-01-20","cited_by_count":44,"area":null},{"id":"2303.12921","title":"Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization","created":"2023-03-22","cited_by_count":42,"area":null},{"id":"2305.20069","title":"A survey on the complexity of learning quantum states","created":"2023-05-31","cited_by_count":32,"area":null},{"id":"2307.03848","title":"Optimal Learners for Realizable Regression: PAC Learning and Online Learning","created":"2023-07-07","cited_by_count":23,"area":null},{"id":"2104.06970","title":"Understanding the Eluder Dimension","created":"2021-04-14","cited_by_count":19,"area":null},{"id":"2206.03985","title":"How unfair is private learning ?","created":"2022-06-08","cited_by_count":18,"area":null},{"id":"2102.01729","title":"Majorizing Measures, Sequential Complexities, and Online Learning","created":"2021-02-02","cited_by_count":17,"area":null},{"id":"2302.04925","title":"Information Theoretic Lower Bounds for Information Theoretic Upper Bounds","created":"2023-02-09","cited_by_count":17,"area":null},{"id":"2305.14311","title":"Statistical Indistinguishability of Learning Algorithms","created":"2023-05-23","cited_by_count":17,"area":null},{"id":"2111.08911","title":"Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games","created":"2021-11-17","cited_by_count":16,"area":null},{"id":"2311.01599","title":"Local Borsuk-Ulam, Stability, and Replicability","created":"2023-11-02","cited_by_count":14,"area":null},{"id":"2304.02240","title":"List and Certificate Complexities in Replicable Learning","created":"2023-04-05","cited_by_count":13,"area":null},{"id":"2310.18428","title":"The Bayesian Stability Zoo","created":"2023-10-27","cited_by_count":13,"area":null},{"id":"2410.05117","title":"Assouad, Fano, and Le Cam with Interaction: A Unifying Lower Bound Framework and Characterization for Bandit Learnability","created":"2024-10-07","cited_by_count":12,"area":null},{"id":"2102.07171","title":"Private learning implies quantum stability","created":"2021-02-14","cited_by_count":10,"area":null},{"id":"2106.13513","title":"Littlestone Classes are Privately Online Learnable","created":"2021-06-25","cited_by_count":10,"area":null},{"id":"2110.11208","title":"User-Level Private Learning via Correlated Sampling","created":"2021-10-21","cited_by_count":9,"area":null},{"id":"2511.12659","title":"Sample Complexity of Agnostic Multiclass Classification: Natarajan Dimension Strikes Back","created":"2025-11-16","cited_by_count":9,"area":null},{"id":"2102.05174","title":"On the Hardness of PAC-learning Stabilizer States with Noise","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2211.09101","title":"Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes","created":"2022-11-16","cited_by_count":8,"area":null},{"id":"2304.03757","title":"Replicability and stability in learning","created":"2023-04-07","cited_by_count":8,"area":null},{"id":"2405.08920","title":"Neural Collapse Meets Differential Privacy: Curious Behaviors of NoisyGD with Near-perfect Representation Learning","created":"2024-05-14","cited_by_count":8,"area":null},{"id":"2411.01634","title":"Multiclass Transductive Online Learning","created":"2024-11-03","cited_by_count":8,"area":null},{"id":"2206.13257","title":"Finite Littlestone Dimension Implies Finite Information Complexity","created":"2022-06-27","cited_by_count":7,"area":null},{"id":"2307.04733","title":"A unifying framework for differentially private quantum algorithms","created":"2023-07-10","cited_by_count":7,"area":null},{"id":"2405.15599","title":"On the Computational Landscape of Replicable Learning","created":"2024-05-24","cited_by_count":7,"area":null},{"id":"2203.03604","title":"Differential Privacy Amplification in Quantum and Quantum-inspired Algorithms","created":"2022-03-07","cited_by_count":6,"area":null},{"id":"2312.05659","title":"Optimal Unbiased Randomizers for Regression with Label Differential Privacy","created":"2023-12-09","cited_by_count":6,"area":null},{"id":"2402.09483","title":"Oracle-Efficient Differentially Private Learning with Public Data","created":"2024-02-13","cited_by_count":6,"area":null},{"id":"2407.07765","title":"Ramsey Theorems for Trees and a General 'Private Learning Implies Online Learning' Theorem","created":"2024-07-10","cited_by_count":6,"area":null},{"id":"2304.03996","title":"A Unified Characterization of Private Learnability via Graph Theory","created":"2023-04-08","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":"2411.05483","title":"The Limits of Differential Privacy in Online Learning","created":"2024-11-08","cited_by_count":5,"area":null},{"id":"2107.10870","title":"Multiclass versus Binary Differentially Private PAC Learning","created":"2021-07-22","cited_by_count":4,"area":null},{"id":"2212.05050","title":"The unstable formula theorem revisited via algorithms","created":"2022-12-09","cited_by_count":4,"area":null},{"id":"2501.05333","title":"Stability and List-Replicability for Agnostic Learners","created":"2025-01-09","cited_by_count":4,"area":null},{"id":"2503.10240","title":"Spherical dimension","created":"2025-03-13","cited_by_count":4,"area":null},{"id":"2503.15294","title":"Borsuk-Ulam and Replicable Learning of Large-Margin Halfspaces","created":"2025-03-19","cited_by_count":4,"area":null},{"id":"2107.11526","title":"On the Sample Complexity of Privately Learning Axis-Aligned Rectangles","created":"2021-07-24","cited_by_count":3,"area":null},{"id":"2111.12786","title":"Differentially Private Nonparametric Regression Under a Growth Condition","created":"2021-11-24","cited_by_count":3,"area":null},{"id":"2402.00267","title":"Not All Learnable Distribution Classes are Privately Learnable","created":"2024-02-01","cited_by_count":3,"area":null},{"id":"2406.15916","title":"Credit Attribution and Stable Compression","created":"2024-06-22","cited_by_count":3,"area":null},{"id":"2510.00076","title":"Private Learning of Littlestone Classes, Revisited","created":"2025-09-30","cited_by_count":3,"area":null},{"id":"2604.07238","title":"On the Price of Privacy for Language Identification and Generation","created":"2026-04-08","cited_by_count":3,"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":"2505.06581","title":"An $\\tilde{O}$ptimal Differentially Private Learner for Concept Classes with VC Dimension 1","created":"2025-05-10","cited_by_count":2,"area":null},{"id":"2506.12856","title":"Private List Learnability vs. Online List Learnability","created":"2025-06-15","cited_by_count":2,"area":null},{"id":"2511.11819","title":"Simplicial covering dimension of extremal concept classes","created":"2025-11-14","cited_by_count":2,"area":null},{"id":"2604.04535","title":"Learning from Equivalence Queries, Revisited","created":"2026-04-06","cited_by_count":2,"area":null},{"id":"2209.08319","title":"On PAC Learning Halfspaces in Non-interactive Local Privacy Model with Public Unlabeled Data","created":"2022-09-17","cited_by_count":1,"area":null},{"id":"2407.20640","title":"Improved Bounds for Pure Private Agnostic Learning: Item-Level and User-Level Privacy","created":"2024-07-30","cited_by_count":1,"area":null},{"id":"2510.00574","title":"Private Online Learning against an Adaptive Adversary: Realizable and Agnostic Settings","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2510.01291","title":"Private Realizable-to-Agnostic Transformation with Near-Optimal Sample Complexity","created":"2025-10-01","cited_by_count":1,"area":null},{"id":"2602.23360","title":"Model Agreement via Anchoring","created":"2026-02-26","cited_by_count":1,"area":null},{"id":"2606.06148","title":"Tight list replicability bounds via a novel sphere covering theorem","created":"2026-06-04","cited_by_count":1,"area":null},{"id":"2606.18236","title":"Sign-Rank, Index, and List Replicability: Connections and Separations","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2108.05569","title":"Agnostic Online Learning and Excellent Sets","created":"2021-08-12","cited_by_count":0,"area":null},{"id":"2111.10048","title":"Uniform Brackets, Containers, and Combinatorial Macbeath Regions","created":"2021-11-19","cited_by_count":0,"area":null},{"id":"2212.04216","title":"Differentially-Private Bayes Consistency","created":"2022-12-08","cited_by_count":0,"area":null},{"id":"2602.09499","title":"Computationally Efficient Replicable Learning of Parities and Applications","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2610.05102","title":"Private Component-by-Component Learning","created":"2026-10-04","cited_by_count":0,"area":null}],"next_cursor":null}