Daniel Russo

10 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0001-5926-8624

Publications

• Impatient Bandits: Optimizing for the Long-Term Without Delay — Journal of Machine Learning Research 2026 (name-matched, not ORCID-linked)
• Global Optimality Guarantees for Policy Gradient Methods — Operations Research 2024
• Approximation Benefits of Policy Gradient Methods with Aggregated States — Management Science 2023
• A Finite Time Analysis of Temporal Difference Learning with Linear Function Approximation — Operations Research 2021
• Technical Note—A Note on the Equivalence of Upper Confidence Bounds and Gittins Indices for Patient Agents — Operations Research 2021
• On the Futility of Dynamics in Robust Mechanism Design — Operations Research 2021
• Simple Bayesian Algorithms for Best-Arm Identification — Operations Research 2020
• Deep Exploration via Randomized Value Functions — Journal of Machine Learning Research 2019 (name-matched, not ORCID-linked)
• Learning to Optimize via Information-Directed Sampling — Operations Research 2018
• An Information-Theoretic Analysis of Thompson Sampling — Journal of Machine Learning Research 2016 (name-matched, not ORCID-linked)