{"total":59,"rows":[{"id":"2209.06640","title":"Revisiting Neural Scaling Laws in Language and Vision","created":"2022-09-13","cited_by_count":132,"area":null},{"id":"2103.10948","title":"The Shape of Learning Curves: a Review","created":"2021-03-19","cited_by_count":70,"area":null},{"id":"2411.15364","title":"Exploring Facets of Language Generation in the Limit","created":"2024-11-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":"2211.04956","title":"A Characterization of List Learnability","created":"2022-11-07","cited_by_count":22,"area":null},{"id":"2505.21819","title":"Representative Language Generation","created":"2025-05-27","cited_by_count":19,"area":null},{"id":"2305.14311","title":"Statistical Indistinguishability of Learning Algorithms","created":"2023-05-23","cited_by_count":17,"area":null},{"id":"2510.05197","title":"Efficient Prediction of Pass@k Scaling in Large Language Models","created":"2025-10-06","cited_by_count":16,"area":null},{"id":"2110.12231","title":"Learning curves for Gaussian process regression with power-law priors and targets","created":"2021-10-23","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":"2412.18530","title":"On Characterizations for Language Generation: Interplay of Hallucinations, Breadth, and Stability","created":"2024-12-24","cited_by_count":14,"area":null},{"id":"2201.05947","title":"Universal Online Learning: an Optimistically Universal Learning Rule","created":"2022-01-16","cited_by_count":12,"area":null},{"id":"2209.04417","title":"Expected Worst Case Regret via Stochastic Sequential Covering","created":"2022-09-09","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":"2306.11475","title":"Delegated Classification","created":"2023-06-20","cited_by_count":10,"area":null},{"id":"2202.05246","title":"Monotone Learning","created":"2022-02-10","cited_by_count":9,"area":null},{"id":"2112.14638","title":"Universal Online Learning with Bounded Loss: Reduction to Binary Classification","created":"2021-12-29","cited_by_count":8,"area":null},{"id":"2201.08903","title":"Universal Online Learning with Unbounded Losses: Memory Is All You Need","created":"2022-01-21","cited_by_count":8,"area":null},{"id":"2302.00103","title":"Online Learning in Dynamically Changing Environments","created":"2023-01-31","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":"2208.14615","title":"Fine-Grained Distribution-Dependent Learning Curves","created":"2022-08-31","cited_by_count":7,"area":null},{"id":"2406.10529","title":"A Theory of Interpretable Approximations","created":"2024-06-15","cited_by_count":7,"area":null},{"id":"2107.09542","title":"Open Problem: Is There an Online Learning Algorithm That Learns Whenever Online Learning Is Possible?","created":"2021-07-20","cited_by_count":6,"area":null},{"id":"2308.08055","title":"Simple online learning with consistent oracle","created":"2023-08-15","cited_by_count":5,"area":null},{"id":"2312.13842","title":"Statistical learning theory and Occam's razor: The core argument","created":"2023-12-21","cited_by_count":5,"area":null},{"id":"2512.19410","title":"Research Program: Theory of Learning in Dynamical Systems","created":"2025-12-22","cited_by_count":5,"area":null},{"id":"2106.01382","title":"From Undecidability of Non-Triviality and Finiteness to Undecidability of Learnability","created":"2021-06-02","cited_by_count":4,"area":null},{"id":"2111.05321","title":"Turing-Universal Learners with Optimal Scaling Laws","created":"2021-11-09","cited_by_count":4,"area":null},{"id":"2210.04817","title":"Do you pay for Privacy in Online learning?","created":"2022-10-10","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":"2305.10540","title":"Generalization Bounds for Neural Belief Propagation Decoders","created":"2023-05-17","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":"2601.23258","title":"Agnostic Language Identification and Generation","created":"2026-01-30","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":"2412.02810","title":"Universal Rates of Empirical Risk Minimization","created":"2024-12-03","cited_by_count":3,"area":null},{"id":"2410.19217","title":"No Free Lunch: Fundamental Limits of Learning Non-Hallucinating Generative Models","created":"2024-10-24","cited_by_count":2,"area":null},{"id":"2506.03075","title":"Agnostic Learning under Targeted Poisoning: Optimal Rates and the Role of Randomness","created":"2025-06-03","cited_by_count":2,"area":null},{"id":"2509.23963","title":"Evaluating the Robustness of Chinchilla Compute-Optimal Scaling","created":"2025-09-28","cited_by_count":2,"area":null},{"id":"2512.12567","title":"Optimal Mistake Bounds for Transductive Online Learning","created":"2025-12-14","cited_by_count":2,"area":null},{"id":"2411.17898","title":"On the ERM Principle in Meta-Learning","created":"2024-11-26","cited_by_count":1,"area":null},{"id":"2501.08551","title":"A Theory of Optimistically Universal Online Learnability for General Concept Classes","created":"2025-01-15","cited_by_count":1,"area":null},{"id":"2506.14110","title":"Universal rates of ERM for agnostic learning","created":"2025-06-17","cited_by_count":1,"area":null},{"id":"2510.18352","title":"Computable universal online learning","created":"2025-10-21","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":"2212.04216","title":"Differentially-Private Bayes Consistency","created":"2022-12-08","cited_by_count":0,"area":null},{"id":"2304.13479","title":"Fundamental Tradeoffs in Learning with Prior Information","created":"2023-04-26","cited_by_count":0,"area":null},{"id":"2307.01170","title":"Online nearest neighbor classification","created":"2023-07-03","cited_by_count":0,"area":null},{"id":"2312.00170","title":"When Is Inductive Inference Possible?","created":"2023-11-30","cited_by_count":0,"area":null},{"id":"2405.00792","title":"Error Exponent in Agnostic PAC Learning","created":"2024-05-01","cited_by_count":0,"area":null},{"id":"2510.07245","title":"Discriminative Feature Feedback with General Teacher Classes","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2604.25028","title":"Null Measurability at the Symmetrization Interface in VC Learning","created":"2026-04-27","cited_by_count":0,"area":null},{"id":"2604.26922","title":"On the Learning Curves of Revenue Maximization","created":"2026-04-29","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":"2606.28309","title":"Surprises in Proper Positive-Only Learning","created":"2026-06-26","cited_by_count":0,"area":null},{"id":"2608.08414","title":"Constrained Learning with Universally Learnable Concept Classes","created":"2026-08-09","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":"2609.28551","title":"An Order-Theoretic Characterization of Consistent Inductive Inference","created":"2026-09-23","cited_by_count":0,"area":null},{"id":"2609.29530","title":"The Impossible Trinity of Time-Series Validation: A Conservation Law among Training Sufficiency, Test Coverage, and Temporal Causality","created":"2026-09-02","cited_by_count":0,"area":null}],"next_cursor":null}