{"total":49,"rows":[{"id":"2110.14177","title":"Federated Linear Contextual Bandits","created":"2021-10-27","cited_by_count":61,"area":null},{"id":"2110.01463","title":"Asynchronous Upper Confidence Bound Algorithms for Federated Linear Bandits","created":"2021-10-04","cited_by_count":31,"area":null},{"id":"2207.03106","title":"A Simple and Provably Efficient Algorithm for Asynchronous Federated Contextual Linear Bandits","created":"2022-07-07","cited_by_count":28,"area":null},{"id":"2108.06422","title":"Metadata-based Multi-Task Bandits with Bayesian Hierarchical Models","created":"2021-08-13","cited_by_count":24,"area":null},{"id":"2308.10808","title":"Graph Neural Bandits","created":"2023-08-21","cited_by_count":20,"area":null},{"id":"2201.09910","title":"Learning Neural Contextual Bandits Through Perturbed Rewards","created":"2022-01-24","cited_by_count":17,"area":null},{"id":"2202.01087","title":"Communication Efficient Federated Learning for Generalized Linear Bandits","created":"2022-02-02","cited_by_count":13,"area":null},{"id":"2108.04782","title":"Bandit Algorithms for Precision Medicine","created":"2021-08-10","cited_by_count":12,"area":null},{"id":"2205.14174","title":"Private and Byzantine-Proof Cooperative Decision-Making","created":"2022-05-27","cited_by_count":10,"area":null},{"id":"2308.08497","title":"HyperBandit: Contextual Bandit with Hypernewtork for Time-Varying User Preferences in Streaming Recommendation","created":"2023-08-14","cited_by_count":10,"area":null},{"id":"2306.06291","title":"Optimal Multitask Linear Regression and Contextual Bandits under Sparse Heterogeneity","created":"2023-06-09","cited_by_count":7,"area":null},{"id":"2106.02393","title":"Multitask Online Mirror Descent","created":"2021-06-04","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":"2208.14555","title":"Dynamic Global Sensitivity for Differentially Private Contextual Bandits","created":"2022-08-30","cited_by_count":5,"area":null},{"id":"2312.06403","title":"RoME: A Robust Mixed-Effects Bandit Algorithm for Optimizing Mobile Health Interventions","created":"2023-12-11","cited_by_count":5,"area":null},{"id":"2106.08902","title":"Adaptive Clustering and Personalization in Multi-Agent Stochastic Linear Bandits","created":"2021-06-15","cited_by_count":4,"area":null},{"id":"2205.08295","title":"Semi-Parametric Contextual Bandits with Graph-Laplacian Regularization","created":"2022-05-17","cited_by_count":4,"area":null},{"id":"2308.01744","title":"Multitask Learning with No Regret: from Improved Confidence Bounds to Active Learning","created":"2023-08-03","cited_by_count":4,"area":null},{"id":"2403.00116","title":"Federated Linear Contextual Bandits with Heterogeneous Clients","created":"2024-02-29","cited_by_count":4,"area":null},{"id":"2507.17528","title":"Generalized Low-Rank Matrix Contextual Bandits with Graph Information","created":"2025-07-23","cited_by_count":4,"area":null},{"id":"2206.08556","title":"Thompson Sampling for Robust Transfer in Multi-Task Bandits","created":"2022-06-17","cited_by_count":3,"area":null},{"id":"2309.11702","title":"Incentivized Communication for Federated Bandits","created":"2023-09-21","cited_by_count":3,"area":null},{"id":"2311.00973","title":"Federated Linear Bandits with Finite Adversarial Actions","created":"2023-11-02","cited_by_count":3,"area":null},{"id":"2402.14585","title":"Bandits with Abstention under Expert Advice","created":"2024-02-22","cited_by_count":3,"area":null},{"id":"2501.00891","title":"Demystifying Online Clustering of Bandits: Enhanced Exploration Under Stochastic and Smoothed Adversarial Contexts","created":"2025-01-01","cited_by_count":3,"area":null},{"id":"2306.05998","title":"Distributed Consensus Algorithm for Decision-Making in Multi-agent Multi-armed Bandit","created":"2023-06-09","cited_by_count":2,"area":null},{"id":"2310.10259","title":"Leveraging heterogeneous spillover in maximizing contextual bandit rewards","created":"2023-10-16","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":"2206.00466","title":"An $\\alpha$-No-Regret Algorithm For Graphical Bilinear Bandits","created":"2022-06-01","cited_by_count":1,"area":null},{"id":"2307.03641","title":"Online Network Source Optimization with Graph-Kernel MAB","created":"2023-07-07","cited_by_count":1,"area":null},{"id":"2307.14208","title":"Online Modeling and Monitoring of Dependent Processes under Resource Constraints","created":"2023-07-26","cited_by_count":1,"area":null},{"id":"2308.15107","title":"Stochastic Graph Bandit Learning with Side-Observations","created":"2023-08-29","cited_by_count":1,"area":null},{"id":"2309.08710","title":"Adaptive Sample Sharing for Multi Agent Linear Bandits","created":"2023-09-15","cited_by_count":1,"area":null},{"id":"2410.12086","title":"Comparative Performance of Collaborative Bandit Algorithms: Effect of Sparsity and Exploration Intensity","created":"2024-10-15","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.13738","title":"Covariance-adapting algorithm for semi-bandits with application to sparse rewards","created":"2026-04-15","cited_by_count":1,"area":null},{"id":"2104.07150","title":"When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit Solution","created":"2021-04-14","cited_by_count":0,"area":null},{"id":"2112.00979","title":"Recommending with Recommendations","created":"2021-12-02","cited_by_count":0,"area":null},{"id":"2305.01470","title":"Stochastic Contextual Bandits with Graph-based Contexts","created":"2023-05-02","cited_by_count":0,"area":null},{"id":"2308.12680","title":"Master-slave Deep Architecture for Top-K Multi-armed Bandits with Non-linear Bandit Feedback and Diversity Constraints","created":"2023-08-24","cited_by_count":0,"area":null},{"id":"2411.13690","title":"Multi-Agent Best Arm Identification in Stochastic Linear Bandits","created":"2024-11-20","cited_by_count":0,"area":null},{"id":"2507.18756","title":"Exploitation Over Exploration: Unmasking the Bias in Linear Bandit Recommender Offline Evaluation","created":"2025-07-24","cited_by_count":0,"area":null},{"id":"2508.20076","title":"Anomaly Detection in Networked Bandits","created":"2025-08-27","cited_by_count":0,"area":null},{"id":"2601.03629","title":"Learning Shortest Paths When Data is Scarce","created":"2026-01-07","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":"2606.11968","title":"Efficient Multinomial Logistic Bandit via Frequent Directions","created":"2026-06-10","cited_by_count":0,"area":null},{"id":"2606.27917","title":"Graph Dimensionality Reduction for Contextual Bandits: Structure-Specific Regret Bounds under Approximate Smoothness and Noisy Eigenspaces","created":"2026-06-26","cited_by_count":0,"area":null}],"next_cursor":null}