Julian Zimmert

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 51

Top Topics

Multi Armed Bandits

Online Learning

Top Venues

Publications

Haolin Liu, Chen-Yu Wei, Julian Zimmert
Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback. ICLR (2024)
Jon Schneider, Julian Zimmert
Optimal cross-learning for contextual bandits with unknown context distributions. CoRR (2024)
Julian Zimmert, Teodor V. Marinov
Incentive-compatible Bandits: Importance Weighting No More. CoRR (2024)
Haolin Liu, Chen-Yu Wei, Julian Zimmert
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits. NeurIPS (2023)
Christoph Dann, Chen-Yu Wei, Julian Zimmert
A Blackbox Approach to Best of Both Worlds in Bandits and Beyond. COLT (2023)
Yan Dai, Haipeng Luo, Chen-Yu Wei, Julian Zimmert
Refined Regret for Adversarial MDPs with Linear Function Approximation. ICML (2023)
Christoph Dann, Chen-Yu Wei, Julian Zimmert
Best of Both Worlds Policy Optimization. CoRR (2023)
Christoph Dann, Chen-Yu Wei, Julian Zimmert
A Unified Algorithm for Stochastic Path Problems. ALT (2023)
Yan Dai, Haipeng Luo, Chen-Yu Wei, Julian Zimmert
Refined Regret for Adversarial MDPs with Linear Function Approximation. CoRR (2023)
Haolin Liu, Chen-Yu Wei, Julian Zimmert
Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback. CoRR (2023)
Christoph Dann, Chen-Yu Wei, Julian Zimmert
A Blackbox Approach to Best of Both Worlds in Bandits and Beyond. CoRR (2023)
Saeed Masoudian, Julian Zimmert, Yevgeny Seldin
An Improved Best-of-both-worlds Algorithm for Bandits with Delayed Feedback. CoRR (2023)
Jon Schneider, Julian Zimmert
Optimal cross-learning for contextual bandits with unknown context distributions. NeurIPS (2023)
Haolin Liu, Chen-Yu Wei, Julian Zimmert
Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits. CoRR (2023)
Christoph Dann, Chen-Yu Wei, Julian Zimmert
Best of Both Worlds Policy Optimization. ICML (2023)
Naman Agarwal, Satyen Kale, Julian Zimmert
Efficient Methods for Online Multiclass Logistic Regression. ALT (2022)
Julian Zimmert, Naman Agarwal, Satyen Kale
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States. CoRR (2022)
Julian Zimmert, Naman Agarwal, Satyen Kale
Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States. COLT (2022)
Teodor V. Marinov, Mehryar Mohri, Julian Zimmert
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality. CoRR (2022)
Julian Zimmert, Tor Lattimore
Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits. COLT (2022)
Christoph Dann, Chen-Yu Wei, Julian Zimmert
A Unified Algorithm for Stochastic Path Problems. CoRR (2022)
Chen-Yu Wei, Christoph Dann, Julian Zimmert
A Model Selection Approach for Corruption Robust Reinforcement Learning. ALT (2022)
Teodor Vanislavov Marinov, Mehryar Mohri, Julian Zimmert
Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality. NeurIPS (2022)
Saeed Masoudian, Julian Zimmert, Yevgeny Seldin
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback. NeurIPS (2022)
Saeed Masoudian, Julian Zimmert, Yevgeny Seldin
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback. CoRR (2022)
Christoph Dann, Mehryar Mohri, Tong Zhang, Julian Zimmert
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning. CoRR (2022)
Christoph Dann, Teodor V. Marinov, Mehryar Mohri, Julian Zimmert
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning. CoRR (2021)
Julian Zimmert, Yevgeny Seldin
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits. J. Mach. Learn. Res. 22 (2021)
Christoph Dann, Mehryar Mohri, Tong Zhang, Julian Zimmert
A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning. NeurIPS (2021)
Christoph Dann, Teodor Vanislavov Marinov, Mehryar Mohri, Julian Zimmert
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning. NeurIPS (2021)
Chen-Yu Wei, Christoph Dann, Julian Zimmert
A Model Selection Approach for Corruption Robust Reinforcement Learning. CoRR (2021)
Dylan J. Foster, Claudio Gentile, Mehryar Mohri, Julian Zimmert
Adapting to Misspecification in Contextual Bandits. CoRR (2021)
Teodor V. Marinov, Julian Zimmert
The Pareto Frontier of model selection for general Contextual Bandits. CoRR (2021)
Naman Agarwal, Satyen Kale, Julian Zimmert
Efficient Methods for Online Multiclass Logistic Regression. CoRR (2021)
Teodor Vanislavov Marinov, Julian Zimmert
The Pareto Frontier of model selection for general Contextual Bandits. NeurIPS (2021)
Julian Zimmert, Yevgeny Seldin
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. AISTATS (2020)
Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvári
Model Selection in Contextual Stochastic Bandit Problems. CoRR (2020)
Dylan J. Foster, Claudio Gentile, Mehryar Mohri, Julian Zimmert
Adapting to Misspecification in Contextual Bandits. NeurIPS (2020)
Andrey Kolobov, Sébastien Bubeck, Julian Zimmert
Online Learning for Active Cache Synchronization. CoRR (2020)
Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvári
Model Selection in Contextual Stochastic Bandit Problems. NeurIPS (2020)
Andrey Kolobov, Sébastien Bubeck, Julian Zimmert
Online Learning for Active Cache Synchronization. ICML (2020)
Julian Zimmert, Yevgeny Seldin
An Optimal Algorithm for Stochastic and Adversarial Bandits. AISTATS (2019)
Julian Zimmert, Haipeng Luo, Chen-Yu Wei
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously. ICML (2019)
Julian Zimmert, Haipeng Luo, Chen-Yu Wei
Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously. CoRR (2019)
Julian Zimmert, Yevgeny Seldin
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. CoRR (2019)
Julian Zimmert, Tor Lattimore
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio. NeurIPS (2019)
Julian Zimmert, Tor Lattimore
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio. CoRR (2019)
Julian Zimmert, Yevgeny Seldin
Factored Bandits. CoRR (2018)
Julian Zimmert, Yevgeny Seldin
An Optimal Algorithm for Stochastic and Adversarial Bandits. CoRR (2018)
Julian Zimmert, Yevgeny Seldin
Factored Bandits. NeurIPS (2018)
Maximilian Alber, Julian Zimmert, Ürün Dogan, Marius Kloft
Distributed Optimization of Multi-Class SVMs. CoRR (2016)