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.
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
πΊοΈ 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)
Top co-authors
Research topics
Machine Learning
(19)
Reinforcement Learning
(14)
Methods
(13)
Optimization & Theory
(13)
Artificial Intelligence
(12)
Learning Types Β· Machine Learning
(11)
Core AI
(7)
Mathematics & Optimization
(6)
Learning Paradigms
(6)
Optimization
(6)
Core Methods
(5)
Deep Learning
(4)
Learning Types Β· Deep Learning
(3)
Application Areas
(1)
Applications
(1)
Keywords
sample complexity
(8)
regret bound
(4)
representation learning
(4)
transfer learning
(4)
markov decision process
(4)
pac reinforcement learning
(3)
reinforcement learning
(3)
imitation learning
(3)
constant regret
(2)
instance-dependent bound
(2)
multi-armed bandit
(2)
contextual bandit
(2)
exploration policy
(2)
contextual linear bandit
(2)
variational inference
(2)
policy search
(2)
generative model
(2)
optimistic algorithm
(2)
policy gradient
(2)
flow matching
(1)
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