{"total":70,"rows":[{"id":"2106.06885","title":"Online Learning with Optimism and Delay","created":"2021-06-13","cited_by_count":33,"area":null},{"id":"2101.08534","title":"Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback","created":"2021-01-21","cited_by_count":21,"area":null},{"id":"2109.10963","title":"On Optimal Robustness to Adversarial Corruption in Online Decision Problems","created":"2021-09-22","cited_by_count":21,"area":null},{"id":"2103.07780","title":"Online Double Oracle","created":"2021-03-13","cited_by_count":18,"area":null},{"id":"2201.11921","title":"Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits","created":"2022-01-28","cited_by_count":18,"area":null},{"id":"2110.15573","title":"A/B/n Testing with Control in the Presence of Subpopulations","created":"2021-10-29","cited_by_count":17,"area":null},{"id":"2102.09540","title":"Off-policy Confidence Sequences","created":"2021-02-18","cited_by_count":15,"area":null},{"id":"2106.04700","title":"Scale Free Adversarial Multi Armed Bandits","created":"2021-06-08","cited_by_count":12,"area":null},{"id":"2111.01479","title":"Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification","created":"2021-11-02","cited_by_count":12,"area":null},{"id":"2206.06810","title":"Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds","created":"2022-06-14","cited_by_count":12,"area":null},{"id":"2303.06825","title":"Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm","created":"2023-03-13","cited_by_count":12,"area":null},{"id":"2403.00715","title":"Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds","created":"2024-03-01","cited_by_count":11,"area":null},{"id":"2403.15527","title":"Conformal online model aggregation","created":"2024-03-22","cited_by_count":11,"area":null},{"id":"2505.18659","title":"Adaptive Prediction-Powered AutoEval with Reliability and Efficiency Guarantees","created":"2025-05-24","cited_by_count":11,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","cited_by_count":10,"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.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":"2301.10500","title":"Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning","created":"2023-01-25","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":"2202.04732","title":"Online Learning to Transport via the Minimal Selection Principle","created":"2022-02-09","cited_by_count":6,"area":null},{"id":"2409.07902","title":"Conformal Distributed Remote Inference in Sensor Networks Under Reliability and Communication Constraints","created":"2024-09-12","cited_by_count":6,"area":null},{"id":"2105.13203","title":"Conic Blackwell Algorithm: Parameter-Free Convex-Concave Saddle-Point Solving","created":"2021-05-27","cited_by_count":5,"area":null},{"id":"2405.11548","title":"Adaptive Online Experimental Design for Causal Discovery","created":"2024-05-19","cited_by_count":5,"area":null},{"id":"2506.20173","title":"Valid Selection among Conformal Sets","created":"2025-06-25","cited_by_count":5,"area":null},{"id":"2511.02276","title":"Gradient-Variation Online Adaptivity for Accelerated Optimization with H\\\"older Smoothness","created":"2025-11-04","cited_by_count":5,"area":null},{"id":"2107.01881","title":"Robust Online Convex Optimization in the Presence of Outliers","created":"2021-07-05","cited_by_count":4,"area":null},{"id":"2112.14586","title":"Isotuning With Applications To Scale-Free Online Learning","created":"2021-12-29","cited_by_count":4,"area":null},{"id":"2202.12277","title":"Solving optimization problems with Blackwell approachability","created":"2022-02-24","cited_by_count":4,"area":null},{"id":"2510.01867","title":"Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization","created":"2025-10-02","cited_by_count":4,"area":null},{"id":"2104.06050","title":"Sequential Ski Rental Problem","created":"2021-04-13","cited_by_count":3,"area":null},{"id":"2310.01756","title":"Improved Algorithms for Adversarial Bandits with Unbounded Losses","created":"2023-10-03","cited_by_count":3,"area":null},{"id":"2310.06069","title":"Optimal Exploration is no harder than Thompson Sampling","created":"2023-10-09","cited_by_count":3,"area":null},{"id":"2405.20028","title":"A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2205.14519","title":"Online Learning with Bounded Recall","created":"2022-05-28","cited_by_count":2,"area":null},{"id":"2310.16473","title":"Policy Optimization via Adv2: Adversarial Learning on Advantage Functions","created":"2023-10-25","cited_by_count":2,"area":null},{"id":"2403.00930","title":"Scale-free Adversarial Reinforcement Learning","created":"2024-03-01","cited_by_count":2,"area":"deeprl"},{"id":"2504.07307","title":"Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems","created":"2025-04-09","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":"2506.08127","title":"Constrained Pareto Set Identification with Bandit Feedback","created":"2025-06-09","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":"2104.01830","title":"Model Compression for Dynamic Forecast Combination","created":"2021-04-05","cited_by_count":1,"area":null},{"id":"2106.12688","title":"Best-Case Lower Bounds in Online Learning","created":"2021-06-23","cited_by_count":1,"area":null},{"id":"2110.13400","title":"Scale-Free Adversarial Multi-Armed Bandit with Arbitrary Feedback Delays","created":"2021-10-26","cited_by_count":1,"area":null},{"id":"2206.04456","title":"Choosing Answers in $\\varepsilon$-Best-Answer Identification for Linear Bandits","created":"2022-06-09","cited_by_count":1,"area":null},{"id":"2302.04182","title":"Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2309.02055","title":"No-Regret Caching with Noisy Request Estimates","created":"2023-09-05","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":"2406.14059","title":"Tracking solutions of time-varying variational inequalities","created":"2024-06-20","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":"2506.02386","title":"Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2604.11151","title":"Gradient-Variation Regret Bounds for Unconstrained Online Learning","created":"2026-04-13","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.09273","title":"Instance-Adaptive Online Multicalibration","created":"2026-05-10","cited_by_count":1,"area":null},{"id":"2607.27073","title":"Parameter-Free Dynamic Regret under Heavy-Tailed Noise","created":"2026-07-29","cited_by_count":1,"area":null},{"id":"2302.06652","title":"Achieving Better Regret against Strategic Adversaries","created":"2023-02-13","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":"2407.05704","title":"Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization","created":"2024-07-08","cited_by_count":0,"area":null},{"id":"2409.18439","title":"State-free Reinforcement Learning","created":"2024-09-27","cited_by_count":0,"area":"deeprl"},{"id":"2501.06505","title":"Online Algorithm for Aggregating Experts' Predictions with Unbounded Quadratic Loss","created":"2025-01-11","cited_by_count":0,"area":null},{"id":"2602.02024","title":"Adaptive Quality-Diversity Trade-offs for Large-Scale Batch Recommendation","created":"2026-02-02","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.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":"2609.19891","title":"Online Adaptive Kernel Mixing for Gaussian Process Decision Making","created":"2026-09-17","cited_by_count":0,"area":null},{"id":"2609.32165","title":"FOCUS: Fixed-Confidence Online Causal Learning Using Sequential Adaptive Interventions","created":"2026-09-26","cited_by_count":0,"area":null},{"id":"2610.01592","title":"Which LLM to pick? Online Active Model Selection for Large Language Models","created":"2026-10-01","cited_by_count":0,"area":null},{"id":"2610.02258","title":"Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise","created":"2026-09-30","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}