{"total":13,"rows":[{"id":"2106.02978","title":"Robust Stochastic Linear Contextual Bandits Under Adversarial Attacks","created":"2021-06-05","cited_by_count":33,"area":null},{"id":"2104.03781","title":"Leveraging Good Representations in Linear Contextual Bandits","created":"2021-04-08","cited_by_count":29,"area":null},{"id":"2206.11254","title":"Langevin Monte Carlo for Contextual Bandits","created":"2022-06-22","cited_by_count":22,"area":null},{"id":"2307.10167","title":"VITS : Variational Inference Thompson Sampling for contextual bandits","created":"2023-07-19","cited_by_count":6,"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":"2502.01085","title":"Federated Linear Dueling Bandits","created":"2025-02-03","cited_by_count":2,"area":null},{"id":"2202.11735","title":"Truncated LinUCB for Stochastic Linear Bandits","created":"2022-02-23","cited_by_count":1,"area":null},{"id":"2604.22161","title":"Logistic Bandits with $\\tilde{O}(\\sqrt{dT})$ Regret without Context Diversity Assumptions","created":"2026-04-24","cited_by_count":1,"area":null},{"id":"2301.12571","title":"Bounded (O(1)) Regret Recommendation Learning via Synthetic Controls Oracle","created":"2023-01-29","cited_by_count":0,"area":null},{"id":"2503.16382","title":"Sparse Nonparametric Contextual Bandits","created":"2025-03-20","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},{"id":"2610.01377","title":"Minimax Optimal Regret for Causal Logistic Bandits with Counterfactual Fairness","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}