{"total":15,"rows":[{"id":"2103.04047","title":"Reinforcement Learning, Bit by Bit","created":"2021-03-06","cited_by_count":59,"area":null},{"id":"2107.02237","title":"Efficient First-Order Contextual Bandits: Prediction, Allocation, and Triangular Discrimination","created":"2021-07-05","cited_by_count":53,"area":null},{"id":"2112.03432","title":"First-Order Regret in Reinforcement Learning with Linear Function Approximation: A Robust Estimation Approach","created":"2021-12-07","cited_by_count":38,"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":"2206.04640","title":"Regret Bounds for Information-Directed Reinforcement Learning","created":"2022-06-09","cited_by_count":24,"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.02072","title":"Deciding What to Model: Value-Equivalent Sampling for Reinforcement Learning","created":"2022-06-04","cited_by_count":19,"area":null},{"id":"2110.13973","title":"The Value of Information When Deciding What to Learn","created":"2021-10-26","cited_by_count":15,"area":null},{"id":"2310.20007","title":"Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning","created":"2023-10-30","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":"2201.01902","title":"Gaussian Imagination in Bandit Learning","created":"2022-01-06","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":"2510.24234","title":"Sparse Optimistic Information Directed Sampling","created":"2025-10-28","cited_by_count":1,"area":null},{"id":"2506.01685","title":"Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts","created":"2025-06-02","cited_by_count":0,"area":null}],"next_cursor":null}