{"total":225,"rows":[{"id":"2103.10897","title":"Bilinear Classes: A Structural Framework for Provable Generalization in RL","created":"2021-03-19","cited_by_count":178,"area":null},{"id":"2306.14892","title":"Supervised Pretraining Can Learn In-Context Reinforcement Learning","created":"2023-06-26","cited_by_count":139,"area":null},{"id":"2107.06277","title":"Why Generalization in RL is Difficult: Epistemic POMDPs and Implicit Partial Observability","created":"2021-07-13","cited_by_count":109,"area":null},{"id":"2206.13687","title":"POEM: Out-of-Distribution Detection with Posterior Sampling","created":"2022-06-28","cited_by_count":108,"area":null},{"id":"2205.11140","title":"Human-in-the-loop: Provably Efficient Preference-based Reinforcement Learning with General Function Approximation","created":"2022-05-23","cited_by_count":81,"area":null},{"id":"2110.00871","title":"Feel-Good Thompson Sampling for Contextual Bandits and Reinforcement Learning","created":"2021-10-02","cited_by_count":66,"area":null},{"id":"2102.06129","title":"Meta-Thompson Sampling","created":"2021-02-11","cited_by_count":63,"area":null},{"id":"2103.04047","title":"Reinforcement Learning, Bit by Bit","created":"2021-03-06","cited_by_count":59,"area":null},{"id":"2103.02735","title":"Fairness of Exposure in Stochastic Bandits","created":"2021-03-03","cited_by_count":43,"area":null},{"id":"2210.10199","title":"Bayesian Optimization over Discrete and Mixed Spaces via Probabilistic Reparameterization","created":"2022-10-18","cited_by_count":37,"area":null},{"id":"2111.06929","title":"Hierarchical Bayesian Bandits","created":"2021-11-12","cited_by_count":35,"area":null},{"id":"2206.13063","title":"On the Complexity of Adversarial Decision Making","created":"2022-06-27","cited_by_count":33,"area":null},{"id":"2208.10904","title":"A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning","created":"2022-08-23","cited_by_count":31,"area":null},{"id":"2209.15634","title":"A General Framework for Sample-Efficient Function Approximation in Reinforcement Learning","created":"2022-09-30","cited_by_count":31,"area":null},{"id":"2107.06196","title":"No Regrets for Learning the Prior in Bandits","created":"2021-07-13","cited_by_count":30,"area":null},{"id":"2301.08215","title":"Tight Guarantees for Interactive Decision Making with the Decision-Estimation Coefficient","created":"2023-01-19","cited_by_count":30,"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":"2108.06422","title":"Metadata-based Multi-Task Bandits with Bayesian Hierarchical Models","created":"2021-08-13","cited_by_count":24,"area":null},{"id":"2110.11665","title":"Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes","created":"2021-10-22","cited_by_count":24,"area":null},{"id":"2111.11485","title":"A Free Lunch from the Noise: Provable and Practical Exploration for Representation Learning","created":"2021-11-22","cited_by_count":24,"area":null},{"id":"2207.10786","title":"Delayed Feedback in Generalised Linear Bandits Revisited","created":"2022-07-21","cited_by_count":23,"area":null},{"id":"2102.13202","title":"Online Multi-Armed Bandits with Adaptive Inference","created":"2021-02-25","cited_by_count":22,"area":null},{"id":"2205.14090","title":"Surrogate modeling for Bayesian optimization beyond a single Gaussian process","created":"2022-05-27","cited_by_count":22,"area":null},{"id":"2206.07870","title":"How to talk so AI will learn: Instructions, descriptions, and autonomy","created":"2022-06-16","cited_by_count":22,"area":null},{"id":"2206.11254","title":"Langevin Monte Carlo for Contextual Bandits","created":"2022-06-22","cited_by_count":22,"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":"2105.02344","title":"Policy Learning with Adaptively Collected Data","created":"2021-05-05","cited_by_count":21,"area":null},{"id":"2205.01970","title":"Non-Stationary Bandit Learning via Predictive Sampling","created":"2022-05-04","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":"2106.01420","title":"Parallelizing Thompson Sampling","created":"2021-06-02","cited_by_count":20,"area":null},{"id":"2211.02732","title":"Multi-Fidelity Cost-Aware Bayesian Optimization","created":"2022-11-04","cited_by_count":20,"area":null},{"id":"2110.00202","title":"Batched Thompson Sampling","created":"2021-10-01","cited_by_count":19,"area":null},{"id":"2202.01454","title":"Deep Hierarchy in Bandits","created":"2022-02-03","cited_by_count":19,"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":"2302.01513","title":"Towards Practical Preferential Bayesian Optimization with Skew Gaussian Processes","created":"2023-02-03","cited_by_count":19,"area":null},{"id":"2405.16644","title":"Gaussian Approximation and Multiplier Bootstrap for Polyak-Ruppert Averaged Linear Stochastic Approximation with Applications to TD Learning","created":"2024-05-26","cited_by_count":19,"area":null},{"id":"2102.02049","title":"On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function","created":"2021-02-03","cited_by_count":18,"area":null},{"id":"2302.07317","title":"Algorithm Selection for Deep Active Learning with Imbalanced Datasets","created":"2023-02-14","cited_by_count":18,"area":null},{"id":"2102.12661","title":"Online Learning for Unknown Partially Observable MDPs","created":"2021-02-25","cited_by_count":17,"area":null},{"id":"2112.01049","title":"Bayesian Optimization over Permutation Spaces","created":"2021-12-02","cited_by_count":17,"area":null},{"id":"2106.05335","title":"Online Learning for Stochastic Shortest Path Model via Posterior Sampling","created":"2021-06-09","cited_by_count":16,"area":null},{"id":"2106.05608","title":"Thompson Sampling with a Mixture Prior","created":"2021-06-10","cited_by_count":16,"area":null},{"id":"2107.05320","title":"Metalearning Linear Bandits by Prior Update","created":"2021-07-12","cited_by_count":16,"area":null},{"id":"2111.06067","title":"Solving Multi-Arm Bandit Using a Few Bits of Communication","created":"2021-11-11","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":"2210.01907","title":"A Self-Play Posterior Sampling Algorithm for Zero-Sum Markov Games","created":"2022-10-04","cited_by_count":16,"area":null},{"id":"2302.01511","title":"Randomized Gaussian Process Upper Confidence Bound with Tighter Bayesian Regret Bounds","created":"2023-02-03","cited_by_count":16,"area":null},{"id":"2311.03760","title":"Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds","created":"2023-11-07","cited_by_count":16,"area":null},{"id":"2102.04033","title":"A Hybrid Bandit Model with Visual Priors for Creative Ranking in Display Advertising","created":"2021-02-08","cited_by_count":15,"area":null},{"id":"2304.08944","title":"Provably Feedback-Efficient Reinforcement Learning via Active Reward Learning","created":"2023-04-18","cited_by_count":15,"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":"2205.15124","title":"Mixed-Effect Thompson Sampling","created":"2022-05-30","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":"2103.05750","title":"Regret Bounds for Generalized Linear Bandits under Parameter Drift","created":"2021-03-09","cited_by_count":13,"area":null},{"id":"2110.08627","title":"Achieving the Pareto Frontier of Regret Minimization and Best Arm Identification in Multi-Armed Bandits","created":"2021-10-16","cited_by_count":13,"area":null},{"id":"2211.08572","title":"Bayesian Fixed-Budget Best-Arm Identification","created":"2022-11-15","cited_by_count":13,"area":null},{"id":"2506.01393","title":"Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization","created":"2025-06-02","cited_by_count":13,"area":null},{"id":"2103.11489","title":"UCB-based Algorithms for Multinomial Logistic Regression Bandits","created":"2021-03-21","cited_by_count":12,"area":null},{"id":"2105.09232","title":"Diffusion Approximations for Thompson Sampling in the Small Gap Regime","created":"2021-05-19","cited_by_count":12,"area":null},{"id":"2205.01257","title":"Norm-Agnostic Linear Bandits","created":"2022-05-03","cited_by_count":12,"area":null},{"id":"2306.14834","title":"Scalable Neural Contextual Bandit for Recommender Systems","created":"2023-06-26","cited_by_count":12,"area":null},{"id":"2310.04550","title":"Module-wise Adaptive Distillation for Multimodality Foundation Models","created":"2023-10-06","cited_by_count":12,"area":null},{"id":"2311.13050","title":"Multi-fidelity Bayesian Optimization: A Review","created":"2023-11-21","cited_by_count":12,"area":null},{"id":"2504.19139","title":"Fast and Robust: Task Sampling with Posterior and Diversity Synergies for Adaptive Decision-Makers in Randomized Environments","created":"2025-04-27","cited_by_count":12,"area":null},{"id":"2206.03520","title":"Finite-Time Regret of Thompson Sampling Algorithms for Exponential Family Multi-Armed Bandits","created":"2022-06-07","cited_by_count":11,"area":null},{"id":"2310.15788","title":"qPOTS: Efficient batch multiobjective Bayesian optimization via Pareto optimal Thompson sampling","created":"2023-10-24","cited_by_count":11,"area":null},{"id":"2110.12175","title":"Analysis of Thompson Sampling for Partially Observable Contextual Multi-Armed Bandits","created":"2021-10-23","cited_by_count":10,"area":null},{"id":"2112.13254","title":"On Dynamic Pricing with Covariates","created":"2021-12-25","cited_by_count":10,"area":null},{"id":"2202.03463","title":"On learning Whittle index policy for restless bandits with scalable regret","created":"2022-02-07","cited_by_count":10,"area":null},{"id":"2207.06456","title":"Graph Neural Network Bandits","created":"2022-07-13","cited_by_count":10,"area":null},{"id":"2401.11665","title":"Accelerating Approximate Thompson Sampling with Underdamped Langevin Monte Carlo","created":"2024-01-22","cited_by_count":10,"area":null},{"id":"2103.02729","title":"Linear Bandit Algorithms with Sublinear Time Complexity","created":"2021-03-03","cited_by_count":9,"area":null},{"id":"2109.08467","title":"Online Learning of Network Bottlenecks via Minimax Paths","created":"2021-09-17","cited_by_count":9,"area":null},{"id":"2206.00494","title":"Incentivizing Combinatorial Bandit Exploration","created":"2022-06-01","cited_by_count":9,"area":null},{"id":"2212.04720","title":"Multi-Task Off-Policy Learning from Bandit Feedback","created":"2022-12-09","cited_by_count":9,"area":null},{"id":"2302.12202","title":"A Definition of Non-Stationary Bandits","created":"2023-02-23","cited_by_count":9,"area":null},{"id":"2403.00540","title":"Epsilon-Greedy Thompson Sampling to Bayesian Optimization","created":"2024-03-01","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":"2502.19006","title":"Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits","created":"2025-02-26","cited_by_count":9,"area":null},{"id":"2502.08870","title":"When and why randomised exploration works (in linear bandits)","created":"2025-02-13","cited_by_count":8,"area":null},{"id":"2104.14113","title":"Regret Bounds for Gaussian-Process Optimization in Large Domains","created":"2021-04-29","cited_by_count":7,"area":null},{"id":"2111.02314","title":"Online Learning of Energy Consumption for Navigation of Electric Vehicles","created":"2021-11-03","cited_by_count":7,"area":null},{"id":"2203.15629","title":"Stochastic Conservative Contextual Linear Bandits","created":"2022-03-29","cited_by_count":6,"area":null},{"id":"2307.10167","title":"VITS : Variational Inference Thompson Sampling for contextual bandits","created":"2023-07-19","cited_by_count":6,"area":null},{"id":"2402.17739","title":"reBandit: Random Effects based Online RL algorithm for Reducing Cannabis Use","created":"2024-02-27","cited_by_count":6,"area":null},{"id":"2411.03932","title":"Improved Regret of Linear Ensemble Sampling","created":"2024-11-06","cited_by_count":6,"area":null},{"id":"2510.13328","title":"Thompson Sampling via Fine-Tuning of LLMs","created":"2025-10-15","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":"2106.05378","title":"Feature and Parameter Selection in Stochastic Linear Bandits","created":"2021-06-09","cited_by_count":5,"area":null},{"id":"2107.01979","title":"Machine Learning for Fraud Detection in E-Commerce: A Research Agenda","created":"2021-07-05","cited_by_count":5,"area":null},{"id":"2201.01902","title":"Gaussian Imagination in Bandit Learning","created":"2022-01-06","cited_by_count":5,"area":null},{"id":"2202.00602","title":"Meta-Learning Hypothesis Spaces for Sequential Decision-making","created":"2022-02-01","cited_by_count":5,"area":null},{"id":"2204.12620","title":"Rate-Constrained Remote Contextual Bandits","created":"2022-04-26","cited_by_count":5,"area":null},{"id":"2209.07676","title":"Conservative Dual Policy Optimization for Efficient Model-Based Reinforcement Learning","created":"2022-09-16","cited_by_count":5,"area":null},{"id":"2211.13032","title":"Monte Carlo Tree Search Algorithms for Risk-Aware and Multi-Objective Reinforcement Learning","created":"2022-11-23","cited_by_count":5,"area":null},{"id":"2301.10230","title":"Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints","created":"2023-01-24","cited_by_count":5,"area":null},{"id":"2306.01990","title":"Incentivizing Exploration with Linear Contexts and Combinatorial Actions","created":"2023-06-03","cited_by_count":5,"area":null},{"id":"2306.08803","title":"Langevin Thompson Sampling with Logarithmic Communication: Bandits and Reinforcement Learning","created":"2023-06-15","cited_by_count":5,"area":null},{"id":"2310.07518","title":"Exploiting Causal Graph Priors with Posterior Sampling for Reinforcement Learning","created":"2023-10-11","cited_by_count":5,"area":null},{"id":"2402.10289","title":"Thompson Sampling in Partially Observable Contextual Bandits","created":"2024-02-15","cited_by_count":5,"area":null}],"next_cursor":"100"}