{"total":24,"rows":[{"id":"2102.11050","title":"Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization","created":"2021-02-18","cited_by_count":40,"area":null},{"id":"2207.05836","title":"Contextual Bandits with Large Action Spaces: Made Practical","created":"2022-07-12","cited_by_count":33,"area":null},{"id":"2211.05632","title":"Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms","created":"2022-11-08","cited_by_count":19,"area":null},{"id":"2310.00806","title":"Bayesian Design Principles for Frequentist Sequential Learning","created":"2023-10-01","cited_by_count":18,"area":null},{"id":"2305.08629","title":"A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs","created":"2023-05-15","cited_by_count":15,"area":null},{"id":"2311.07565","title":"Exploration via linearly perturbed loss minimisation","created":"2023-11-13","cited_by_count":13,"area":null},{"id":"2102.00490","title":"Online Markov Decision Processes with Aggregate Bandit Feedback","created":"2021-01-31","cited_by_count":10,"area":null},{"id":"2202.08867","title":"Fast online inference for nonlinear contextual bandit based on Generative Adversarial Network","created":"2022-02-17","cited_by_count":7,"area":null},{"id":"2408.06395","title":"Fast John Ellipsoid Computation with Differential Privacy Optimization","created":"2024-08-12","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":"2504.00461","title":"Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries","created":"2025-04-01","cited_by_count":6,"area":null},{"id":"2205.13114","title":"Contextual Pandora's Box","created":"2022-05-26","cited_by_count":5,"area":null},{"id":"2310.00175","title":"Tight Bounds for Volumetric Spanners and Applications","created":"2023-09-29","cited_by_count":4,"area":null},{"id":"2502.09257","title":"From Contextual Combinatorial Semi-Bandits to Bandit List Classification: Improved Sample Complexity with Sparse Rewards","created":"2025-02-13","cited_by_count":4,"area":null},{"id":"2602.21436","title":"Efficient Uncoupled Learning Dynamics with $\\tilde{O}\\!\\left(T^{-1/4}\\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback","created":"2026-02-24","cited_by_count":4,"area":null},{"id":"2602.06264","title":"Swap Regret Minimization Through Response-Based Approachability","created":"2026-02-05","cited_by_count":2,"area":null},{"id":"2510.24187","title":"Self-Concordant Perturbations for Linear Bandits","created":"2025-10-28","cited_by_count":1,"area":null},{"id":"2110.12132","title":"Towards the D-Optimal Online Experiment Design for Recommender Selection","created":"2021-10-23","cited_by_count":0,"area":null},{"id":"2402.15703","title":"Is Offline Decision Making Possible with Only Few Samples? Reliable Decisions in Data-Starved Bandits via Trust Region Enhancement","created":"2024-02-24","cited_by_count":0,"area":null},{"id":"2510.12447","title":"Bayesian Optimization for Dynamic Pricing and Learning","created":"2025-10-14","cited_by_count":0,"area":null},{"id":"2602.02087","title":"Efficient Swap Regret Minimization in Combinatorial Bandits","created":"2026-02-02","cited_by_count":0,"area":null},{"id":"2602.06404","title":"Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2605.09200","title":"A Complete Characterization of Learnability for Adversarial Noisy Bandits","created":"2026-05-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}