{"total":23,"rows":[{"id":"2109.02224","title":"On Empirical Risk Minimization with Dependent and Heavy-Tailed Data","created":"2021-09-06","cited_by_count":16,"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":"2201.05947","title":"Universal Online Learning: an Optimistically Universal Learning Rule","created":"2022-01-16","cited_by_count":12,"area":null},{"id":"2206.09642","title":"Beyond IID: data-driven decision-making in heterogeneous environments","created":"2022-06-20","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":"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":"2203.06046","title":"Universally Consistent Online Learning with Arbitrarily Dependent Responses","created":"2022-03-11","cited_by_count":6,"area":null},{"id":"2203.05067","title":"Universal Regression with Adversarial Responses","created":"2022-03-09","cited_by_count":5,"area":null},{"id":"2406.06101","title":"On the Consistency of Kernel Methods with Dependent Observations","created":"2024-06-10","cited_by_count":4,"area":null},{"id":"2411.00109","title":"Prospective Learning: Learning for a Dynamic Future","created":"2024-10-31","cited_by_count":4,"area":null},{"id":"2202.03045","title":"Metric-valued regression","created":"2022-02-07","cited_by_count":3,"area":null},{"id":"2301.00241","title":"Contextual Bandits and Optimistically Universal Learning","created":"2022-12-31","cited_by_count":2,"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":"2602.20585","title":"Characterizing Online and Private Learnability under Distributional Constraints via Generalized Smoothness","created":"2026-02-24","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":"2202.07365","title":"A Statistical Learning View of Simple Kriging","created":"2022-02-15","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":"2410.23644","title":"Online Consistency of the Nearest Neighbor Rule","created":"2024-10-31","cited_by_count":0,"area":null},{"id":"2510.10744","title":"How Patterns Dictate Learnability in Sequential Data","created":"2025-10-12","cited_by_count":0,"area":null}],"next_cursor":null}