{"total":38,"rows":[{"id":"2103.04047","title":"Reinforcement Learning, Bit by Bit","created":"2021-03-06","cited_by_count":59,"area":null},{"id":"2206.13063","title":"On the Complexity of Adversarial Decision Making","created":"2022-06-27","cited_by_count":33,"area":null},{"id":"2206.04640","title":"Regret Bounds for Information-Directed Reinforcement Learning","created":"2022-06-09","cited_by_count":24,"area":null},{"id":"2101.06197","title":"Deciding What to Learn: A Rate-Distortion Approach","created":"2021-01-15","cited_by_count":23,"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":"2206.02072","title":"Deciding What to Model: Value-Equivalent Sampling for Reinforcement Learning","created":"2022-06-04","cited_by_count":19,"area":null},{"id":"2207.14550","title":"Best-of-Both-Worlds Algorithms for Partial Monitoring","created":"2022-07-29","cited_by_count":19,"area":null},{"id":"2310.00806","title":"Bayesian Design Principles for Frequentist Sequential Learning","created":"2023-10-01","cited_by_count":18,"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":"2302.10805","title":"Repeated Bilateral Trade Against a Smoothed Adversary","created":"2023-02-21","cited_by_count":15,"area":null},{"id":"2101.09855","title":"Weak Signal Asymptotics for Sequentially Randomized Experiments","created":"2021-01-25","cited_by_count":14,"area":null},{"id":"2202.10997","title":"Minimax Regret for Partial Monitoring: Infinite Outcomes and Rustichini's Regret","created":"2022-02-22","cited_by_count":14,"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":"2506.10341","title":"Formalizing Learning from Language Feedback with Provable Guarantees","created":"2025-06-12","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":"2210.06380","title":"Near-Optimal Multi-Agent Learning for Safe Coverage Control","created":"2022-10-12","cited_by_count":11,"area":null},{"id":"2106.04887","title":"Interaction-Grounded Learning","created":"2021-06-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":"2310.20007","title":"Improved Bayesian Regret Bounds for Thompson Sampling in Reinforcement Learning","created":"2023-10-30","cited_by_count":7,"area":null},{"id":"2302.10831","title":"Minimax-Bayes Reinforcement Learning","created":"2023-02-21","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.01902","title":"Gaussian Imagination in Bandit Learning","created":"2022-01-06","cited_by_count":5,"area":null},{"id":"2202.06694","title":"Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences","created":"2022-02-14","cited_by_count":5,"area":null},{"id":"2306.02971","title":"Online Learning with Feedback Graphs: The True Shape of Regret","created":"2023-06-05","cited_by_count":5,"area":null},{"id":"2301.12038","title":"STEERING: Stein Information Directed Exploration for Model-Based Reinforcement Learning","created":"2023-01-28","cited_by_count":4,"area":null},{"id":"2305.03263","title":"Bayesian Reinforcement Learning with Limited Cognitive Load","created":"2023-05-05","cited_by_count":4,"area":null},{"id":"2106.00444","title":"Minimax Regret for Bandit Convex Optimisation of Ridge Functions","created":"2021-06-01","cited_by_count":3,"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":"2402.08321","title":"Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring","created":"2024-02-13","cited_by_count":3,"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":"2405.20028","title":"A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds","created":"2024-05-30","cited_by_count":3,"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":"2412.06079","title":"Learning from Snapshots of Discrete and Continuous Data Streams","created":"2024-12-08","cited_by_count":2,"area":null},{"id":"2510.19158","title":"Instance-Dependent Regret Bounds for Nonstochastic Linear Partial Monitoring","created":"2025-10-22","cited_by_count":1,"area":null},{"id":"2309.02425","title":"On the Minimax Regret in Online Ranking with Top-k Feedback","created":"2023-09-05","cited_by_count":0,"area":null},{"id":"2610.19804","title":"Efficient contextual partial monitoring with general function approximation","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}