Skip to content
conftrace_

Andrea Tirinzoni

25 papers · 2018–2025 · 8 venues · across top CS/AI venues

Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.

Jump to papers ↓
+8 more ↓ πŸ—ΊοΈ Taxonomy Completionist (43) 🌍 Conference Polyglot Β· Silver πŸƒ Academic Marathon Β· Sprint πŸŒ‰ Interdisciplinary Bridge Β· Silver 🐣 Hot Topic Early Bird
πŸ† Keyword Champion (2) πŸ† Grand Slam 🀝 Dynamic Duo (12) ⚑ Prolific Year Β· Productive πŸ”₯ Unstoppable Β· Bronze πŸ’Ž Century Club Β· Bronze πŸ“ˆ Trend Setter πŸ—ƒοΈ Keyword Collector (121)

Papers

Temporal Difference Flows ICML 2025 Zero-Shot Whole-Body Humanoid Control via Behavioral Foundation Models ICLR 2025 Fast Imitation via Behavior Foundation Models ICLR 2024 Simple Ingredients for Offline Reinforcement Learning ICML 2024 Active Coverage for PAC Reinforcement Learning COLT 2023 Layered State Discovery for Incremental Autonomous Exploration ICML 2023 On the Complexity of Representation Learning in Contextual Linear Bandits AISTATS 2023 Optimistic PAC Reinforcement Learning: the Instance-Dependent View ALT 2023 Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path ALT 2023 Near Instance-Optimal PAC Reinforcement Learning for Deterministic MDPs NeurIPS 2022 On Elimination Strategies for Bandit Fixed-Confidence Identification NeurIPS 2022 Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees NeurIPS 2022 Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification NeurIPS 2021 Leveraging Good Representations in Linear Contextual Bandits ICML 2021 Meta-Reinforcement Learning by Tracking Task Non-stationarity IJCAI 2021 Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection NeurIPS 2021 An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits NeurIPS 2020 A Novel Confidence-Based Algorithm for Structured Bandits AISTATS 2020 Gradient-Aware Model-Based Policy Search AAAI 2020 Sequential Transfer in Reinforcement Learning with a Generative Model ICML 2020 Truly Batch Model-Free Inverse Reinforcement Learning about Multiple Intentions AISTATS 2020 Transfer of Samples in Policy Search via Multiple Importance Sampling ICML 2019 Importance Weighted Transfer of Samples in Reinforcement Learning ICML 2018 Policy-Conditioned Uncertainty Sets for Robust Markov Decision Processes NeurIPS 2018 Transfer of Value Functions via Variational Methods NeurIPS 2018