Andrea Zanette

According to our database1, Andrea Zanette authored at least 13 papers between 2018 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Provable Benefits of Actor-Critic Methods for Offline Reinforcement Learning.
CoRR, 2021

Design of Experiments for Stochastic Contextual Linear Bandits.
CoRR, 2021

Exponential Lower Bounds for Batch Reinforcement Learning: Batch RL can be Exponentially Harder than Online RL.
Proceedings of the 38th International Conference on Machine Learning, 2021

Cautiously Optimistic Policy Optimization and Exploration with Linear Function Approximation.
Proceedings of the Conference on Learning Theory, 2021

2020
Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning Near Optimal Policies with Low Inherent Bellman Error.
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

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

Limiting Extrapolation in Linear Approximate Value Iteration.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Almost Horizon-Free Structure-Aware Best Policy Identification with a Generative Model.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Tighter Problem-Dependent Regret Bounds in Reinforcement Learning without Domain Knowledge using Value Function Bounds.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Robust Super-Level Set Estimation Using Gaussian Processes.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

Problem Dependent Reinforcement Learning Bounds Which Can Identify Bandit Structure in MDPs.
Proceedings of the 35th International Conference on Machine Learning, 2018


  Loading...