{"total":16,"rows":[{"id":"2202.04690","title":"Smoothed Online Learning is as Easy as Statistical Learning","created":"2022-02-09","cited_by_count":52,"area":null},{"id":"2310.19647","title":"Fast swap regret minimization and applications to approximate correlated equilibria","created":"2023-10-30","cited_by_count":32,"area":null},{"id":"2206.08742","title":"Near-Optimal No-Regret Learning Dynamics for General Convex Games","created":"2022-06-17","cited_by_count":25,"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":"2307.01689","title":"Online Learning and Solving Infinite Games with an ERM Oracle","created":"2023-07-04","cited_by_count":11,"area":null},{"id":"2306.06247","title":"Online Learning with Set-Valued Feedback","created":"2023-06-09","cited_by_count":7,"area":null},{"id":"2208.09747","title":"Near-Optimal $\\Phi$-Regret Learning in Extensive-Form Games","created":"2022-08-20","cited_by_count":3,"area":null},{"id":"2608.31166","title":"Constant Individual Regret in General Games","created":"2026-08-31","cited_by_count":3,"area":null},{"id":"2304.03321","title":"Adaptive Decision-Making with Constraints and Dependent Losses: Performance Guarantees and Applications to Online and Nonlinear Identification","created":"2023-04-06","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":"2601.21462","title":"Partial Feedback Online Learning","created":"2026-01-29","cited_by_count":2,"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":"2411.01721","title":"Computational Lower Bounds for Regret Minimization in Normal-Form Games","created":"2024-11-04","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":"2607.21761","title":"Encoding orders and trees in real-valued functions","created":"2026-07-23","cited_by_count":0,"area":null},{"id":"2609.21445","title":"Optimal Randomized Proper Online Learning","created":"2026-09-18","cited_by_count":0,"area":null}],"next_cursor":null}