Gellert Weisz
13 papers · 2018–2024 · 4 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+5 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🌍 Conference Polyglot · Bronze 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Silver 🗺️ Taxonomy Completionist (18)
🤝
Dynamic Duo
(13)
🗃️
Keyword Collector
(52)
📈
Trend Setter
💎
Century Club · Bronze
🔥
Unstoppable · Bronze
Venues
Top co-authors
Research topics
Keywords
markov decision process
(5)
sample complexity
(4)
reinforcement learning
(4)
algorithm configuration
(3)
query complexity
(3)
linear function approximation
(3)
optimal policy
(3)
regret bound
(3)
linear realizability
(2)
policy iteration
(2)
hyperparameter optimization
(2)
optimal control
(2)
function approximation
(2)
online reinforcement learning
(2)
action-value function
(2)
online algorithm
(2)
runtime optimization
(2)
approximate dynamic programming
(1)
natural policy gradient
(1)
value iteration
(1)
Papers
Trajectory Data Suffices for Statistically Efficient Learning in Offline RL with Linear q^π-Realizability and Concentrability
NeurIPS 2024
Exponential Hardness of Reinforcement Learning with Linear Function Approximation
COLT 2023
Online RL in Linearly q^π-Realizable MDPs Is as Easy as in Linear MDPs If You Learn What to Ignore
NeurIPS 2023
Optimistic Natural Policy Gradient: a Simple Efficient Policy Optimization Framework for Online RL
NeurIPS 2023
Confident Approximate Policy Iteration for Efficient Local Planning in q^π-realizable MDPs
NeurIPS 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
ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool
NeurIPS 2020
Learning with Good Feature Representations in Bandits and in RL with a Generative Model
ICML 2020
CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration
ICML 2019
POLITEX: Regret Bounds for Policy Iteration using Expert Prediction
ICML 2019
LeapsAndBounds: A Method for Approximately Optimal Algorithm Configuration
ICML 2018