{"total":36,"rows":[{"id":"2102.08446","title":"Smoothed Analysis with Adaptive Adversaries","created":"2021-02-16","cited_by_count":57,"area":null},{"id":"2202.04690","title":"Smoothed Online Learning is as Easy as Statistical Learning","created":"2022-02-09","cited_by_count":52,"area":null},{"id":"2102.11050","title":"Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization","created":"2021-02-18","cited_by_count":40,"area":null},{"id":"2307.08999","title":"Oracle Efficient Online Multicalibration and Omniprediction","created":"2023-07-18","cited_by_count":37,"area":null},{"id":"2202.08549","title":"Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries","created":"2022-02-17","cited_by_count":21,"area":null},{"id":"2309.00814","title":"Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits","created":"2023-09-02","cited_by_count":19,"area":null},{"id":"2111.08911","title":"Fast Rates for Nonparametric Online Learning: From Realizability to Learning in Games","created":"2021-11-17","cited_by_count":16,"area":null},{"id":"2207.07974","title":"Online Prediction in Sub-linear Space","created":"2022-07-16","cited_by_count":16,"area":null},{"id":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2302.04658","title":"The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning","created":"2023-02-09","cited_by_count":13,"area":null},{"id":"2402.14987","title":"On the Performance of Empirical Risk Minimization with Smoothed Data","created":"2024-02-22","cited_by_count":13,"area":null},{"id":"2102.09305","title":"Boosting for Online Convex Optimization","created":"2021-02-18","cited_by_count":11,"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":"2205.13056","title":"Efficient and Near-Optimal Smoothed Online Learning for Generalized Linear Functions","created":"2022-05-25","cited_by_count":10,"area":null},{"id":"2301.11187","title":"Smoothed Online Learning for Prediction in Piecewise Affine Systems","created":"2023-01-26","cited_by_count":9,"area":null},{"id":"2406.05287","title":"Group-wise oracle-efficient algorithms for online multi-group learning","created":"2024-06-07","cited_by_count":9,"area":null},{"id":"2210.09385","title":"Adaptive Oracle-Efficient Online Learning","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2312.04792","title":"Playing Large Games with Oracles and AI Debate","created":"2023-12-08","cited_by_count":6,"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.05430","title":"Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making","created":"2023-02-10","cited_by_count":5,"area":null},{"id":"2603.04546","title":"Oracle-efficient Hybrid Learning with Constrained Adversaries","created":"2026-03-04","cited_by_count":3,"area":null},{"id":"2609.33760","title":"Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs","created":"2026-09-27","cited_by_count":3,"area":null},{"id":"2106.11943","title":"Reusing Combinatorial Structure: Faster Iterative Projections over Submodular Base Polytopes","created":"2021-06-22","cited_by_count":2,"area":null},{"id":"2304.12768","title":"Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games","created":"2023-04-25","cited_by_count":2,"area":null},{"id":"2310.19025","title":"An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits","created":"2023-10-29","cited_by_count":2,"area":null},{"id":"2506.00135","title":"Tradeoffs between Mistakes and ERM Oracle Calls in Online and Transductive Online Learning","created":"2025-05-30","cited_by_count":2,"area":null},{"id":"2106.04336","title":"Efficient Online Learning for Dynamic k-Clustering","created":"2021-06-08","cited_by_count":1,"area":null},{"id":"2106.05492","title":"Learning to Play General-Sum Games Against Multiple Boundedly Rational Agents","created":"2021-06-10","cited_by_count":1,"area":null},{"id":"2405.01263","title":"An Online Gradient-Based Caching Policy with Logarithmic Complexity and Regret Guarantees","created":"2024-05-02","cited_by_count":1,"area":null},{"id":"2605.07155","title":"Regret-Oracle Complexity Tradeoffs in Agnostic Online Learning","created":"2026-05-08","cited_by_count":1,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2505.17365","title":"Improved and Oracle-Efficient Online $\\ell_1$-Multicalibration","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2510.03845","title":"The Hidden Game Problem","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2511.12523","title":"Perturbing Best Responses in Zero-Sum Games","created":"2025-11-16","cited_by_count":0,"area":null},{"id":"2606.02948","title":"From Non-Convex to Strongly Convex: Curvature-Adaptive FTPL for Online Optimization","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2610.15916","title":"Sample-Optimal Multi-Group Learning with an ERM Oracle","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}