Johannes Kirschner
15 papers · 2018–2023 · 8 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+9 more ↓ Show less ↑
π£ Hot Topic Early Bird π Conference Polyglot (8) π Interdisciplinary Bridge π§ Keyword Pioneer π Academic Marathon (5)
π£
Hot Topic Early Bird
π
Cross-Pollinator
(8)
π€
Dynamic Duo
(11)
π
Triple Crown
π
Grand Slam
π
Century Club
(15)
π
Trend Setter
β‘
Prolific Year
(5)
ποΈ
Keyword Collector
(68)
Conferences
COLT (3)
NIPS (3)
AISTATS (2)
ICLR (2)
ICML (2)
AAAI (1)
ALT (1)
JMLR (1)
Top co-authors
Keywords
bayesian optimization
(5)
regret bound
(4)
contextual bandit
(2)
information directed sampling
(2)
partial monitoring
(2)
upper confidence bound
(2)
linear bandit
(2)
acquisition function
(2)
kernelized bandit
(2)
information-directed sampling
(2)
stochastic bandit
(2)
linear function approximation
(1)
sequential decision-making
(1)
strongly convex
(1)
experimental design
(1)
regret minimization
(1)
adversarial robustness
(1)
multi-agent reinforcement learning
(1)
sample complexity
(1)
ucb algorithm
(1)
Papers
Regret Minimization via Saddle Point Optimization
NIPS 2023
Managing Temporal Resolution in Continuous Value Estimation: A Fundamental Trade-off
NIPS 2023
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
Near-optimal Policy Identification in Active Reinforcement Learning
ICLR 2023
Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback
ALT 2021
Asymptotically Optimal Information-Directed Sampling
COLT 2021
Bias-Robust Bayesian Optimization via Dueling Bandits
ICML 2021
Information Directed Sampling for Linear Partial Monitoring
COLT 2020
Experimental Design for Optimization of Orthogonal Projection Pursuit Models
AAAI 2020
Distributionally Robust Bayesian Optimization
AISTATS 2020
Stochastic Bandits with Context Distributions
NIPS 2019
Information-Directed Exploration for Deep Reinforcement Learning
ICLR 2019
Adaptive and Safe Bayesian Optimization in High Dimensions via One-Dimensional Subspaces
ICML 2019
Information Directed Sampling and Bandits with Heteroscedastic Noise
COLT 2018