{"total":57,"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":"2202.07554","title":"Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness","created":"2022-02-15","cited_by_count":21,"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":"2207.07974","title":"Online Prediction in Sub-linear Space","created":"2022-07-16","cited_by_count":16,"area":null},{"id":"2302.10805","title":"Repeated Bilateral Trade Against a Smoothed Adversary","created":"2023-02-21","cited_by_count":15,"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":"2307.09478","title":"The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations","created":"2023-07-14","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":"2111.10352","title":"On the power of adaptivity in statistical adversaries","created":"2021-11-19","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":"2306.13119","title":"Adversarial Resilience in Sequential Prediction via Abstention","created":"2023-06-22","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":"2206.09642","title":"Beyond IID: data-driven decision-making in heterogeneous environments","created":"2022-06-20","cited_by_count":9,"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":"2211.09101","title":"Comparative Learning: A Sample Complexity Theory for Two Hypothesis Classes","created":"2022-11-16","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":"2210.09385","title":"Adaptive Oracle-Efficient Online Learning","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2303.03272","title":"Accelerated Rates between Stochastic and Adversarial Online Convex Optimization","created":"2023-03-06","cited_by_count":7,"area":null},{"id":"2303.04845","title":"Smoothed Analysis of Sequential Probability Assignment","created":"2023-03-08","cited_by_count":7,"area":null},{"id":"2509.22563","title":"Nearly Tight Regret Bounds for Profit Maximization in Bilateral Trade","created":"2025-09-26","cited_by_count":7,"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":"2409.07819","title":"Selling Joint Ads: A Regret Minimization Perspective","created":"2024-09-12","cited_by_count":5,"area":null},{"id":"2411.13993","title":"Market Making without Regret","created":"2024-11-21","cited_by_count":5,"area":null},{"id":"2401.15520","title":"Oracle-Efficient Hybrid Online Learning with Unknown Distribution","created":"2024-01-27","cited_by_count":4,"area":null},{"id":"2402.08062","title":"Avoiding Catastrophe in Online Learning by Asking for Help","created":"2024-02-12","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":"2601.02193","title":"Learning with Monotone Adversarial Corruptions","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2309.12226","title":"Smooth Nash Equilibria: Algorithms and Complexity","created":"2023-09-21","cited_by_count":3,"area":null},{"id":"2312.04653","title":"Learning Thresholds with Latent Values and Censored Feedback","created":"2023-12-07","cited_by_count":3,"area":null},{"id":"2504.10428","title":"Smoothed Analysis of Learning from Positive Samples","created":"2025-04-14","cited_by_count":3,"area":null},{"id":"2506.00764","title":"Learning Juntas under Markov Random Fields","created":"2025-06-01","cited_by_count":3,"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":"2302.14248","title":"Time-uniform confidence bands for the CDF under nonstationarity","created":"2023-02-28","cited_by_count":2,"area":null},{"id":"2406.05959","title":"MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation","created":"2024-06-10","cited_by_count":2,"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":"2504.09006","title":"Learning in Structured Stackelberg Games","created":"2025-04-11","cited_by_count":2,"area":null},{"id":"2504.10598","title":"Beyond Worst-Case Online Classification: VC-Based Regret Bounds for Relaxed Benchmarks","created":"2025-04-14","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":"2312.16860","title":"Agnostic Interactive Imitation Learning: New Theory and Practical Algorithms","created":"2023-12-28","cited_by_count":1,"area":"offlinerl"},{"id":"2502.00823","title":"Online Learning of Pure States is as Hard as Mixed States","created":"2025-02-02","cited_by_count":1,"area":null},{"id":"2502.14043","title":"Safe Learning Under Irreversible Dynamics via Asking for Help","created":"2025-02-19","cited_by_count":1,"area":null},{"id":"2602.17918","title":"Distribution-Free Sequential Prediction with Abstentions","created":"2026-02-20","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.01628","title":"Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression","created":"2026-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":"2605.12664","title":"Profit Maximization in Bilateral Trade against a Smooth Adversary","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2307.01170","title":"Online nearest neighbor classification","created":"2023-07-03","cited_by_count":0,"area":null},{"id":"2402.17720","title":"The SMART approach to instance-optimal online learning","created":"2024-02-27","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":"2603.22348","title":"Learning Safely Without Knowing the World:COMPASS-Hedge","created":"2026-03-22","cited_by_count":0,"area":null},{"id":"2605.10475","title":"Regret Minimization in Bilateral Trade With Perturbed Markets","created":"2026-05-11","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.32478","title":"Agnostic Smoothed Online Regression with Adversarial Responses","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}