P
PaperPicks
Conferences
Alberto Maria Metelli
29 papers at tracked venues · 20 at CORE A* · active 2024–2025
DBLP profile ↗
ORCID 0000-0002-3424-5212 ↗
Homepage ↗
Venues
ICML
×11
NeurIPS
×7
AISTATS
×4
COLT
×3
AAAI
×2
ECML-PKDD
×1
IJCAI
×1
Frequent coauthors
Alessandro Montenegro
DBLP profile ↗
ORCID search ↗
×3
Filippo Lazzati
DBLP profile ↗
ORCID search ↗
×3
Gianmarco Genalti
DBLP profile ↗
ORCID search ↗
×3
Simone Drago
DBLP profile ↗
ORCID search ↗
×3
Davide Maran
DBLP profile ↗
ORCID search ↗
×3
Alessio Russo
DBLP profile ↗
ORCID search ↗
×2
Francesco Bacchiocchi
DBLP profile ↗
ORCID search ↗
×2
Marco Mussi
DBLP profile ↗
ORCID search ↗
×2
Riccardo Poiani
DBLP profile ↗
ORCID search ↗
×2
Gianluca Drappo
DBLP profile ↗
ORCID search ↗
×1
Cristiano Migali
DBLP profile ↗
ORCID search ↗
×1
Paolo Battellani
DBLP profile ↗
ORCID search ↗
×1
Papers
Achieving $\widetilde{\mathcal{O}}(\sqrt{T})$ Regret in Average-Reward POMDPs with Known Observation Models
AISTATS 2025
·
Alessio Russo
DBLP profile ↗
ORCID search ↗
Convergence Analysis of Policy Gradient Methods with Dynamic Stochasticity
ICML 2025
·
Alessandro Montenegro
DBLP profile ↗
ORCID search ↗
Efficient Exploitation of Hierarchical Structure in Sparse Reward Reinforcement Learning
AISTATS 2025
·
Gianluca Drappo
DBLP profile ↗
ORCID search ↗
Learning Utilities from Demonstrations in Markov Decision Processes
ICML 2025
·
Filippo Lazzati
DBLP profile ↗
ORCID search ↗
Open Problem: Regret Minimization in Heavy-Tailed Bandits with Unknown Distributional Parameters
COLT 2025
·
Gianmarco Genalti
DBLP profile ↗
ORCID search ↗
Position: Constants are Critical in Regret Bounds for Reinforcement Learning
ICML 2025
·
Simone Drago
DBLP profile ↗
ORCID search ↗
Sleeping Reinforcement Learning
ICML 2025
·
Simone Drago
DBLP profile ↗
ORCID search ↗
Spectral Learning for Infinite-Horizon Average-Reward POMDPs
NeurIPS 2025
·
Alessio Russo
DBLP profile ↗
ORCID search ↗
Tightening Regret Lower and Upper Bounds in Restless Rising Bandits
NeurIPS 2025
·
Cristiano Migali
DBLP profile ↗
ORCID search ↗
Towards Theoretical Understanding of Sequential Decision Making with Preference Feedback
ICML 2025
·
Simone Drago
DBLP profile ↗
ORCID search ↗
(ε, u)-Adaptive Regret Minimization in Heavy-Tailed Bandits
COLT 2024
·
Gianmarco Genalti
DBLP profile ↗
ORCID search ↗
Autoregressive Bandits
AISTATS 2024
·
Francesco Bacchiocchi
DBLP profile ↗
ORCID search ↗
Best Arm Identification for Stochastic Rising Bandits
ICML 2024
·
Marco Mussi
DBLP profile ↗
ORCID search ↗
Dissimilarity Bandits
AISTATS 2024
·
Paolo Battellani
DBLP profile ↗
ORCID search ↗
Factored-Reward Bandits with Intermediate Observations
ICML 2024
·
Marco Mussi
DBLP profile ↗
ORCID search ↗
Graph-Triggered Rising Bandits
ICML 2024
·
Gianmarco Genalti
DBLP profile ↗
ORCID search ↗
How does Inverse RL Scale to Large State Spaces? A Provably Efficient Approach
NeurIPS 2024
·
Filippo Lazzati
DBLP profile ↗
ORCID search ↗
Interpetable Target-Feature Aggregation for Multi-task Learning Based on Bias-Variance Analysis
ECML-PKDD 2024
·
Paolo Bonetti
DBLP profile ↗
ORCID search ↗
Last-Iterate Global Convergence of Policy Gradients for Constrained Reinforcement Learning
NeurIPS 2024
·
Alessandro Montenegro
DBLP profile ↗
ORCID search ↗
Learning Optimal Deterministic Policies with Stochastic Policy Gradients
ICML 2024
·
Alessandro Montenegro
DBLP profile ↗
ORCID search ↗
Local Linearity: the Key for No-regret Reinforcement Learning in Continuous MDPs
NeurIPS 2024
·
Davide Maran
DBLP profile ↗
ORCID search ↗
No-Regret Reinforcement Learning in Smooth MDPs
ICML 2024
·
Davide Maran
DBLP profile ↗
ORCID search ↗
Offline Inverse RL: New Solution Concepts and Provably Efficient Algorithms
ICML 2024
·
Filippo Lazzati
DBLP profile ↗
ORCID search ↗
Online Learning with Off-Policy Feedback in Adversarial MDPs
IJCAI 2024
·
Francesco Bacchiocchi
DBLP profile ↗
ORCID search ↗
Optimal Multi-Fidelity Best-Arm Identification
NeurIPS 2024
·
Riccardo Poiani
DBLP profile ↗
ORCID search ↗
Parameterized Projected Bellman Operator
AAAI 2024
·
Théo Vincent
DBLP profile ↗
ORCID search ↗
Projection by Convolution: Optimal Sample Complexity for Reinforcement Learning in Continuous-Space MDPs
COLT 2024
·
Davide Maran
DBLP profile ↗
ORCID search ↗
Recent Advancements in Inverse Reinforcement Learning
AAAI 2024
·
Alberto Maria Metelli
Sub-optimal Experts mitigate Ambiguity in Inverse Reinforcement Learning
NeurIPS 2024
·
Riccardo Poiani
DBLP profile ↗
ORCID search ↗