Julian Zimmert

According to our database1, Julian Zimmert authored at least 27 papers between 2016 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback.
CoRR, 2023

An Improved Best-of-both-worlds Algorithm for Bandits with Delayed Feedback.
CoRR, 2023

Optimal cross-learning for contextual bandits with unknown context distributions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Best of Both Worlds Policy Optimization.
Proceedings of the International Conference on Machine Learning, 2023

Refined Regret for Adversarial MDPs with Linear Function Approximation.
Proceedings of the International Conference on Machine Learning, 2023

A Blackbox Approach to Best of Both Worlds in Bandits and Beyond.
Proceedings of the Thirty Sixth Annual Conference on Learning Theory, 2023

A Unified Algorithm for Stochastic Path Problems.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States.
Proceedings of the Conference on Learning Theory, 2-5 July 2022, London, UK., 2022

A Model Selection Approach for Corruption Robust Reinforcement Learning.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

Efficient Methods for Online Multiclass Logistic Regression.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021
Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits.
J. Mach. Learn. Res., 2021

The Pareto Frontier of model selection for general Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
Model Selection in Contextual Stochastic Bandit Problems.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adapting to Misspecification in Contextual Bandits.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Online Learning for Active Cache Synchronization.
Proceedings of the 37th International Conference on Machine Learning, 2020

An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Connections Between Mirror Descent, Thompson Sampling and the Information Ratio.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously.
Proceedings of the 36th International Conference on Machine Learning, 2019

An Optimal Algorithm for Stochastic and Adversarial Bandits.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

2018
Factored Bandits.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2016
Distributed Optimization of Multi-Class SVMs.
CoRR, 2016


  Loading...