{"total":23,"rows":[{"id":"2211.07484","title":"Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression","created":"2022-11-14","cited_by_count":30,"area":null},{"id":"2211.05632","title":"Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms","created":"2022-11-08","cited_by_count":19,"area":null},{"id":"2309.00814","title":"Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits","created":"2023-09-02","cited_by_count":19,"area":null},{"id":"2406.12125","title":"Efficient Sequential Decision Making with Large Language Models","created":"2024-06-17","cited_by_count":16,"area":null},{"id":"2305.15877","title":"Exponential Smoothing for Off-Policy Learning","created":"2023-05-25","cited_by_count":15,"area":null},{"id":"2210.11834","title":"Optimal Contextual Bandits with Knapsacks under Realizability via Regression Oracles","created":"2022-10-21","cited_by_count":12,"area":null},{"id":"2408.09655","title":"Contextual Bandits for Unbounded Context Distributions","created":"2024-08-19","cited_by_count":8,"area":null},{"id":"2402.14664","title":"Bayesian Off-Policy Evaluation and Learning for Large Action Spaces","created":"2024-02-22","cited_by_count":5,"area":null},{"id":"2510.09127","title":"Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback","created":"2025-10-10","cited_by_count":5,"area":null},{"id":"2602.09456","title":"Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Bandits","created":"2026-02-10","cited_by_count":4,"area":null},{"id":"2406.06433","title":"DISCO: An End-to-End Bandit Framework for Personalised Discount Allocation","created":"2024-06-10","cited_by_count":3,"area":null},{"id":"2210.09957","title":"Contextual bandits with concave rewards, and an application to fair ranking","created":"2022-10-18","cited_by_count":2,"area":null},{"id":"2210.13573","title":"Conditionally Risk-Averse Contextual Bandits","created":"2022-10-24","cited_by_count":2,"area":null},{"id":"2301.11461","title":"Learning to Generate All Feasible Actions","created":"2023-01-26","cited_by_count":2,"area":null},{"id":"2302.08551","title":"Infinite Action Contextual Bandits with Reusable Data Exhaust","created":"2023-02-16","cited_by_count":2,"area":null},{"id":"2406.14169","title":"Optimizing Novelty of Top-k Recommendations using Large Language Models and Reinforcement Learning","created":"2024-06-20","cited_by_count":2,"area":null},{"id":"2602.13700","title":"Optimal Regret for Policy Optimization in Contextual Bandits","created":"2026-02-14","cited_by_count":2,"area":null},{"id":"2312.16341","title":"Harnessing the Power of Federated Learning in Federated Contextual Bandits","created":"2023-12-26","cited_by_count":1,"area":null},{"id":"2606.01081","title":"Decision-Focused On-Policy Learning for Contextual Linear Optimization with Partial Feedback","created":"2026-05-31","cited_by_count":1,"area":null},{"id":"2607.13686","title":"Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation","created":"2026-07-15","cited_by_count":1,"area":null},{"id":"2606.09802","title":"Bandits for Efficient Experimentation: Adapting to Control Group, Preferences, and Context Drifts","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2609.36672","title":"Human-inspired, Task-Dimension-Guided Exploration for Efficient Learning in High Dimensions","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.13407","title":"Accelerating Linear Bandits with Persistent Candidate Sets","created":"2026-10-09","cited_by_count":0,"area":null}],"next_cursor":null}