{"total":26,"rows":[{"id":"2307.13586","title":"Settling the Sample Complexity of Online Reinforcement Learning","created":"2023-07-25","cited_by_count":45,"area":null},{"id":"2310.00968","title":"Variance-Aware Regret Bounds for Stochastic Contextual Dueling Bandits","created":"2023-10-02","cited_by_count":22,"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":"2502.06363","title":"Improved Regret Analysis in Gaussian Process Bandits: Optimality for Noiseless Reward, RKHS norm, and Non-Stationary Variance","created":"2025-02-10","cited_by_count":15,"area":null},{"id":"2306.06836","title":"Tackling Heavy-Tailed Rewards in Reinforcement Learning with Function Approximation: Minimax Optimal and Instance-Dependent Regret Bounds","created":"2023-06-12","cited_by_count":14,"area":null},{"id":"2311.15238","title":"A Nearly Optimal and Low-Switching Algorithm for Reinforcement Learning with General Function Approximation","created":"2023-11-26","cited_by_count":14,"area":null},{"id":"2409.16197","title":"Second Order Bounds for Contextual Bandits with Function Approximation","created":"2024-09-24","cited_by_count":9,"area":null},{"id":"2402.07341","title":"Noise-Adaptive Confidence Sets for Linear Bandits and Application to Bayesian Optimization","created":"2024-02-12","cited_by_count":6,"area":null},{"id":"2404.12648","title":"Sample-efficient Learning of Infinite-horizon Average-reward MDPs with General Function Approximation","created":"2024-04-19","cited_by_count":6,"area":null},{"id":"2312.04464","title":"Horizon-Free and Instance-Dependent Regret Bounds for Reinforcement Learning with General Function Approximation","created":"2023-12-07","cited_by_count":4,"area":null},{"id":"2412.08843","title":"Allocation Stability and Wald Inference under Variance-Aware UCB","created":"2024-12-12","cited_by_count":4,"area":null},{"id":"2503.12020","title":"Variance-Dependent Regret Lower Bounds for Contextual Bandits","created":"2025-03-15","cited_by_count":4,"area":null},{"id":"2508.01681","title":"Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds","created":"2025-08-03","cited_by_count":4,"area":null},{"id":"2511.03606","title":"Vector-valued self-normalized concentration inequalities beyond sub-Gaussianity","created":"2025-11-05","cited_by_count":4,"area":null},{"id":"2303.09033","title":"Only Pay for What Is Uncertain: Variance-Adaptive Thompson Sampling","created":"2023-03-16","cited_by_count":3,"area":null},{"id":"2411.05979","title":"Variance-Aware Linear UCB with Deep Representation for Neural Contextual Bandits","created":"2024-11-08","cited_by_count":3,"area":null},{"id":"2502.02486","title":"Catoni Contextual Bandits are Robust to Heavy-tailed Rewards","created":"2025-02-04","cited_by_count":3,"area":null},{"id":"2403.10732","title":"Variance-Dependent Regret Bounds for Non-stationary Linear Bandits","created":"2024-03-15","cited_by_count":2,"area":null},{"id":"2506.01250","title":"Neural Variance-aware Dueling Bandits with Deep Representation and Shallow Exploration","created":"2025-06-02","cited_by_count":2,"area":null},{"id":"2511.02123","title":"Variance-Aware Feel-Good Thompson Sampling for Contextual Bandits","created":"2025-11-03","cited_by_count":2,"area":null},{"id":"2602.10971","title":"A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2605.01628","title":"Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression","created":"2026-05-02","cited_by_count":1,"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":"2601.23164","title":"Stochastic Linear Bandits with Parameter Noise","created":"2026-01-30","cited_by_count":0,"area":null},{"id":"2607.23679","title":"Breaking the Total Variance Barrier: Sharp Sample Complexity for Linear Heteroscedastic Bandits with Fixed Action Set","created":"2026-07-26","cited_by_count":0,"area":null},{"id":"2609.38659","title":"Bandits with Multiple Optimal Arms: Minimax Regret and Non-Adaptivity","created":"2026-09-29","cited_by_count":0,"area":null}],"next_cursor":null}