Julian Zimmert
30 papers · 2018–2026 · 7 conferences · across top CS/AI conferences
Achievements
Jump to papers ↓+7 more ↓ Show less ↑
🌍 Conference Polyglot (7) 🧭 Keyword Pioneer 🐣 Hot Topic Early Bird 🌉 Interdisciplinary Bridge 🏃 Academic Marathon (6)
🌍
Conference Polyglot
(7)
🏃
Academic Marathon
(6)
🔬
Deep Specialist
(12)
🗃️
Keyword Collector
(90)
💎
Century Club
(29)
🔥
Unstoppable
(7)
⚡
Prolific Year
(7)
Conferences
NIPS (14)
ALT (4)
COLT (4)
ICML (4)
AISTATS (2)
ICLR (1)
JMLR (1)
Top co-authors
Research topics
Keywords
regret bound
(23)
multi-armed bandit
(12)
online learning
(10)
contextual bandit
(6)
adversarial bandit
(4)
model selection
(3)
adversarial learning
(3)
tsallis entropy
(2)
stochastic bandit
(2)
follow the regularized leader
(2)
reinforcement learning
(2)
optimistic algorithm
(2)
linear mdp
(2)
online mirror descent
(2)
stochastic optimization
(2)
stochastic process
(2)
thompson sampling
(2)
bandit feedback
(2)
delayed feedback
(2)
feedback graph
(2)
Papers
Efficient Opportunistic Approachability
ALT 2026
Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback
NIPS 2024
PRODuctive bandits: Importance Weighting No More
NIPS 2024
Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback
ICLR 2024
A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays
NIPS 2024
A Blackbox Approach to Best of Both Worlds in Bandits and Beyond
COLT 2023
Refined Regret for Adversarial MDPs with Linear Function Approximation
ICML 2023
Optimal cross-learning for contextual bandits with unknown context distributions
NIPS 2023
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits
NIPS 2023
Best of Both Worlds Policy Optimization
ICML 2023
A Unified Algorithm for Stochastic Path Problems
ALT 2023
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States
COLT 2022
A Model Selection Approach for Corruption Robust Reinforcement Learning
ALT 2022
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback
NIPS 2022
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality
NIPS 2022
Open Problem: Finite-Time Instance Dependent Optimality for Stochastic Online Learning with Feedback Graphs
COLT 2022
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits
COLT 2022
Efficient Methods for Online Multiclass Logistic Regression
ALT 2022
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning
NIPS 2021
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning
NIPS 2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits
JMLR 2021
The Pareto Frontier of model selection for general Contextual Bandits
NIPS 2021
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays
AISTATS 2020
Model Selection in Contextual Stochastic Bandit Problems
NIPS 2020
Adapting to Misspecification in Contextual Bandits
NIPS 2020
Online Learning for Active Cache Synchronization
ICML 2020
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously
ICML 2019
An Optimal Algorithm for Stochastic and Adversarial Bandits
AISTATS 2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio
NIPS 2019
Factored Bandits
NIPS 2018