Johannes Kirschner
15 papers · 2018–2023 · 8 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 ↓+6 more ↓ Show less ↑
🗺️ Taxonomy Completionist (27) 🌍 Conference Polyglot · Silver 🏃 Academic Marathon · Sprint 🌉 Interdisciplinary Bridge · Bronze 🐣 Hot Topic Early Bird
👑
Triple Crown
🏆
Grand Slam
🤝
Dynamic Duo
(11)
⚡
Prolific Year · Productive
🗃️
Keyword Collector
(75)
💎
Century Club · Bronze
Top co-authors
Research topics
Machine Learning
(14)
Optimization & Theory
(12)
Learning Types
(8)
Reinforcement Learning
(5)
Artificial Intelligence
(4)
Mathematics & Optimization
(4)
Methods
(4)
Optimization
(4)
Applications
(3)
Core AI
(3)
Bayesian & Probabilistic · Machine Learning
(1)
Bayesian & Probabilistic · Artificial Intelligence
(1)
Core Methods
(1)
Keywords
information-directed sampling
(6)
regret bound
(5)
bayesian optimization
(5)
sequential decision making
(3)
upper confidence bound
(3)
acquisition function
(2)
heteroscedastic noise
(2)
contextual bandit
(2)
linear bandit
(2)
stochastic bandit
(2)
multi-armed bandit
(2)
partial monitoring
(2)
kernelized bandit
(2)
experimental design
(1)
exploration-exploitation tradeoff
(1)
adversarial robustness
(1)
regret minimization
(1)
distributional reinforcement learning
(1)
policy evaluation
(1)
multi-agent reinforcement learning
(1)
Papers
Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning
AISTATS 2023
Linear Partial Monitoring for Sequential Decision Making: Algorithms, Regret Bounds and Applications
JMLR 2023
Managing Temporal Resolution in Continuous Value Estimation: A Fundamental Trade-off
NeurIPS 2023
Near-optimal Policy Identification in Active Reinforcement Learning
ICLR 2023
Regret Minimization via Saddle Point Optimization
NeurIPS 2023
Asymptotically Optimal Information-Directed Sampling
COLT 2021
Bias-Robust Bayesian Optimization via Dueling Bandits
ICML 2021
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback
ALT 2021
Distributionally Robust Bayesian Optimization
AISTATS 2020
Experimental Design for Optimization of Orthogonal Projection Pursuit Models
AAAI 2020
Information Directed Sampling for Linear Partial Monitoring
COLT 2020
Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces
ICML 2019
Information-Directed Exploration for Deep Reinforcement Learning
ICLR 2019
Stochastic Bandits with Context Distributions
NeurIPS 2019
Information Directed Sampling and Bandits with Heteroscedastic Noise
COLT 2018