{"total":16,"rows":[{"id":"2112.14368","title":"Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization","created":"2021-12-29","cited_by_count":66,"area":null},{"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":"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":"2305.15703","title":"The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning","created":"2023-05-25","cited_by_count":27,"area":null},{"id":"2106.03596","title":"Beyond Bandit Feedback in Online Multiclass Classification","created":"2021-06-07","cited_by_count":14,"area":null},{"id":"2302.08631","title":"Practical Contextual Bandits with Feedback Graphs","created":"2023-02-17","cited_by_count":11,"area":null},{"id":"2107.03455","title":"Model Selection for Generic Contextual Bandits","created":"2021-07-07","cited_by_count":8,"area":null},{"id":"2402.08127","title":"Efficient Contextual Bandits with Uninformed Feedback Graphs","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2106.04689","title":"Learning to Price Against a Moving Target","created":"2021-06-08","cited_by_count":5,"area":null},{"id":"2210.01376","title":"Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs","created":"2022-10-04","cited_by_count":5,"area":null},{"id":"2206.10022","title":"Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality","created":"2022-06-20","cited_by_count":3,"area":null},{"id":"2205.04860","title":"Universal Caching","created":"2022-05-10","cited_by_count":2,"area":null},{"id":"2306.08320","title":"Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2407.00916","title":"Learnability in Online Kernel Selection with Memory Constraint via Data-dependent Regret Analysis","created":"2024-07-01","cited_by_count":0,"area":null},{"id":"2602.09457","title":"From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2608.15996","title":"Toward Optimal Second-Order Path-Length Guarantee for Adversarial Multi-Armed Bandits","created":"2026-08-17","cited_by_count":0,"area":null}],"next_cursor":null}