Gellért Weisz

According to our database1, Gellért Weisz authored at least 14 papers between 2018 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Online RL in Linearly q<sup>π</sup>-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Exponential Hardness of Reinforcement Learning with Linear Function Approximation.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

2022
Confident Approximate Policy Iteration for Efficient Local Planning in q<sup>π</sup>-realizable MDPs.
CoRR, 2022

Confident Approximate Policy Iteration for Efficient Local Planning in $q^\pi$-realizable MDPs.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function.
Proceedings of the Conference on Learning Theory, 2021

Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions.
Proceedings of the Algorithmic Learning Theory, 2021

2020
ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Learning with Good Feature Representations in Bandits and in RL with a Generative Model.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Exploration-Enhanced POLITEX.
CoRR, 2019

CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Sample Efficient Deep Reinforcement Learning for Dialogue Systems With Large Action Spaces.
IEEE ACM Trans. Audio Speech Lang. Process., 2018

LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration.
Proceedings of the 35th International Conference on Machine Learning, 2018


  Loading...