{"total":70,"rows":[{"id":"2109.06668","title":"Exploration in Deep Reinforcement Learning: From Single-Agent to Multiagent Domain","created":"2021-09-14","cited_by_count":58,"area":null},{"id":"2212.06132","title":"Nearly Minimax Optimal Reinforcement Learning for Linear Markov Decision Processes","created":"2022-12-12","cited_by_count":57,"area":null},{"id":"2205.11507","title":"Computationally Efficient Horizon-Free Reinforcement Learning for Linear Mixture MDPs","created":"2022-05-23","cited_by_count":52,"area":null},{"id":"2205.06811","title":"Nearly Optimal Algorithms for Linear Contextual Bandits with Adversarial Corruptions","created":"2022-05-13","cited_by_count":51,"area":null},{"id":"2302.10371","title":"Variance-Dependent Regret Bounds for Linear Bandits and Reinforcement Learning: Adaptivity and Computational Efficiency","created":"2023-02-21","cited_by_count":40,"area":null},{"id":"2206.11489","title":"Nearly Minimax Optimal Reinforcement Learning with Linear Function Approximation","created":"2022-06-23","cited_by_count":30,"area":null},{"id":"2407.13977","title":"A Unified Confidence Sequence for Generalized Linear Models, with Applications to Bandits","created":"2024-07-19","cited_by_count":29,"area":null},{"id":"2102.08940","title":"Near-optimal Policy Optimization Algorithms for Learning Adversarial Linear Mixture MDPs","created":"2021-02-17","cited_by_count":28,"area":null},{"id":"2206.04640","title":"Regret Bounds for Information-Directed Reinforcement Learning","created":"2022-06-09","cited_by_count":24,"area":null},{"id":"2310.19848","title":"Efficient Exploration in Continuous-time Model-based Reinforcement Learning","created":"2023-10-30","cited_by_count":22,"area":null},{"id":"2110.12615","title":"Linear Contextual Bandits with Adversarial Corruptions","created":"2021-10-25","cited_by_count":21,"area":null},{"id":"2105.14267","title":"Information Directed Sampling for Sparse Linear Bandits","created":"2021-05-29","cited_by_count":20,"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":"2206.14332","title":"Active Exploration via Experiment Design in Markov Chains","created":"2022-06-29","cited_by_count":19,"area":null},{"id":"2111.03637","title":"Risk-averse Heteroscedastic Bayesian Optimization","created":"2021-11-05","cited_by_count":17,"area":null},{"id":"2111.08330","title":"Bayesian Optimization for Cascade-type Multi-stage Processes","created":"2021-11-16","cited_by_count":17,"area":null},{"id":"2107.05320","title":"Metalearning Linear Bandits by Prior Update","created":"2021-07-12","cited_by_count":16,"area":null},{"id":"2205.10895","title":"Contextual Information-Directed Sampling","created":"2022-05-22","cited_by_count":16,"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":"2203.07322","title":"Efficient Model-based Multi-agent Reinforcement Learning via Optimistic Equilibrium Computation","created":"2022-03-14","cited_by_count":14,"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":"2201.07306","title":"Bregman Deviations of Generic Exponential Families","created":"2022-01-18","cited_by_count":13,"area":null},{"id":"2302.03683","title":"Linear Partial Monitoring for Sequential Decision-Making: Algorithms, Regret Bounds and Applications","created":"2023-02-07","cited_by_count":12,"area":null},{"id":"2309.14298","title":"Improved Algorithms for Stochastic Linear Bandits Using Tail Bounds for Martingale Mixtures","created":"2023-09-25","cited_by_count":12,"area":null},{"id":"2205.13450","title":"Variance-Aware Sparse Linear Bandits","created":"2022-05-26","cited_by_count":11,"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":"2303.05606","title":"Variance-aware robust reinforcement learning with linear function approximation under heavy-tailed rewards","created":"2023-03-09","cited_by_count":8,"area":null},{"id":"2311.01195","title":"Batch Bayesian Optimization for Replicable Experimental Design","created":"2023-11-02","cited_by_count":8,"area":null},{"id":"2402.12042","title":"Linear bandits with polylogarithmic minimax regret","created":"2024-02-19","cited_by_count":8,"area":null},{"id":"2210.08087","title":"Movement Penalized Bayesian Optimization with Application to Wind Energy Systems","created":"2022-10-14","cited_by_count":7,"area":null},{"id":"2312.12145","title":"OVD-Explorer: Optimism Should Not Be the Sole Pursuit of Exploration in Noisy Environments","created":"2023-12-19","cited_by_count":7,"area":null},{"id":"2402.08406","title":"Transition Constrained Bayesian Optimization via Markov Decision Processes","created":"2024-02-13","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.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":"2102.09488","title":"A Bit Better? Quantifying Information for Bandit Learning","created":"2021-02-18","cited_by_count":5,"area":null},{"id":"2201.13112","title":"Bayesian Optimization for Distributionally Robust Chance-constrained Problem","created":"2022-01-31","cited_by_count":5,"area":null},{"id":"2202.13603","title":"Optimal Online Generalized Linear Regression with Stochastic Noise and Its Application to Heteroscedastic Bandits","created":"2022-02-28","cited_by_count":5,"area":null},{"id":"2209.02211","title":"Multi-Armed Bandits with Self-Information Rewards","created":"2022-09-06","cited_by_count":5,"area":null},{"id":"2301.11588","title":"Bounding Box-based Multi-objective Bayesian Optimization of Risk Measures under Input Uncertainty","created":"2023-01-27","cited_by_count":5,"area":null},{"id":"2302.11634","title":"Provably Efficient Reinforcement Learning via Surprise Bound","created":"2023-02-22","cited_by_count":4,"area":null},{"id":"2403.04764","title":"TS-RSR: A provably efficient approach for batch Bayesian Optimization","created":"2024-03-07","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":"2511.03606","title":"Vector-valued self-normalized concentration inequalities beyond sub-Gaussianity","created":"2025-11-05","cited_by_count":4,"area":null},{"id":"2109.14412","title":"Apple Tasting Revisited: Bayesian Approaches to Partially Monitored Online Binary Classification","created":"2021-09-29","cited_by_count":3,"area":null},{"id":"2301.12357","title":"SPEED: Experimental Design for Policy Evaluation in Linear Heteroscedastic Bandits","created":"2023-01-29","cited_by_count":3,"area":null},{"id":"2306.14872","title":"Geometry-Aware Approaches for Balancing Performance and Theoretical Guarantees in Linear Bandits","created":"2023-06-26","cited_by_count":3,"area":null},{"id":"2502.16870","title":"Distributionally Robust Active Learning for Gaussian Process Regression","created":"2025-02-24","cited_by_count":3,"area":null},{"id":"2503.20341","title":"Wasserstein Distributionally Robust Bayesian Optimization with Continuous Context","created":"2025-03-26","cited_by_count":3,"area":null},{"id":"2102.04263","title":"Generalised correlated batched bandits via the ARC algorithm with application to dynamic pricing","created":"2021-02-08","cited_by_count":2,"area":null},{"id":"2203.04192","title":"Reward-Biased Maximum Likelihood Estimation for Neural Contextual Bandits","created":"2022-03-08","cited_by_count":2,"area":null},{"id":"2302.06916","title":"Effective Dimension in Bandit Problems under Censorship","created":"2023-02-14","cited_by_count":2,"area":null},{"id":"2403.10379","title":"Regret Minimization via Saddle Point Optimization","created":"2024-03-15","cited_by_count":2,"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":"2404.19292","title":"Provably Efficient Information-Directed Sampling Algorithms for Multi-Agent Reinforcement Learning","created":"2024-04-30","cited_by_count":2,"area":null},{"id":"2405.15200","title":"Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits","created":"2024-05-24","cited_by_count":2,"area":null},{"id":"2202.11735","title":"Truncated LinUCB for Stochastic Linear Bandits","created":"2022-02-23","cited_by_count":1,"area":null},{"id":"2408.15535","title":"Improving Thompson Sampling via Information Relaxation for Budgeted Multi-armed Bandits","created":"2024-08-28","cited_by_count":1,"area":null},{"id":"2510.24234","title":"Sparse Optimistic Information Directed Sampling","created":"2025-10-28","cited_by_count":1,"area":null},{"id":"2512.11580","title":"Safe Bayesian optimization across noise models via scenario programming","created":"2025-12-12","cited_by_count":1,"area":null},{"id":"2404.14602","title":"Adaptive Bayesian Optimization for High-Precision Motion Systems","created":"2024-04-22","cited_by_count":0,"area":null},{"id":"2412.15863","title":"Bayesian Optimization for Unknown Cost-Varying Variable Subsets with No-Regret Costs","created":"2024-12-20","cited_by_count":0,"area":null},{"id":"2503.05098","title":"Empirical Bound Information-Directed Sampling for Norm-Agnostic Bandits","created":"2025-03-07","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":"2512.00517","title":"No-Regret Gaussian Process Optimization of Time-Varying Functions","created":"2025-11-29","cited_by_count":0,"area":null},{"id":"2512.18409","title":"Why Most Optimism Bandit Algorithms Have the Same Regret Analysis: A Simple Unifying Theorem","created":"2025-12-20","cited_by_count":0,"area":null},{"id":"2605.09757","title":"On Uniform Error Bounds for Kernel Regression under Non-Gaussian Noise","created":"2026-05-10","cited_by_count":0,"area":null},{"id":"2605.12084","title":"Learning What Matters: Adaptive Information-Theoretic Objectives for Robot Exploration","created":"2026-05-12","cited_by_count":0,"area":null},{"id":"2606.09802","title":"Bandits for Efficient Experimentation: Adapting to Control Group, Preferences, and Context Drifts","created":"2026-06-08","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":"2610.18434","title":"Principled Design of Expected Improvement for Continuous Simulation Optimization","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}