{"total":19,"rows":[{"id":"2102.05406","title":"Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approach","created":"2021-02-10","cited_by_count":98,"area":null},{"id":"2210.09579","title":"Unpacking Reward Shaping: Understanding the Benefits of Reward Engineering on Sample Complexity","created":"2022-10-18","cited_by_count":62,"area":null},{"id":"2110.03580","title":"A Model Selection Approach for Corruption Robust Reinforcement Learning","created":"2021-10-07","cited_by_count":45,"area":null},{"id":"2302.09739","title":"A Blackbox Approach to Best of Both Worlds in Bandits and Beyond","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2104.03781","title":"Leveraging Good Representations in Linear Contextual Bandits","created":"2021-04-08","cited_by_count":29,"area":null},{"id":"2212.03798","title":"Stochastic Rising Bandits","created":"2022-12-07","cited_by_count":18,"area":null},{"id":"2102.06593","title":"Pareto Optimal Model Selection in Linear Bandits","created":"2021-02-12","cited_by_count":14,"area":null},{"id":"2206.14912","title":"Best of Both Worlds Model Selection","created":"2022-06-29","cited_by_count":11,"area":null},{"id":"2306.02869","title":"Data-Driven Online Model Selection With Regret Guarantees","created":"2023-06-05","cited_by_count":11,"area":null},{"id":"2402.01632","title":"Time-Varying Gaussian Process Bandits with Unknown Prior","created":"2024-02-02","cited_by_count":11,"area":null},{"id":"2410.10384","title":"Bayesian Optimisation with Unknown Hyperparameters: Regret Bounds Logarithmically Closer to Optimal","created":"2024-10-14","cited_by_count":7,"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":"2210.13083","title":"Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees","created":"2022-10-24","cited_by_count":5,"area":null},{"id":"2112.02185","title":"Neural Pseudo-Label Optimism for the Bank Loan Problem","created":"2021-12-03","cited_by_count":3,"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":"2411.14446","title":"Rising Rested Bandits: Lower Bounds and Efficient Algorithms","created":"2024-11-06","cited_by_count":2,"area":null},{"id":"2502.01226","title":"Adaptive Prior Selection in Gaussian Process Bandits with Thompson Sampling","created":"2025-02-03","cited_by_count":2,"area":null},{"id":"2411.06069","title":"Model Selection for Average Reward RL with Application to Utility Maximization in Repeated Games","created":"2024-11-09","cited_by_count":1,"area":null},{"id":"2102.05164","title":"Nonstochastic Bandits with Infinitely Many Experts","created":"2021-02-09","cited_by_count":0,"area":null}],"next_cursor":null}