{"total":18,"rows":[{"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.04137","title":"Optimal Batched Linear Bandits","created":"2024-06-06","cited_by_count":7,"area":null},{"id":"2502.12528","title":"Contextual Linear Bandits with Delay as Payoff","created":"2025-02-18","cited_by_count":7,"area":null},{"id":"2407.01566","title":"A Parametric Contextual Online Learning Theory of Brokerage","created":"2024-05-22","cited_by_count":4,"area":null},{"id":"2508.11931","title":"An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction","created":"2025-08-16","cited_by_count":4,"area":null},{"id":"2501.07046","title":"Differentially Private Kernelized Contextual Bandits","created":"2025-01-13","cited_by_count":3,"area":null},{"id":"2404.09413","title":"On the Optimal Regret of Locally Private Linear Contextual Bandit","created":"2024-04-15","cited_by_count":2,"area":null},{"id":"2507.08438","title":"Optimal and Practical Batched Linear Bandit Algorithm","created":"2025-07-11","cited_by_count":2,"area":null},{"id":"2606.00984","title":"Practical and Optimal Algorithm for Linear Contextual Bandits with Rare Parameter Updates","created":"2026-05-31","cited_by_count":2,"area":null},{"id":"2602.00417","title":"Shuffle and Joint Differential Privacy for Generalized Linear Contextual Bandits","created":"2026-01-31","cited_by_count":1,"area":null},{"id":"2605.30976","title":"Batched Stochastic Linear Bandits with 1-Bit Communication Constraints","created":"2026-05-29","cited_by_count":1,"area":null},{"id":"2504.20894","title":"Does Feedback Help in Bandits with Arm Erasures?","created":"2025-04-29","cited_by_count":0,"area":null},{"id":"2507.13639","title":"Differential Privacy in Kernelized Contextual Bandits via Random Projections","created":"2025-07-18","cited_by_count":0,"area":null},{"id":"2509.04194","title":"Stochastic Matching Bandits with Rare Optimization Updates","created":"2025-09-04","cited_by_count":0,"area":null},{"id":"2510.21431","title":"Oracle-Efficient Combinatorial Semi-Bandits","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2510.26000","title":"Infrequent Exploration in Linear Bandits","created":"2025-10-29","cited_by_count":0,"area":null},{"id":"2603.12530","title":"Mixing Makes Markovian Contexts Cheap for Linear Bandits","created":"2026-03-13","cited_by_count":0,"area":null},{"id":"2606.20022","title":"Set Membership Estimation for Stochastic Linear Contextual Bandits","created":"2026-06-18","cited_by_count":0,"area":null}],"next_cursor":null}