{"total":41,"rows":[{"id":"2112.14368","title":"Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization","created":"2021-12-29","cited_by_count":66,"area":null},{"id":"2112.03432","title":"First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach","created":"2021-12-07","cited_by_count":38,"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":"2305.15703","title":"The Benefits of Being Distributional: Small-Loss Bounds for Reinforcement Learning","created":"2023-05-25","cited_by_count":27,"area":null},{"id":"2205.13924","title":"Lifting the Information Ratio: An Information-Theoretic Analysis of Thompson Sampling for Contextual Bandits","created":"2022-05-27","cited_by_count":19,"area":null},{"id":"2305.00832","title":"First- and Second-Order Bounds for Adversarial Linear Contextual Bandits","created":"2023-05-01","cited_by_count":19,"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":"2207.05849","title":"Contextual Bandits with Smooth Regret: Efficient Learning in Continuous Action Spaces","created":"2022-07-12","cited_by_count":18,"area":null},{"id":"2402.14987","title":"On the Performance of Empirical Risk Minimization with Smoothed Data","created":"2024-02-22","cited_by_count":13,"area":null},{"id":"2302.08631","title":"Practical Contextual Bandits with Feedback Graphs","created":"2023-02-17","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":"2211.14932","title":"Eluder-based Regret for Stochastic Contextual MDPs","created":"2022-11-27","cited_by_count":9,"area":null},{"id":"2303.01464","title":"Efficient Rate Optimal Regret for Adversarial Contextual MDPs Using Online Function Approximation","created":"2023-03-02","cited_by_count":9,"area":null},{"id":"2410.12713","title":"How Does Variance Shape the Regret in Contextual Bandits?","created":"2024-10-16","cited_by_count":9,"area":null},{"id":"2303.04845","title":"Smoothed Analysis of Sequential Probability Assignment","created":"2023-03-08","cited_by_count":7,"area":null},{"id":"2305.03784","title":"Neural Exploitation and Exploration of Contextual Bandits","created":"2023-05-05","cited_by_count":7,"area":null},{"id":"2402.15411","title":"Optimistic Information Directed Sampling","created":"2024-02-23","cited_by_count":7,"area":null},{"id":"2402.08127","title":"Efficient Contextual Bandits with Uninformed Feedback Graphs","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2506.12751","title":"Single Index Bandits: Generalized Linear Contextual Bandits with Unknown Reward Functions","created":"2025-06-15","cited_by_count":6,"area":null},{"id":"2304.13593","title":"Thompson Sampling Regret Bounds for Contextual Bandits with sub-Gaussian rewards","created":"2023-04-26","cited_by_count":5,"area":null},{"id":"2510.09127","title":"Regret Bounds for Adversarial Contextual Bandits with General Function Approximation and Delayed Feedback","created":"2025-10-10","cited_by_count":5,"area":null},{"id":"2310.05047","title":"Online Learning in Contextual Second-Price Pay-Per-Click Auctions","created":"2023-10-08","cited_by_count":4,"area":null},{"id":"2402.08126","title":"Contextual Multinomial Logit Bandits with General Value Functions","created":"2024-02-12","cited_by_count":4,"area":null},{"id":"2602.09456","title":"Taming the Monster Every Context: Complexity Measure and Unified Framework for Offline-Oracle Efficient Contextual Bandits","created":"2026-02-10","cited_by_count":4,"area":null},{"id":"2405.20677","title":"Provably Efficient Interactive-Grounded Learning with Personalized Reward","created":"2024-05-31","cited_by_count":3,"area":null},{"id":"2601.09825","title":"Eluder dimension: localise it!","created":"2026-01-14","cited_by_count":3,"area":null},{"id":"2210.13573","title":"Conditionally Risk-Averse Contextual Bandits","created":"2022-10-24","cited_by_count":2,"area":null},{"id":"2410.09597","title":"A Complete Characterization of Learnability for Stochastic Noisy Bandits","created":"2024-10-12","cited_by_count":2,"area":null},{"id":"2602.13700","title":"Optimal Regret for Policy Optimization in Contextual Bandits","created":"2026-02-14","cited_by_count":2,"area":null},{"id":"2308.08650","title":"AdaptEx: A Self-Service Contextual Bandit Platform","created":"2023-08-08","cited_by_count":1,"area":null},{"id":"2308.15107","title":"Stochastic Graph Bandit Learning with Side-Observations","created":"2023-08-29","cited_by_count":1,"area":null},{"id":"2307.12022","title":"Latent Utility Q-Learning for Preference-Adaptive Dynamic Treatment Regimes","created":"2023-07-22","cited_by_count":0,"area":null},{"id":"2310.14751","title":"Efficient and Interpretable Bandit Algorithms","created":"2023-10-23","cited_by_count":0,"area":null},{"id":"2502.02140","title":"An Information-Theoretic Analysis of Thompson Sampling with Infinite Action Spaces","created":"2025-02-04","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":"2505.16918","title":"Scalable and Interpretable Contextual Bandits: A Literature Review and Retail Offer Prototype","created":"2025-05-22","cited_by_count":0,"area":null},{"id":"2507.12584","title":"Second-Order Bounds for [0,1]-Valued Regression via Betting Loss","created":"2025-07-16","cited_by_count":0,"area":null},{"id":"2510.15483","title":"Fast Best-in-Class Regret for Contextual Bandits","created":"2025-10-17","cited_by_count":0,"area":null},{"id":"2602.08307","title":"Interaction-Grounded Learning for Contextual Markov Decision Processes with Personalized Feedback","created":"2026-02-09","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":"2604.20024","title":"Replicable Bandits with UCB based Exploration","created":"2026-04-21","cited_by_count":0,"area":null}],"next_cursor":null}