{"total":17,"rows":[{"id":"2102.03758","title":"Non-stationary Online Learning with Memory and Non-stochastic Control","created":"2021-02-07","cited_by_count":33,"area":null},{"id":"2105.14260","title":"Understanding Bandits with Graph Feedback","created":"2021-05-29","cited_by_count":14,"area":null},{"id":"2106.03596","title":"Beyond Bandit Feedback in Online Multiclass Classification","created":"2021-06-07","cited_by_count":14,"area":null},{"id":"2210.04229","title":"Learning on the Edge: Online Learning with Stochastic Feedback Graphs","created":"2022-10-09","cited_by_count":12,"area":null},{"id":"2302.04374","title":"Near-Optimal Adversarial Reinforcement Learning with Switching Costs","created":"2023-02-08","cited_by_count":4,"area":null},{"id":"2306.09588","title":"Understanding the Role of Feedback in Online Learning with Switching Costs","created":"2023-06-16","cited_by_count":4,"area":null},{"id":"2503.07824","title":"Pure Exploration with Feedback Graphs","created":"2025-03-10","cited_by_count":4,"area":null},{"id":"2303.01709","title":"Streaming Algorithms for Learning with Experts: Deterministic Versus Robust","created":"2023-03-03","cited_by_count":3,"area":null},{"id":"2106.08441","title":"Online Learning with Uncertain Feedback Graphs","created":"2021-06-15","cited_by_count":2,"area":null},{"id":"2602.06902","title":"Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory","created":"2026-02-06","cited_by_count":2,"area":null},{"id":"2601.00461","title":"Laplacian Kernelized Bandit","created":"2026-01-01","cited_by_count":1,"area":null},{"id":"2107.05289","title":"Continuous Time Bandits With Sampling Costs","created":"2021-07-12","cited_by_count":0,"area":null},{"id":"2505.10698","title":"Asymptotically-Optimal Gaussian Bandits with Side Observations","created":"2025-05-15","cited_by_count":0,"area":null},{"id":"2508.14311","title":"Online Learning with Multiple Fairness Regularizers via Graph-Structured Feedback","created":"2025-08-19","cited_by_count":0,"area":null},{"id":"2606.02363","title":"Minimax-Optimal Policy Regret in Partially Observable Markov Games","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2606.03851","title":"Two-Action Apple Tasting with Switching Costs","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2608.09366","title":"Beyond Binary: Continuous State Optimization with Graph-Structured Objectives","created":"2026-08-10","cited_by_count":0,"area":null}],"next_cursor":null}