Christoph Dann
30 papers · 2014–2025 · 9 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 ↓+13 more ↓ Show less ↑
πΊοΈ Taxonomy Completionist (39) π Academic Marathon Β· Half π Conference Polyglot Β· Silver π Interdisciplinary Bridge Β· Silver π£ Hot Topic Early Bird
π¬
Deep Specialist
(14)
π₯
Mega-Team Β· Squad
π§¬
Topic Evolution
π
Keyword Champion
(3)
π§
Keyword Pioneer
β‘
Prolific Year Β· Productive
π
Trend Setter
π₯
Unstoppable Β· Silver
β
The Questioner
ποΈ
Keyword Collector
(142)
π
Conference Pioneer
π
Renaissance Researcher
(6)
π
Century Club Β· Bronze
Top co-authors
Research topics
Machine Learning
(24)
Optimization & Theory
(22)
Reinforcement Learning
(20)
Methods
(19)
Artificial Intelligence
(10)
Learning Types
(8)
Core AI
(6)
Mathematics & Optimization
(5)
Optimization
(5)
Applications
(3)
Bayesian & Probabilistic Β· Artificial Intelligence
(3)
Core Methods
(3)
Bayesian & Probabilistic Β· Machine Learning
(2)
Learning Paradigms
(2)
Interdisciplinary
(1)
Keywords
regret bound
(10)
reinforcement learning
(8)
multi-armed bandit
(4)
sample efficiency
(4)
tabular mdp
(3)
model selection
(3)
markov decision process
(3)
episodic reinforcement learning
(3)
suboptimality bound
(2)
rich observation
(2)
pac bound
(2)
optimistic algorithm
(2)
adversarial learning
(2)
policy optimization
(2)
value function
(2)
gradient descent
(2)
sample complexity
(2)
pac learning
(2)
transfer learning
(1)
bayesian nonparametrics
(1)
Papers
Can RLHF be More Efficient with Imperfect Reward Models? A Policy Coverage Perspective
ICML 2025
Design Considerations in Offline Preference-based RL
ICML 2025
Rate-Preserving Reductions for Blackwell Approachability
COLT 2025
A Minimaximalist Approach to Reinforcement Learning from Human Feedback
ICML 2024
Conditional Language Policy: A General Framework For Steerable Multi-Objective Finetuning
EMNLP 2024
A Unified Algorithm for Stochastic Path Problems
ALT 2023
Best of Both Worlds Policy Optimization
ICML 2023
Learning in POMDPs is Sample-Efficient with Hindsight Observability
ICML 2023
Pseudonorm Approachability and Applications to Regret Minimization
ALT 2023
Reinforcement Learning Can Be More Efficient with Multiple Rewards
ICML 2023
A Model Selection Approach for Corruption Robust Reinforcement Learning
ALT 2022
Best of Both Worlds Model Selection
NeurIPS 2022
Same Cause; Different Effects in the Brain
CLeaR 2022
Agnostic Reinforcement Learning with Low-Rank MDPs and Rich Observations
NeurIPS 2021
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning
NeurIPS 2021
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning
NeurIPS 2021
Dynamic Balancing for Model Selection in Bandits and RL
ICML 2021
Neural Active Learning with Performance Guarantees
NeurIPS 2021
Being Optimistic to Be Conservative: Quickly Learning a CVaR Policy
AAAI 2020
Reinforcement Learning with Feedback Graphs
NeurIPS 2020
Policy Certificates: Towards Accountable Reinforcement Learning
ICML 2019
Decoupling Gradient-Like Learning Rules from Representations
ICML 2018
On Oracle-Efficient PAC RL with Rich Observations
NeurIPS 2018
Sample Efficient Policy Search for Optimal Stopping Domains
IJCAI 2017
Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learning
NeurIPS 2017
Energetic Natural Gradient Descent
ICML 2016
RLPy: A Value-Function-Based Reinforcement Learning Framework for Education and Research
JMLR 2015
Sample Complexity of Episodic Fixed-Horizon Reinforcement Learning
NeurIPS 2015
The Human Kernel
NeurIPS 2015
Policy Evaluation with Temporal Differences: A Survey and Comparison
JMLR 2014