{"total":49,"rows":[{"id":"2107.02237","title":"Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination","created":"2021-07-05","cited_by_count":53,"area":null},{"id":"2102.01046","title":"Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications","created":"2021-02-01","cited_by_count":52,"area":null},{"id":"2112.03432","title":"First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach","created":"2021-12-07","cited_by_count":38,"area":null},{"id":"2102.00236","title":"Parameter-free Stochastic Optimization of Variationally Coherent Functions","created":"2021-01-30","cited_by_count":27,"area":null},{"id":"2102.06622","title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","created":"2021-02-12","cited_by_count":26,"area":null},{"id":"2110.13282","title":"The Pareto Frontier of model selection for general Contextual Bandits","created":"2021-10-25","cited_by_count":24,"area":null},{"id":"2102.00968","title":"CRPS Learning","created":"2021-02-01","cited_by_count":21,"area":null},{"id":"2302.13849","title":"Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension","created":"2023-02-27","cited_by_count":18,"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":"2102.06593","title":"Pareto Optimal Model Selection in Linear Bandits","created":"2021-02-12","cited_by_count":14,"area":null},{"id":"2305.19674","title":"Online-to-PAC Conversions: Generalization Bounds via Regret Analysis","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","cited_by_count":11,"area":null},{"id":"2205.06846","title":"Optimal Comparator Adaptive Online Learning with Switching Cost","created":"2022-05-13","cited_by_count":9,"area":null},{"id":"2110.07881","title":"$k\\texttt{-experts}$ -- Online Policies and Fundamental Limits","created":"2021-10-15","cited_by_count":8,"area":null},{"id":"2110.14804","title":"Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers","created":"2021-10-27","cited_by_count":8,"area":null},{"id":"2206.00236","title":"Continuous Prediction with Experts' Advice","created":"2022-06-01","cited_by_count":7,"area":null},{"id":"2206.02656","title":"A Regret-Variance Trade-Off in Online Learning","created":"2022-06-06","cited_by_count":7,"area":null},{"id":"2210.09385","title":"Adaptive Oracle-Efficient Online Learning","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2304.05219","title":"BanditQ: Fair Bandits with Guaranteed Rewards","created":"2023-04-11","cited_by_count":6,"area":null},{"id":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","cited_by_count":5,"area":null},{"id":"2105.03681","title":"Universal Online Convex Optimization Meets Second-order Bounds","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2207.08956","title":"Online Learning with Off-Policy Feedback","created":"2022-07-18","cited_by_count":4,"area":null},{"id":"2402.09201","title":"Better-than-KL PAC-Bayes Bounds","created":"2024-02-14","cited_by_count":4,"area":null},{"id":"2104.02822","title":"Low-Regret Active learning","created":"2021-04-06","cited_by_count":3,"area":null},{"id":"2306.17151","title":"Local Risk Bounds for Statistical Aggregation","created":"2023-06-29","cited_by_count":3,"area":null},{"id":"2505.17277","title":"Comparator-Adaptive $\\Phi$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games","created":"2025-05-22","cited_by_count":2,"area":null},{"id":"2506.01722","title":"When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2512.12325","title":"Eventually LIL Regret: Almost Sure $\\ln\\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data","created":"2025-12-13","cited_by_count":2,"area":null},{"id":"2609.27206","title":"Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant","created":"2026-09-23","cited_by_count":2,"area":null},{"id":"2202.03621","title":"Bandit Sampling for Multiplex Networks","created":"2022-02-08","cited_by_count":1,"area":null},{"id":"2410.03363","title":"Minimax-optimal and Locally-adaptive Online Nonparametric Regression","created":"2024-10-04","cited_by_count":1,"area":null},{"id":"2501.08551","title":"A Theory of Optimistically Universal Online Learnability for General Concept Classes","created":"2025-01-15","cited_by_count":1,"area":null},{"id":"2505.19741","title":"Minimax Adaptive Online Nonparametric Regression over Besov Spaces","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2506.02980","title":"Non-stationary Bandit Convex Optimization: A Comprehensive Study","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2509.08911","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","created":"2025-09-10","cited_by_count":1,"area":null},{"id":"2602.11857","title":"Scale-Invariant Fast Convergence in Games","created":"2026-02-12","cited_by_count":1,"area":null},{"id":"2603.03409","title":"A Short Note on a Variant of the Squint Algorithm","created":"2026-03-03","cited_by_count":1,"area":null},{"id":"2605.05497","title":"Online Localized Conformal Prediction","created":"2026-05-06","cited_by_count":1,"area":null},{"id":"2605.30479","title":"Universal Multiclass Transductive Online Learning","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2109.11909","title":"Learning to maximize global influence from local observations","created":"2021-09-24","cited_by_count":0,"area":null},{"id":"2202.02406","title":"Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting","created":"2022-02-04","cited_by_count":0,"area":null},{"id":"2209.06826","title":"Modifying Squint for Prediction with Expert Advice in a Changing Environment","created":"2022-09-14","cited_by_count":0,"area":null},{"id":"2602.11747","title":"High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch","created":"2026-02-12","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":"2604.20172","title":"Cover meets Robbins while Betting on Bounded Data: $\\ln n$ Regret and Almost Sure $\\ln\\ln n$ Regret","created":"2026-04-22","cited_by_count":0,"area":null},{"id":"2604.26926","title":"A Note on How to Remove the $\\ln\\ln T$ Term from the Squint Bound","created":"2026-04-29","cited_by_count":0,"area":null},{"id":"2605.26919","title":"Agile Online Model Selection: Resolving Adaptation Lag via Safeguarded Large Learning Rates","created":"2026-05-26","cited_by_count":0,"area":null},{"id":"2606.14640","title":"Online Convex Optimization with Sublinear Noisy Probes","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2610.14904","title":"Prediction with Expert Advice under Heavy-Tailed Losses","created":"2026-10-10","cited_by_count":0,"area":null}],"next_cursor":null}