{"total":18,"rows":[{"id":"2310.11550","title":"Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback","created":"2023-10-17","cited_by_count":13,"area":null},{"id":"2312.15433","title":"Best-of-Both-Worlds Algorithms for Linear Contextual Bandits","created":"2023-12-24","cited_by_count":11,"area":null},{"id":"2410.07533","title":"Corruption-Robust Linear Bandits: Minimax Optimality and Gap-Dependent Misspecification","created":"2024-10-10","cited_by_count":7,"area":null},{"id":"2310.01609","title":"Adversarial Contextual Bandits Go Kernelized","created":"2023-10-02","cited_by_count":6,"area":null},{"id":"2502.00204","title":"Nearly-Optimal Bandit Learning in Stackelberg Games with Side Information","created":"2025-01-31","cited_by_count":6,"area":null},{"id":"2406.00551","title":"Strategic Linear Contextual Bandits","created":"2024-06-01","cited_by_count":5,"area":null},{"id":"2403.03219","title":"LC-Tsallis-INF: Generalized Best-of-Both-Worlds Linear Contextual Bandits","created":"2024-03-05","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":"2312.16489","title":"Best-of-Both-Worlds Linear Contextual Bandits","created":"2023-12-27","cited_by_count":2,"area":null},{"id":"2405.15200","title":"Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits","created":"2024-05-24","cited_by_count":2,"area":null},{"id":"2508.18768","title":"Efficient Best-of-Both-Worlds Algorithms for Contextual Combinatorial Semi-Bandits","created":"2025-08-26","cited_by_count":2,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"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":"2604.14961","title":"Calibration-Gated LLM Pseudo-Observations for Online Contextual Bandits","created":"2026-04-16","cited_by_count":0,"area":null},{"id":"2605.26585","title":"Near-Optimal Regret in Adversarial Kernel Bandits","created":"2026-05-26","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":"2609.09907","title":"Meta-LinEXP3: Online-within-Online Learning for Adversarial Linear Contextual Bandits","created":"2026-09-09","cited_by_count":0,"area":null},{"id":"2610.17818","title":"Follow the Perturbed Leader for Linear Bandits: $\\sqrt{T}$ Regret over General Convex Sets","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}