{"total":17,"rows":[{"id":"2111.12306","title":"Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability","created":"2021-11-24","cited_by_count":44,"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":"2102.09305","title":"Boosting for Online Convex Optimization","created":"2021-02-18","cited_by_count":11,"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":"2102.07800","title":"Top-$k$ eXtreme Contextual Bandits with Arm Hierarchy","created":"2021-02-15","cited_by_count":8,"area":null},{"id":"2402.08576","title":"Regret Minimization in Stackelberg Games with Side Information","created":"2024-02-13","cited_by_count":7,"area":null},{"id":"2306.07479","title":"Incentivizing High-Quality Content in Online Recommender Systems","created":"2023-06-13","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":"2401.15520","title":"Oracle-Efficient Hybrid Online Learning with Unknown Distribution","created":"2024-01-27","cited_by_count":4,"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":"2609.33760","title":"Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs","created":"2026-09-27","cited_by_count":3,"area":null},{"id":"2202.12872","title":"AutoFR: Automated Filter Rule Generation for Adblocking","created":"2022-02-25","cited_by_count":2,"area":null},{"id":"2301.00241","title":"Contextual Bandits and Optimistically Universal Learning","created":"2022-12-31","cited_by_count":2,"area":null},{"id":"2305.16257","title":"Fast Online Node Labeling for Very Large Graphs","created":"2023-05-25","cited_by_count":2,"area":null},{"id":"2310.19025","title":"An Improved Relaxation for Oracle-Efficient Adversarial Contextual Bandits","created":"2023-10-29","cited_by_count":2,"area":null},{"id":"2312.16489","title":"Best-of-Both-Worlds Linear Contextual Bandits","created":"2023-12-27","cited_by_count":2,"area":null},{"id":"2501.03865","title":"Truthful mechanisms for linear bandit games with private contexts","created":"2025-01-07","cited_by_count":1,"area":null}],"next_cursor":null}