{"total":22,"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.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"area":null},{"id":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","cited_by_count":10,"area":null},{"id":"2505.22049","title":"Differentiable Generalized Sliced Wasserstein Plans","created":"2025-05-28","cited_by_count":7,"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":"2608.26288","title":"Muon with Finite Newton-Schulz: The Smoothing Benefit in Nonsmooth Nonconvex Optimization","created":"2026-08-26","cited_by_count":5,"area":null},{"id":"2205.12751","title":"Fast Stochastic Composite Minimization and an Accelerated Frank-Wolfe Algorithm under Parallelization","created":"2022-05-25","cited_by_count":4,"area":null},{"id":"2505.13564","title":"Online Decision-Focused Learning","created":"2025-05-19","cited_by_count":4,"area":null},{"id":"2409.20440","title":"Optimism in the Face of Ambiguity Principle for Multi-Armed Bandits","created":"2024-09-30","cited_by_count":3,"area":null},{"id":"2508.18604","title":"Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems","created":"2025-08-26","cited_by_count":3,"area":null},{"id":"2205.03820","title":"Some performance considerations when using multi-armed bandit algorithms in the presence of missing data","created":"2022-05-08","cited_by_count":1,"area":null},{"id":"2303.06851","title":"On the Regret of Online Edge Service Hosting","created":"2023-03-13","cited_by_count":1,"area":null},{"id":"2503.02758","title":"Efficient and Optimal No-Regret Caching under Partial Observation","created":"2025-03-04","cited_by_count":1,"area":null},{"id":"2510.24187","title":"Self-Concordant Perturbations for Linear Bandits","created":"2025-10-28","cited_by_count":1,"area":null},{"id":"2105.12697","title":"Structural Causal Models Reveal Confounder Bias in Linear Program Modelling","created":"2021-05-26","cited_by_count":0,"area":null},{"id":"2406.02180","title":"On The Statistical Representation Properties Of The Perturb-Softmax And The Perturb-Argmax Probability Distributions","created":"2024-06-04","cited_by_count":0,"area":null},{"id":"2409.12387","title":"On the Regret of Coded Caching with Adversarial Requests","created":"2024-09-19","cited_by_count":0,"area":null},{"id":"2502.14790","title":"Bayesian Algorithms for Adversarial Online Learning: from Finite to Infinite Action Spaces","created":"2025-02-20","cited_by_count":0,"area":null},{"id":"2504.03499","title":"Optimistic Learning for Communication Networks","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2512.06971","title":"Prediction with Expert Advice under Local Differential Privacy","created":"2025-12-07","cited_by_count":0,"area":null},{"id":"2607.24007","title":"Smooth Learning with Hard Constraints via Legendre-Regularized Policies","created":"2026-07-27","cited_by_count":0,"area":null},{"id":"2610.17818","title":"Follow the Perturbed Leader for Linear Bandits: $\\sqrt{T}$ Regret over General Convex Sets","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}