Gellert Weisz
13 papers · 2018–2024 · 4 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+6 more ↓ Show less ↑
🏃 Academic Marathon (6) 🧭 Keyword Pioneer 🌉 Interdisciplinary Bridge 🌍 Conference Polyglot (4) 🐣 Hot Topic Early Bird
🏃
Academic Marathon
(6)
🐝
Cross-Pollinator
(9)
🏆
Keyword Champion
(2)
🤝
Dynamic Duo
(13)
💎
Century Club
(13)
🔥
Unstoppable
(7)
Conferences
NIPS (5)
ICML (4)
ALT (2)
COLT (2)
Top co-authors
Keywords
markov decision process
(5)
reinforcement learning
(4)
query complexity
(3)
linear function approximation
(3)
sample complexity
(3)
optimal policy
(3)
regret bound
(3)
algorithm configuration
(3)
hyperparameter optimization
(2)
linear realizability
(2)
policy iteration
(2)
function approximation
(2)
runtime optimization
(2)
action-value function
(2)
optimal control
(2)
online algorithm
(2)
minimax complexity
(1)
feature representation
(1)
approximate dynamic programming
(1)
offline reinforcement learning
(1)
Papers
Trajectory Data Suffices for Statistically Efficient Learning in Offline RL with Linear $q^\pi$-Realizability and Concentrability
NIPS 2024
Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL
NIPS 2023
Online RL in Linearly $q^\pi$-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore
NIPS 2023
Exponential Hardness of Reinforcement Learning with Linear Function Approximation
COLT 2023
Confident Approximate Policy Iteration for Efficient Local Planning in $q^\pi$-realizable MDPs
NIPS 2022
TensorPlan and the Few Actions Lower Bound for Planning in MDPs under Linear Realizability of Optimal Value Functions
ALT 2022
Exponential Lower Bounds for Planning in MDPs With Linearly-Realizable Optimal Action-Value Functions
ALT 2021
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function
COLT 2021
Learning with Good Feature Representations in Bandits and in RL with a Generative Model
ICML 2020
ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool
NIPS 2020
POLITEX: Regret Bounds for Policy Iteration using Expert Prediction
ICML 2019
CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration
ICML 2019
LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration
ICML 2018