{"total":19,"rows":[{"id":"2206.04640","title":"Regret Bounds for Information-Directed Reinforcement Learning","created":"2022-06-09","cited_by_count":24,"area":null},{"id":"2211.05632","title":"Contexts can be Cheap: Solving Stochastic Contextual Bandits with Linear Bandit Algorithms","created":"2022-11-08","cited_by_count":19,"area":null},{"id":"2205.10895","title":"Contextual Information-Directed Sampling","created":"2022-05-22","cited_by_count":16,"area":null},{"id":"2211.05964","title":"Thompson Sampling for High-Dimensional Sparse Linear Contextual Bandits","created":"2022-11-11","cited_by_count":16,"area":null},{"id":"2302.03319","title":"Leveraging Demonstrations to Improve Online Learning: Quality Matters","created":"2023-02-07","cited_by_count":13,"area":null},{"id":"2205.13450","title":"Variance-Aware Sparse Linear Bandits","created":"2022-05-26","cited_by_count":11,"area":null},{"id":"2302.04452","title":"An Information-Theoretic Analysis of Nonstationary Bandit Learning","created":"2023-02-09","cited_by_count":11,"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":"2410.02068","title":"Fast and Sample Efficient Multi-Task Representation Learning in Stochastic Contextual Bandits","created":"2024-10-02","cited_by_count":6,"area":null},{"id":"2405.16581","title":"On Bits and Bandits: Quantifying the Regret-Information Trade-off","created":"2024-05-26","cited_by_count":3,"area":null},{"id":"2205.14829","title":"Adaptive Sampling for Discovery","created":"2022-05-30","cited_by_count":2,"area":null},{"id":"2206.04091","title":"Uplifting Bandits","created":"2022-06-08","cited_by_count":2,"area":null},{"id":"2401.11565","title":"Thompson Sampling for Stochastic Bandits with Noisy Contexts: An Information-Theoretic Regret Analysis","created":"2024-01-21","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":"2302.00814","title":"Stochastic Contextual Bandits with Long Horizon Rewards","created":"2023-02-02","cited_by_count":1,"area":null},{"id":"2405.14038","title":"FLIPHAT: Joint Differential Privacy for High Dimensional Sparse Linear Bandits","created":"2024-05-22","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":"2303.03348","title":"Thompson Sampling for Linear Bandit Problems with Normal-Gamma Priors","created":"2023-03-06","cited_by_count":0,"area":null},{"id":"2609.33981","title":"Future Information-Directed Sampling for Bayesian Nonstationary Bandits","created":"2026-09-27","cited_by_count":0,"area":null}],"next_cursor":null}