{"total":64,"rows":[{"id":"2304.09167","title":"Optimal PAC Bounds Without Uniform Convergence","created":"2023-04-18","cited_by_count":33,"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":"2211.04956","title":"A Characterization of List Learnability","created":"2022-11-07","cited_by_count":22,"area":null},{"id":"2303.17716","title":"Multiclass Online Learning and Uniform Convergence","created":"2023-03-30","cited_by_count":19,"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":"2209.07369","title":"Adversarially Robust Learning: A Generic Minimax Optimal Learner and Characterization","created":"2022-09-15","cited_by_count":17,"area":null},{"id":"2303.15383","title":"List Online Classification","created":"2023-03-27","cited_by_count":16,"area":null},{"id":"2309.13692","title":"Regularization and Optimal Multiclass Learning","created":"2023-09-24","cited_by_count":15,"area":null},{"id":"2210.02297","title":"Multiclass Learnability Beyond the PAC Framework: Universal Rates and Partial Concept Classes","created":"2022-10-05","cited_by_count":14,"area":null},{"id":"2311.06428","title":"A Trichotomy for Transductive Online Learning","created":"2023-11-10","cited_by_count":14,"area":null},{"id":"2402.09327","title":"Information Complexity of Stochastic Convex Optimization: Applications to Generalization and Memorization","created":"2024-02-14","cited_by_count":14,"area":null},{"id":"2308.04620","title":"Multiclass Online Learnability under Bandit Feedback","created":"2023-08-08","cited_by_count":12,"area":null},{"id":"2212.09270","title":"The One-Inclusion Graph Algorithm is not Always Optimal","created":"2022-12-19","cited_by_count":11,"area":null},{"id":"2307.00642","title":"Multiclass Boosting: Simple and Intuitive Weak Learning Criteria","created":"2023-07-02","cited_by_count":11,"area":null},{"id":"2604.24749","title":"The Optimal Sample Complexity of Multiclass and List Learning","created":"2026-04-27","cited_by_count":11,"area":null},{"id":"2403.10889","title":"List Sample Compression and Uniform Convergence","created":"2024-03-16","cited_by_count":10,"area":null},{"id":"2310.06113","title":"When is Agnostic Reinforcement Learning Statistically Tractable?","created":"2023-10-09","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":"2211.09101","title":"Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes","created":"2022-11-16","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":"2308.06424","title":"Multiclass Learnability Does Not Imply Sample Compression","created":"2023-08-12","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":"2409.19218","title":"A Characterization of List Regression","created":"2024-09-28","cited_by_count":6,"area":null},{"id":"2605.08866","title":"Tight Generalization Bounds for Noiseless Inverse Optimization","created":"2026-05-09","cited_by_count":6,"area":null},{"id":"2204.04670","title":"Active Learning with Label Comparisons","created":"2022-04-10","cited_by_count":5,"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":"2405.05190","title":"Is Transductive Learning Equivalent to PAC Learning?","created":"2024-05-08","cited_by_count":4,"area":null},{"id":"2502.09257","title":"From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards","created":"2025-02-13","cited_by_count":4,"area":null},{"id":"2601.02193","title":"Learning with Monotone Adversarial Corruptions","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2604.12952","title":"An Optimal Sauer Lemma Over $k$-ary Alphabets","created":"2026-04-14","cited_by_count":4,"area":null},{"id":"2302.07409","title":"Quantum Learning Theory Beyond Batch Binary Classification","created":"2023-02-15","cited_by_count":3,"area":null},{"id":"2410.22749","title":"Understanding Aggregations of Proper Learners in Multiclass Classification","created":"2024-10-30","cited_by_count":3,"area":null},{"id":"2602.17577","title":"Simultaneous Blackwell Approachability and Applications to Multiclass Omniprediction","created":"2026-02-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":"2402.10360","title":"Transductive Learning Is Compact","created":"2024-02-15","cited_by_count":2,"area":null},{"id":"2405.15424","title":"Smoothed Online Classification can be Harder than Batch Classification","created":"2024-05-24","cited_by_count":2,"area":null},{"id":"2410.13012","title":"Sample Compression Scheme Reductions","created":"2024-10-16","cited_by_count":2,"area":null},{"id":"2502.10359","title":"Proper Learnability and the Role of Unlabeled Data","created":"2025-02-14","cited_by_count":2,"area":null},{"id":"2504.09006","title":"Learning in Structured Stackelberg Games","created":"2025-04-11","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":"2506.14746","title":"On the Hardness of Bandit Learning","created":"2025-06-17","cited_by_count":2,"area":null},{"id":"2605.25678","title":"PAC Learning with Bandit Feedback: Sharp Sample Complexity in the Realizable Setting","created":"2026-05-25","cited_by_count":2,"area":null},{"id":"2607.23449","title":"Local Regularization Does Not Characterize Multiclass PAC Learnability","created":"2026-07-26","cited_by_count":2,"area":null},{"id":"2402.06614","title":"The Complexity of Sequential Prediction in Dynamical Systems","created":"2024-02-09","cited_by_count":1,"area":null},{"id":"2502.00607","title":"PAC Learning is just Bipartite Matching (Sort of)","created":"2025-02-02","cited_by_count":1,"area":null},{"id":"2502.06089","title":"On the Computability of Multiclass PAC Learning","created":"2025-02-10","cited_by_count":1,"area":null},{"id":"2605.29645","title":"The Sample Complexity of Multiclass and Sparse Contextual Bandits","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2605.30479","title":"Universal Multiclass Transductive Online Learning","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2308.10041","title":"Computing the Vapnik Chervonenkis Dimension for Non-Discrete Settings","created":"2023-08-19","cited_by_count":0,"area":null},{"id":"2505.15688","title":"A packing lemma for VCN${}_k$-dimension and learning high-dimensional data","created":"2025-05-21","cited_by_count":0,"area":null},{"id":"2509.20618","title":"A Gapped Scale-Sensitive Dimension and Lower Bounds for Offset Rademacher Complexity","created":"2025-09-24","cited_by_count":0,"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":"2602.11920","title":"Learning Conditional Averages","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2602.18866","title":"$(\\alpha,\\beta)$-Stability for Boosting Vector-Valued Prediction","created":"2026-02-21","cited_by_count":0,"area":null},{"id":"2605.03823","title":"Realizable Bayes-Consistency for General Metric Losses","created":"2026-05-05","cited_by_count":0,"area":null},{"id":"2605.29819","title":"The Interplay Between Interpolation and Aggregation in Regression: Optimal Sample Complexity","created":"2026-05-28","cited_by_count":0,"area":null},{"id":"2608.10869","title":"Optimistic Rates for Multiclass PAC Learning","created":"2026-08-11","cited_by_count":0,"area":null},{"id":"2608.20480","title":"When Clean Data Hurts: Learning with Monotone Corruptions Beyond Binary Classification","created":"2026-08-20","cited_by_count":0,"area":null},{"id":"2608.25326","title":"Two Dimensions Govern Agnostic Multiclass Transductive Learning","created":"2026-08-26","cited_by_count":0,"area":null},{"id":"2608.26516","title":"Algorithmic Principles For Multiclass Learning Are Hard To Come By: Limits of Regularization and Proper Learning","created":"2026-08-27","cited_by_count":0,"area":null},{"id":"2608.29503","title":"Adversarial Online Classification with a Preview","created":"2026-08-30","cited_by_count":0,"area":null},{"id":"2609.29694","title":"Bandit Multiclass PAC Learning: Corrected Lower Bounds, Exact Families, and a Confidence Direct-Sum Phenomenon","created":"2026-08-31","cited_by_count":0,"area":null},{"id":"2609.31643","title":"Information Design Against Gaming and Learning Adversaries","created":"2026-09-12","cited_by_count":0,"area":null}],"next_cursor":null}