{"total":29,"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":"2303.12921","title":"Stability is Stable: Connections between Replicability, Privacy, and Adaptive Generalization","created":"2023-03-22","cited_by_count":42,"area":null},{"id":"2102.01729","title":"Majorizing Measures, Sequential Complexities, and Online Learning","created":"2021-02-02","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":"2311.01599","title":"Local Borsuk-Ulam, Stability, and Replicability","created":"2023-11-02","cited_by_count":14,"area":null},{"id":"2309.12500","title":"User-Level Differential Privacy With Few Examples Per User","created":"2023-09-21","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":"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":"2206.13257","title":"Finite Littlestone Dimension Implies Finite Information Complexity","created":"2022-06-27","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":"2402.09483","title":"Oracle-Efficient Differentially Private Learning with Public Data","created":"2024-02-13","cited_by_count":6,"area":null},{"id":"2402.16778","title":"On the Growth of Mistakes in Differentially Private Online Learning: A Lower Bound Perspective","created":"2024-02-26","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":"2402.11119","title":"Private PAC Learning May be Harder than Online Learning","created":"2024-02-16","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":"2510.00076","title":"Private Learning of Littlestone Classes, Revisited","created":"2025-09-30","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":"2604.04535","title":"Learning from Equivalence Queries, Revisited","created":"2026-04-06","cited_by_count":2,"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":"2606.06148","title":"Tight list replicability bounds via a novel sphere covering theorem","created":"2026-06-04","cited_by_count":1,"area":null},{"id":"2605.20434","title":"Expressivity of Contradiction Graphs","created":"2026-05-19","cited_by_count":0,"area":null}],"next_cursor":null}