{"total":28,"rows":[{"id":"2210.12529","title":"On-Demand Sampling: Learning Optimally from Multiple Distributions","created":"2022-10-22","cited_by_count":39,"area":null},{"id":"2302.09739","title":"A Blackbox Approach to Best of Both Worlds in Bandits and Beyond","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2105.14260","title":"Understanding Bandits with Graph Feedback","created":"2021-05-29","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.08631","title":"Practical Contextual Bandits with Feedback Graphs","created":"2023-02-17","cited_by_count":11,"area":null},{"id":"2305.15383","title":"On the Minimax Regret for Online Learning with Feedback Graphs","created":"2023-05-24","cited_by_count":8,"area":null},{"id":"2112.14921","title":"Retrieving Black-box Optimal Images from External Databases","created":"2021-12-30","cited_by_count":6,"area":null},{"id":"2605.20552","title":"Spectral bandits for smooth graph functions with applications in recommender systems","created":"2026-05-19","cited_by_count":6,"area":null},{"id":"2306.02971","title":"Online Learning with Feedback Graphs: The True Shape of Regret","created":"2023-06-05","cited_by_count":5,"area":null},{"id":"2604.24555","title":"Efficient learning by implicit exploration in bandit problems with side observations","created":"2026-04-27","cited_by_count":5,"area":null},{"id":"2604.13740","title":"Online learning with noisy side observations","created":"2026-04-15","cited_by_count":4,"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":"2403.15757","title":"User-Side Realization","created":"2024-03-23","cited_by_count":3,"area":null},{"id":"2406.16802","title":"Improved Regret Bounds for Bandits with Expert Advice","created":"2024-06-24","cited_by_count":3,"area":null},{"id":"2503.04010","title":"Greedy Algorithm for Structured Bandits: A Sharp Characterization of Asymptotic Success / Failure","created":"2025-03-06","cited_by_count":2,"area":null},{"id":"2605.00489","title":"Revealing graph bandits for maximizing local influence","created":"2026-05-01","cited_by_count":2,"area":null},{"id":"2212.07524","title":"Invariant Lipschitz Bandits: A Side Observation Approach","created":"2022-12-14","cited_by_count":1,"area":null},{"id":"2601.00461","title":"Laplacian Kernelized Bandit","created":"2026-01-01","cited_by_count":1,"area":null},{"id":"2604.25271","title":"Online learning with Erd\\H{o}s-R\\'enyi side-observation graphs","created":"2026-04-28","cited_by_count":1,"area":null},{"id":"2110.14874","title":"Sayer: Using Implicit Feedback to Optimize System Policies","created":"2021-10-28","cited_by_count":0,"area":null},{"id":"2212.11603","title":"Sequential Decision Problems with Weak Feedback","created":"2022-12-22","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":"2510.07424","title":"Best-of-Both Worlds for linear contextual bandits with paid observations","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2604.18420","title":"Spectral bandits for smooth graph functions","created":"2026-04-20","cited_by_count":0,"area":null},{"id":"2604.25272","title":"Spectral bandits","created":"2026-04-28","cited_by_count":0,"area":null},{"id":"2605.03493","title":"Bandits on graphs and structures","created":"2026-05-05","cited_by_count":0,"area":null},{"id":"2605.22438","title":"Do Not Trust The Auctioneer: Learning to Bid in Feedback-Manipulated Auctions","created":"2026-05-21","cited_by_count":0,"area":null}],"next_cursor":null}