{"total":15,"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":"2312.15433","title":"Best-of-Both-Worlds Algorithms for Linear Contextual Bandits","created":"2023-12-24","cited_by_count":11,"area":null},{"id":"2403.00715","title":"Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds","created":"2024-03-01","cited_by_count":11,"area":null},{"id":"2402.15411","title":"Optimistic Information Directed Sampling","created":"2024-02-23","cited_by_count":7,"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":"2601.09825","title":"Eluder dimension: localise it!","created":"2026-01-14","cited_by_count":3,"area":null},{"id":"2312.16489","title":"Best-of-Both-Worlds Linear Contextual Bandits","created":"2023-12-27","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":"2412.14744","title":"Finite Sample Bounds for Non-Parametric Regression: Optimal Sample Efficiency and Space Complexity","created":"2024-12-19","cited_by_count":0,"area":null},{"id":"2510.07424","title":"Best-of-Both Worlds for linear contextual bandits with paid observations","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2602.09457","title":"From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model","created":"2026-02-10","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":"2609.09907","title":"Meta-LinEXP3: Online-within-Online Learning for Adversarial Linear Contextual Bandits","created":"2026-09-09","cited_by_count":0,"area":null}],"next_cursor":null}