{"total":25,"rows":[{"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":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"area":null},{"id":"2112.12181","title":"Simple and near-optimal algorithms for hidden stratification and multi-group learning","created":"2021-12-22","cited_by_count":28,"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":"2202.07552","title":"A Theory of PAC Learnability under Transformation Invariances","created":"2022-02-15","cited_by_count":21,"area":null},{"id":"2309.13692","title":"Regularization and Optimal Multiclass Learning","created":"2023-09-24","cited_by_count":15,"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":"2211.09101","title":"Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes","created":"2022-11-16","cited_by_count":8,"area":null},{"id":"2203.04536","title":"Metric Entropy Duality and the Sample Complexity of Outcome Indistinguishability","created":"2022-03-09","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":"2302.06005","title":"Near-optimal learning with average H\\\"older smoothness","created":"2023-02-12","cited_by_count":4,"area":null},{"id":"2304.08712","title":"Impossibility of Characterizing Distribution Learning -- a simple solution to a long-standing problem","created":"2023-04-18","cited_by_count":4,"area":null},{"id":"2406.17814","title":"Distribution Learnability and Robustness","created":"2024-06-25","cited_by_count":4,"area":null},{"id":"2602.09402","title":"Learning with Multiple Correct Answers -- Regret Bounds under Different Feedback Models","created":"2026-02-10","cited_by_count":4,"area":null},{"id":"2302.06285","title":"Do PAC-Learners Learn the Marginal Distribution?","created":"2023-02-13","cited_by_count":3,"area":null},{"id":"2506.16651","title":"A Distributional-Lifting Theorem for PAC Learning","created":"2025-06-19","cited_by_count":3,"area":null},{"id":"2301.02729","title":"A Characterization of Multioutput Learnability","created":"2023-01-06","cited_by_count":2,"area":null},{"id":"2304.03337","title":"On the Learnability of Multilabel Ranking","created":"2023-04-06","cited_by_count":2,"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":"2503.09384","title":"Revisiting Agnostic Boosting","created":"2025-03-12","cited_by_count":2,"area":null},{"id":"2309.17016","title":"Efficient Agnostic Learning with Average Smoothness","created":"2023-09-29","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":"2604.02555","title":"Robust Learning with Optimal Error","created":"2026-04-02","cited_by_count":1,"area":null},{"id":"2510.08382","title":"Characterizing the Multiclass Learnability of Forgiving 0-1 Loss Functions","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2609.24260","title":"Adversarially Robust PAC Learning with Optimal VC Rates","created":"2026-09-21","cited_by_count":0,"area":null}],"next_cursor":null}