Matteo Pirotta

According to our database1, Matteo Pirotta authored at least 74 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Simple Ingredients for Offline Reinforcement Learning.
CoRR, 2024

2023
Group Fairness in Reinforcement Learning.
Trans. Mach. Learn. Res., 2023

Layered State Discovery for Incremental Autonomous Exploration.
Proceedings of the International Conference on Machine Learning, 2023

Contextual bandits with concave rewards, and an application to fair ranking.
Proceedings of the Eleventh International Conference on Learning Representations, 2023

Reaching Goals is Hard: Settling the Sample Complexity of the Stochastic Shortest Path.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

On the Complexity of Representation Learning in Contextual Linear Bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022
Smoothing policies and safe policy gradients.
Mach. Learn., 2022

Improved Adaptive Algorithm for Scalable Active Learning with Weak Labeler.
CoRR, 2022

Scalable Representation Learning in Linear Contextual Bandits with Constant Regret Guarantees.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Reduction-Based Framework for Conservative Bandits and Reinforcement Learning.
Proceedings of the Tenth International Conference on Learning Representations, 2022

Privacy Amplification via Shuffling for Linear Contextual Bandits.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Adaptive Multi-Goal Exploration.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Encrypted Linear Contextual Bandit.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

Top K Ranking for Multi-Armed Bandit with Noisy Evaluations.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2022

2021
Safe Policy Iteration: A Monotonically Improving Approximate Policy Iteration Approach.
J. Mach. Learn. Res., 2021

Gaussian Approximation for Bias Reduction in Q-Learning.
J. Mach. Learn. Res., 2021

Differentially Private Exploration in Reinforcement Learning with Linear Representation.
CoRR, 2021

A Fully Problem-Dependent Regret Lower Bound for Finite-Horizon MDPs.
CoRR, 2021

A Unified Framework for Conservative Exploration.
CoRR, 2021

Homomorphically Encrypted Linear Contextual Bandit.
CoRR, 2021

Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Provably Efficient Sample Collection Strategy for Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Reinforcement Learning in Linear MDPs: Constant Regret and Representation Selection.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Local Differential Privacy for Regret Minimization in Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Leveraging Good Representations in Linear Contextual Bandits.
Proceedings of the 38th International Conference on Machine Learning, 2021

Kernel-Based Reinforcement Learning: A Finite-Time Analysis.
Proceedings of the 38th International Conference on Machine Learning, 2021

Sample Complexity Bounds for Stochastic Shortest Path with a Generative Model.
Proceedings of the Algorithmic Learning Theory, 2021

A Kernel-Based Approach to Non-Stationary Reinforcement Learning in Metric Spaces.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
On the use of the policy gradient and Hessian in inverse reinforcement learning.
Intelligenza Artificiale, 2020

Local Differentially Private Regret Minimization in Reinforcement Learning.
CoRR, 2020

Improved Analysis of UCRL2 with Empirical Bernstein Inequality.
CoRR, 2020

Learning Adaptive Exploration Strategies in Dynamic Environments Through Informed Policy Regularization.
CoRR, 2020

Regret Bounds for Kernel-Based Reinforcement Learning.
CoRR, 2020

Exploration-Exploitation in Constrained MDPs.
CoRR, 2020

Concentration Inequalities for Multinoulli Random Variables.
CoRR, 2020

Exploiting Language Instructions for Interpretable and Compositional Reinforcement Learning.
CoRR, 2020

Active Model Estimation in Markov Decision Processes.
Proceedings of the Thirty-Sixth Conference on Uncertainty in Artificial Intelligence, 2020

An Asymptotically Optimal Primal-Dual Incremental Algorithm for Contextual Linear Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Improved Sample Complexity for Incremental Autonomous Exploration in MDPs.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adversarial Attacks on Linear Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

No-Regret Exploration in Goal-Oriented Reinforcement Learning.
Proceedings of the 37th International Conference on Machine Learning, 2020

Frequentist Regret Bounds for Randomized Least-Squares Value Iteration.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Conservative Exploration in Reinforcement Learning.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

Improved Algorithms for Conservative Exploration in Bandits.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Frequentist Regret Bounds for Randomized Least-Squares Value Iteration.
CoRR, 2019

Exploration Bonus for Regret Minimization in Discrete and Continuous Average Reward MDPs.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Regret Bounds for Learning State Representations in Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

2018
Exploration Bonus for Regret Minimization in Undiscounted Discrete and Continuous Markov Decision Processes.
CoRR, 2018

Near Optimal Exploration-Exploitation in Non-Communicating Markov Decision Processes.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Does Reinforcement Learning outperform PID in the control of FES-induced elbow flex-extension?
Proceedings of the 2018 IEEE International Symposium on Medical Measurements and Applications, 2018

Importance Weighted Transfer of Samples in Reinforcement Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

Stochastic Variance-Reduced Policy Gradient.
Proceedings of the 35th International Conference on Machine Learning, 2018

Efficient Bias-Span-Constrained Exploration-Exploitation in Reinforcement Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Manifold-based multi-objective policy search with sample reuse.
Neurocomputing, 2017

Cost-Sensitive Approach to Batch Size Adaptation for Gradient Descent.
CoRR, 2017

Gradient-based minimization for multi-expert Inverse Reinforcement Learning.
Proceedings of the 2017 IEEE Symposium Series on Computational Intelligence, 2017

Adaptive Batch Size for Safe Policy Gradients.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Compatible Reward Inverse Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Regret Minimization in MDPs with Options without Prior Knowledge.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Boosted Fitted Q-Iteration.
Proceedings of the 34th International Conference on Machine Learning, 2017

Estimating the Maximum Expected Value in Continuous Reinforcement Learning Problems.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Reinforcement learning: from theory to algorithms.
PhD thesis, 2016

Policy Search for the Optimal Control of Markov Decision Processes: A Novel Particle-Based Iterative Scheme.
IEEE Trans. Cybern., 2016

Multi-objective Reinforcement Learning through Continuous Pareto Manifold Approximation.
J. Artif. Intell. Res., 2016

Inverse Reinforcement Learning through Policy Gradient Minimization.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Policy gradient in Lipschitz Markov Decision Processes.
Mach. Learn., 2015

Following Newton direction in Policy Gradient with parameter exploration.
Proceedings of the 2015 International Joint Conference on Neural Networks, 2015

Optimal control to reduce emissions in gasoline engines: an iterative learning control approach for ECU calibration maps improvement.
Proceedings of the 14th European Control Conference, 2015

Multi-Objective Reinforcement Learning with Continuous Pareto Frontier Approximation.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Policy gradient approaches for multi-objective sequential decision making.
Proceedings of the 2014 International Joint Conference on Neural Networks, 2014

Policy gradient approaches for multi-objective sequential decision making: A comparison.
Proceedings of the 2014 IEEE Symposium on Adaptive Dynamic Programming and Reinforcement Learning, 2014

2013
Adaptive Step-Size for Policy Gradient Methods.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

Safe Policy Iteration.
Proceedings of the 30th International Conference on Machine Learning, 2013

2011
Fitted policy search.
Proceedings of the 2011 IEEE Symposium on Adaptive Dynamic Programming And Reinforcement Learning, 2011


  Loading...