{"total":34,"rows":[{"id":"2107.06196","title":"No Regrets for Learning the Prior in Bandits","created":"2021-07-13","cited_by_count":30,"area":null},{"id":"2203.01303","title":"An Analysis of Ensemble Sampling","created":"2022-03-02","cited_by_count":24,"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":"2103.13929","title":"Multinomial Logit Contextual Bandits: Provable Optimality and Practicality","created":"2021-03-25","cited_by_count":21,"area":null},{"id":"2306.00242","title":"Combinatorial Neural Bandits","created":"2023-05-31","cited_by_count":16,"area":null},{"id":"2202.13227","title":"Towards Scalable and Robust Structured Bandits: A Meta-Learning Framework","created":"2022-02-26","cited_by_count":11,"area":null},{"id":"2101.07957","title":"Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functions","created":"2021-01-20","cited_by_count":9,"area":null},{"id":"2107.00680","title":"A Map of Bandits for E-commerce","created":"2021-07-01","cited_by_count":9,"area":null},{"id":"2206.00494","title":"Incentivizing Combinatorial Bandit Exploration","created":"2022-06-01","cited_by_count":9,"area":null},{"id":"2408.11202","title":"Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits","created":"2024-08-20","cited_by_count":8,"area":null},{"id":"2111.02314","title":"Online Learning of Energy Consumption for Navigation of Electric Vehicles","created":"2021-11-03","cited_by_count":7,"area":null},{"id":"2111.04295","title":"The Hardness Analysis of Thompson Sampling for Combinatorial Semi-bandits with Greedy Oracle","created":"2021-11-08","cited_by_count":7,"area":null},{"id":"2202.03704","title":"Budgeted Combinatorial Multi-Armed Bandits","created":"2022-02-08","cited_by_count":6,"area":null},{"id":"2302.11182","title":"When Combinatorial Thompson Sampling meets Approximation Regret","created":"2023-02-22","cited_by_count":6,"area":null},{"id":"2306.07549","title":"Fixed-Budget Best-Arm Identification with Heterogeneous Reward Variances","created":"2023-06-13","cited_by_count":6,"area":null},{"id":"2102.07254","title":"Asymptotically Optimal Strategies For Combinatorial Semi-Bandits in Polynomial Time","created":"2021-02-14","cited_by_count":4,"area":null},{"id":"2502.09257","title":"From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards","created":"2025-02-13","cited_by_count":4,"area":null},{"id":"2302.01543","title":"Multiplier Bootstrap-based Exploration","created":"2023-02-03","cited_by_count":3,"area":null},{"id":"2405.17968","title":"Matroid Semi-Bandits in Sublinear Time","created":"2024-05-28","cited_by_count":3,"area":null},{"id":"2308.14165","title":"Distributional Off-Policy Evaluation for Slate Recommendations","created":"2023-08-27","cited_by_count":2,"area":null},{"id":"2407.00567","title":"A Contextual Combinatorial Bandit Approach to Negotiation","created":"2024-06-30","cited_by_count":2,"area":null},{"id":"2410.14586","title":"Neural Combinatorial Clustered Bandits for Recommendation Systems","created":"2024-10-18","cited_by_count":2,"area":null},{"id":"2502.01226","title":"Adaptive Prior Selection in Gaussian Process Bandits with Thompson Sampling","created":"2025-02-03","cited_by_count":2,"area":null},{"id":"2502.18826","title":"Adversarial Combinatorial Semi-bandits with Graph Feedback","created":"2025-02-26","cited_by_count":1,"area":null},{"id":"2510.19119","title":"Learning Peer Influence Probabilities with Linear Contextual Bandits","created":"2025-10-21","cited_by_count":1,"area":null},{"id":"2605.28290","title":"Adaptive Bandit Algorithms for Contextual Matching Markets","created":"2026-05-27","cited_by_count":1,"area":null},{"id":"2605.29645","title":"The Sample Complexity of Multiclass and Sparse Contextual Bandits","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2608.15848","title":"Generalized Linear Bandits with Memory","created":"2026-08-16","cited_by_count":1,"area":null},{"id":"2106.01624","title":"Sleeping Combinatorial Bandits","created":"2021-06-03","cited_by_count":0,"area":null},{"id":"2210.05977","title":"BORA: Bayesian Optimization for Resource Allocation","created":"2022-10-12","cited_by_count":0,"area":null},{"id":"2509.09933","title":"Multi-Play Combinatorial Semi-Bandit Problem","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2602.02087","title":"Efficient Swap Regret Minimization in Combinatorial Bandits","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2604.09423","title":"Offline Local Search for Online Stochastic Bandits","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2606.23414","title":"Leveraging Similarities in Multi-Armed Bandits","created":"2026-06-22","cited_by_count":0,"area":null}],"next_cursor":null}