Christoph Dann
30 papers · 2014–2025 · 9 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+13 more ↓ Show less ↑
🐣 Hot Topic Early Bird 🌍 Conference Polyglot (9) 🌉 Interdisciplinary Bridge 🧭 Keyword Pioneer 🏃 Academic Marathon (11)
🌈
Renaissance Researcher
(6)
🌉
Interdisciplinary Bridge
🌍
Conference Polyglot
(9)
👥
Mega-Team
(20)
🔬
Deep Specialist
(13)
🏆
Keyword Champion
(2)
🗃️
Keyword Collector
(118)
⚡
Prolific Year
(5)
🚀
Conference Pioneer
💎
Century Club
(30)
🔥
Unstoppable
(12)
📈
Trend Setter
❓
The Questioner
Conferences
ICML (10)
NIPS (10)
ALT (3)
JMLR (2)
AAAI (1)
CLEAR (1)
COLT (1)
EMNLP (1)
IJCAI (1)
Top co-authors
Keywords
regret bound
(10)
reinforcement learning
(7)
sample efficiency
(4)
multi-armed bandit
(4)
tabular mdp
(3)
model selection
(3)
episodic reinforcement learning
(3)
sub-optimality bound
(2)
rich observation
(2)
pac bound
(2)
optimistic algorithm
(2)
value function
(2)
sample complexity
(2)
policy optimization
(2)
markov decision process
(2)
gradient descent
(2)
pac learning
(2)
adversarial learning
(2)
cognitive modeling
(1)
bayesian nonparametrics
(1)
Papers
Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective
ICML 2025
Rate-Preserving Reductions for Blackwell Approachability
COLT 2025
Design Considerations in Offline Preference-based RL
ICML 2025
Conditional Language Policy: A General Framework For Steerable Multi-Objective Finetuning
EMNLP 2024
A Minimaximalist Approach to Reinforcement Learning from Human Feedback
ICML 2024
Reinforcement Learning Can Be More Efficient with Multiple Rewards
ICML 2023
Best of Both Worlds Policy Optimization
ICML 2023
Pseudonorm Approachability and Applications to Regret Minimization
ALT 2023
A Unified Algorithm for Stochastic Path Problems
ALT 2023
Learning in POMDPs is Sample-Efficient with Hindsight Observability
ICML 2023
Same Cause; Different Effects in the Brain
CLEAR 2022
A Model Selection Approach for Corruption Robust Reinforcement Learning
ALT 2022
Best of Both Worlds Model Selection
NIPS 2022
Neural Active Learning with Performance Guarantees
NIPS 2021
Dynamic Balancing for Model Selection in Bandits and RL
ICML 2021
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning
NIPS 2021
Agnostic Reinforcement Learning with Low-Rank MDPs and Rich Observations
NIPS 2021
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning
NIPS 2021
Being Optimistic to Be Conservative: Quickly Learning a CVaR Policy
AAAI 2020
Reinforcement Learning with Feedback Graphs
NIPS 2020
Policy Certificates: Towards Accountable Reinforcement Learning
ICML 2019
On Oracle-Efficient PAC RL with Rich Observations
NIPS 2018
Decoupling Gradient-Like Learning Rules from Representations
ICML 2018
Sample Efficient Policy Search for Optimal Stopping Domains
IJCAI 2017
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning
NIPS 2017
Energetic Natural Gradient Descent
ICML 2016
RLPy: A Value-Function-Based Reinforcement Learning Framework for Education and Research
JMLR 2015
The Human Kernel
NIPS 2015
Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning
NIPS 2015
Policy Evaluation with Temporal Differences: A Survey and Comparison
JMLR 2014