{"total":76,"rows":[{"id":"2102.04939","title":"RL for Latent MDPs: Regret Guarantees and a Lower Bound","created":"2021-02-09","cited_by_count":70,"area":null},{"id":"2107.01264","title":"Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning","created":"2021-07-02","cited_by_count":34,"area":null},{"id":"2303.09468","title":"On the Existence of a Complexity in Fixed Budget Bandit Identification","created":"2023-03-16","cited_by_count":20,"area":null},{"id":"2301.13446","title":"Sharp Variance-Dependent Bounds in Reinforcement Learning: Best of Both Worlds in Stochastic and Deterministic Environments","created":"2023-01-31","cited_by_count":19,"area":null},{"id":"2206.00121","title":"Near-Optimal Collaborative Learning in Bandits","created":"2022-05-31","cited_by_count":18,"area":null},{"id":"2103.12452","title":"Bandits with many optimal arms","created":"2021-03-23","cited_by_count":17,"area":null},{"id":"2109.13595","title":"The Fragility of Optimized Bandit Algorithms","created":"2021-09-28","cited_by_count":17,"area":null},{"id":"2210.14051","title":"Bridging Distributional and Risk-sensitive Reinforcement Learning with Provable Regret Bounds","created":"2022-10-25","cited_by_count":16,"area":null},{"id":"2106.13013","title":"A Fully Problem-Dependent Regret Lower Bound for Finite-Horizon MDPs","created":"2021-06-24","cited_by_count":15,"area":null},{"id":"2204.00706","title":"Strategies for Safe Multi-Armed Bandits with Logarithmic Regret and Risk","created":"2022-04-01","cited_by_count":15,"area":null},{"id":"2301.12601","title":"Regret Bounds for Markov Decision Processes with Recursive Optimized Certainty Equivalents","created":"2023-01-30","cited_by_count":15,"area":null},{"id":"2106.11519","title":"Agnostic Reinforcement Learning with Low-Rank MDPs and Rich Observations","created":"2021-06-22","cited_by_count":13,"area":null},{"id":"2402.16710","title":"Cost Aware Best Arm Identification","created":"2024-02-26","cited_by_count":13,"area":null},{"id":"2102.03400","title":"Confidence-Budget Matching for Sequential Budgeted Learning","created":"2021-02-05","cited_by_count":12,"area":null},{"id":"2312.12137","title":"Best Arm Identification with Fixed Budget: A Large Deviation Perspective","created":"2023-12-19","cited_by_count":12,"area":null},{"id":"2108.11345","title":"A Unifying Theory of Thompson Sampling for Continuous Risk-Averse Bandits","created":"2021-08-25","cited_by_count":9,"area":null},{"id":"2310.06113","title":"When is Agnostic Reinforcement Learning Statistically Tractable?","created":"2023-10-09","cited_by_count":9,"area":null},{"id":"2106.14077","title":"The Role of Contextual Information in Best Arm Identification","created":"2021-06-26","cited_by_count":8,"area":null},{"id":"2210.00895","title":"On Best-Arm Identification with a Fixed Budget in Non-Parametric Multi-Armed Bandits","created":"2022-09-30","cited_by_count":8,"area":null},{"id":"2306.02399","title":"Regret Bounds for Risk-sensitive Reinforcement Learning with Lipschitz Dynamic Risk Measures","created":"2023-06-04","cited_by_count":8,"area":null},{"id":"2306.09048","title":"Optimal Best-Arm Identification in Bandits with Access to Offline Data","created":"2023-06-15","cited_by_count":8,"area":null},{"id":"2101.01086","title":"Be Greedy in Multi-Armed Bandits","created":"2021-01-04","cited_by_count":7,"area":null},{"id":"2107.01835","title":"Fast Rate Learning in Stochastic First Price Bidding","created":"2021-07-05","cited_by_count":7,"area":null},{"id":"2107.10492","title":"Bandit Quickest Changepoint Detection","created":"2021-07-22","cited_by_count":7,"area":null},{"id":"2110.12916","title":"On Slowly-varying Non-stationary Bandits","created":"2021-10-25","cited_by_count":7,"area":null},{"id":"2302.06025","title":"Statistical Complexity and Optimal Algorithms for Non-linear Ridge Bandits","created":"2023-02-12","cited_by_count":7,"area":null},{"id":"2504.19952","title":"On Stopping Times of Power-one Sequential Tests: Tight Lower and Upper Bounds","created":"2025-04-28","cited_by_count":7,"area":null},{"id":"2205.15695","title":"On Preemption and Learning in Stochastic Scheduling","created":"2022-05-31","cited_by_count":6,"area":null},{"id":"2306.07761","title":"Multi-Fidelity Multi-Armed Bandits Revisited","created":"2023-06-13","cited_by_count":6,"area":null},{"id":"2308.12000","title":"On Universally Optimal Algorithms for A/B Testing","created":"2023-08-23","cited_by_count":6,"area":null},{"id":"2311.15647","title":"Bandits Meet Mechanism Design to Combat Clickbait in Online Recommendation","created":"2023-11-27","cited_by_count":6,"area":null},{"id":"2106.10166","title":"Problem Dependent View on Structured Thresholding Bandit Problems","created":"2021-06-18","cited_by_count":5,"area":null},{"id":"2203.06297","title":"Instance-Dependent Regret Analysis of Kernelized Bandits","created":"2022-03-12","cited_by_count":5,"area":null},{"id":"2210.00832","title":"Square-root regret bounds for continuous-time episodic Markov decision processes","created":"2022-10-03","cited_by_count":5,"area":null},{"id":"2306.01121","title":"Differentially Private Episodic Reinforcement Learning with Heavy-tailed Rewards","created":"2023-06-01","cited_by_count":4,"area":null},{"id":"2310.07596","title":"Prospective Side Information for Latent MDPs","created":"2023-10-11","cited_by_count":4,"area":null},{"id":"2311.07876","title":"Learning Adversarial Low-rank Markov Decision Processes with Unknown Transition and Full-information Feedback","created":"2023-11-14","cited_by_count":4,"area":null},{"id":"2503.07824","title":"Pure Exploration with Feedback Graphs","created":"2025-03-10","cited_by_count":4,"area":null},{"id":"2605.02141","title":"On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization","created":"2026-05-04","cited_by_count":4,"area":null},{"id":"2301.11442","title":"Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits","created":"2023-01-26","cited_by_count":3,"area":null},{"id":"2409.11141","title":"Sample Complexity Bounds for Linear System Identification from a Finite Set","created":"2024-09-17","cited_by_count":3,"area":null},{"id":"2205.10729","title":"Near-Optimal Algorithms for Autonomous Exploration and Multi-Goal Stochastic Shortest Path","created":"2022-05-22","cited_by_count":2,"area":null},{"id":"2212.09429","title":"On the Complexity of Representation Learning in Contextual Linear Bandits","created":"2022-12-19","cited_by_count":2,"area":null},{"id":"2304.03056","title":"Sharp Deviations Bounds for Dirichlet Weighted Sums with Application to analysis of Bayesian algorithms","created":"2023-04-06","cited_by_count":2,"area":null},{"id":"2309.16563","title":"CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption","created":"2023-09-28","cited_by_count":2,"area":null},{"id":"2310.03722","title":"Anytime-valid t-tests and confidence sequences for Gaussian means with unknown variance","created":"2023-10-05","cited_by_count":2,"area":null},{"id":"2402.07391","title":"Replicability is Asymptotically Free in Multi-armed Bandits","created":"2024-02-12","cited_by_count":2,"area":null},{"id":"2411.03270","title":"Stable Matching with Ties: Approximation Ratios and Learning","created":"2024-11-05","cited_by_count":2,"area":null},{"id":"2503.00273","title":"Evolution of Information in Interactive Decision Making: A Case Study for Multi-Armed Bandits","created":"2025-03-01","cited_by_count":2,"area":null},{"id":"2604.21432","title":"A single algorithm for both restless and rested rotting bandits","created":"2026-04-23","cited_by_count":2,"area":null},{"id":"2106.14338","title":"Regret Analysis in Deterministic Reinforcement Learning","created":"2021-06-27","cited_by_count":1,"area":null},{"id":"2110.05724","title":"Query-Reward Tradeoffs in Multi-Armed Bandits","created":"2021-10-12","cited_by_count":1,"area":null},{"id":"2402.15127","title":"Asymptotically and Minimax Optimal Regret Bounds for Multi-Armed Bandits with Abstention","created":"2024-02-23","cited_by_count":1,"area":null},{"id":"2506.01324","title":"Near-Optimal Clustering in Mixture of Markov Chains","created":"2025-06-02","cited_by_count":1,"area":null},{"id":"2506.06978","title":"Near Optimal Non-asymptotic Sample Complexity of 1-Identification","created":"2025-06-08","cited_by_count":1,"area":null},{"id":"2507.08994","title":"Fixed-Confidence Multiple Change Point Identification under Bandit Feedback","created":"2025-07-11","cited_by_count":1,"area":null},{"id":"2508.06377","title":"DP-SPRT: Differentially Private Sequential Probability Ratio Tests","created":"2025-08-08","cited_by_count":1,"area":null},{"id":"2508.13749","title":"Order Optimal Regret Bounds for Sharpe Ratio Optimization under Thompson Sampling","created":"2025-08-19","cited_by_count":1,"area":null},{"id":"2509.11907","title":"High Effort, Low Gain: Fundamental Limits of Active Learning for Linear Dynamical Systems","created":"2025-09-15","cited_by_count":1,"area":null},{"id":"2511.08073","title":"Online Linear Regression with Paid Stochastic Features","created":"2025-11-11","cited_by_count":1,"area":null},{"id":"2603.15336","title":"Active Seriation: Efficient Ordering Recovery with Statistical Guarantees","created":"2026-03-16","cited_by_count":1,"area":null},{"id":"2603.19700","title":"Regret Analysis of Sleeping Competing Bandits","created":"2026-03-20","cited_by_count":1,"area":null},{"id":"2201.02169","title":"Learning Optimal Antenna Tilt Control Policies: A Contextual Linear Bandit Approach","created":"2022-01-06","cited_by_count":0,"area":null},{"id":"2305.18333","title":"Ranking with Popularity Bias: User Welfare under Self-Amplification Dynamics","created":"2023-05-24","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":"2411.00339","title":"Unified theory of upper confidence bound policies for bandit problems targeting total reward, maximal reward, and more","created":"2024-11-01","cited_by_count":0,"area":null},{"id":"2501.10261","title":"Logarithmic Regret for Nonlinear Control","created":"2025-01-17","cited_by_count":0,"area":null},{"id":"2503.05662","title":"On Mitigating Affinity Bias through Bandits with Evolving Biased Feedback","created":"2025-03-07","cited_by_count":0,"area":null},{"id":"2505.20051","title":"Catoni-Style Change Point Detection for Regret Minimization in Non-Stationary Heavy-Tailed Bandits","created":"2025-05-26","cited_by_count":0,"area":null},{"id":"2509.07030","title":"A Minimalist Bayesian Framework for Stochastic Optimization","created":"2025-09-07","cited_by_count":0,"area":null},{"id":"2603.18514","title":"On the Peril of (Even a Little) Nonstationarity in Satisficing Regret Minimization","created":"2026-03-19","cited_by_count":0,"area":null},{"id":"2605.07171","title":"Cost-Ordered Feasibility for Multi-Armed Bandits with Cost Subsidy","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2606.01655","title":"MINTS: Minimalist Thompson Sampling","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2607.11635","title":"Fundamental Limitations of Fixed-Budget Best-Arm Identification","created":"2026-07-13","cited_by_count":0,"area":null},{"id":"2609.19963","title":"Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits","created":"2026-09-17","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}