{"total":46,"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":"2101.09054","title":"Adversarial Laws of Large Numbers and Optimal Regret in Online Classification","created":"2021-01-22","cited_by_count":39,"area":null},{"id":"2209.07400","title":"Private Synthetic Data for Multitask Learning and Marginal Queries","created":"2022-09-15","cited_by_count":35,"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":"2302.10805","title":"Repeated Bilateral Trade Against a Smoothed Adversary","created":"2023-02-21","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":"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":"2102.07171","title":"Private learning implies quantum stability","created":"2021-02-14","cited_by_count":10,"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":"2302.07426","title":"Computational Complexity of Learning Neural Networks: Smoothness and Degeneracy","created":"2023-02-15","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":"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":"2303.04845","title":"Smoothed Analysis of Sequential Probability Assignment","created":"2023-03-08","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":"2405.14066","title":"Online Classification with Predictions","created":"2024-05-22","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":"2302.07409","title":"Quantum Learning Theory Beyond Batch Binary Classification","created":"2023-02-15","cited_by_count":3,"area":null},{"id":"2309.12226","title":"Smooth Nash Equilibria: Algorithms and Complexity","created":"2023-09-21","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":"2305.13440","title":"Differentially Private Medians and Interior Points for Non-Pathological Data","created":"2023-05-22","cited_by_count":2,"area":null},{"id":"2405.15424","title":"Smoothed Online Classification can be Harder than Batch Classification","created":"2024-05-24","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":"2103.00075","title":"Noisy Truncated SGD: Optimization and Generalization","created":"2021-02-26","cited_by_count":1,"area":null},{"id":"2107.01559","title":"Smoothed Differential Privacy","created":"2021-07-04","cited_by_count":1,"area":null},{"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":"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.12664","title":"Profit Maximization in Bilateral Trade against a Smooth Adversary","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2111.10048","title":"Uniform Brackets, Containers, and Combinatorial Macbeath Regions","created":"2021-11-19","cited_by_count":0,"area":null},{"id":"2212.04216","title":"Differentially-Private Bayes Consistency","created":"2022-12-08","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":"2309.01698","title":"Robust Online Classification: From Estimation to Denoising","created":"2023-09-04","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.03917","title":"Transductive and Learning-Augmented Online Regression","created":"2025-10-04","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}