Julian Zimmert

65 papers A* 24A 2B 3Journal 36

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Efficient Opportunistic Approachability. CoRR Teodor Vanislavov Marinov, Mehryar Mohri, Princewill Okoroafor, Jon Schneider, Julian Zimmert
2026	J	`jnl`	TBDFiltering: Sample-Efficient Tree-Based Data Filtering. CoRR Róbert Istvan Busa-Fekete, Julian Zimmert, Anne Xiangyi Zheng, Claudio Gentile, András György
2025	A*	`conf`	A Scalable Crawling Algorithm Utilizing Noisy Change-Indicating Signals. WWW Julian Zimmert, Róbert Busa-Fekete, András György, Linhai Qiu, Hyomin Choi, Tzu-Wei Sung, Hao Shen, Sharmila Subramaniam, Li Xiao
2025	J	`jnl`	A Scalable Crawling Algorithm Utilizing Noisy Change-Indicating Signals. CoRR Róbert Busa-Fekete, Julian Zimmert, András György, Linhai Qiu, Tzu-Wei Sung, Hao Shen, Hyomin Choi, Sharmila Subramaniam, Li Xiao
2025	J	`jnl`	An Improved Model-Free Decision-Estimation Coefficient with Applications in Adversarial MDPs. CoRR Haolin Liu, Chen-Yu Wei, Julian Zimmert
2025	J	`jnl`	Beyond the Rosetta Stone: Unification Forces in Generalization Dynamics. CoRR Carter Blum, Katja Filippova, Ann Yuan, Asma Ghandeharioun, Julian Zimmert, Fred Zhang, Jessica Hoffmann, Tal Linzen, Martin Wattenberg, Lucas Dixon, Mor Geva
2025	J	`jnl`	Contextual Dynamic Pricing with Heterogeneous Buyers. CoRR Thodoris Lykouris, Sloan Nietert, Princewill Okoroafor, Chara Podimata, Julian Zimmert
2025	A*	`conf`	Decision Making in Hybrid Environments: A Model Aggregation Approach. COLT Haolin Liu, Chen-Yu Wei, Julian Zimmert
2025	J	`jnl`	Decision Making in Hybrid Environments: A Model Aggregation Approach. CoRR Haolin Liu, Chen-Yu Wei, Julian Zimmert
2025	J	`jnl`	Non-stationary Bandit Convex Optimization: A Comprehensive Study. CoRR Xiaoqi Liu, Dorian Baudry, Julian Zimmert, Patrick Rebeschini, Arya Akhavan
2024	A*	`conf`	A Best-of-both-worlds Algorithm for Bandits with Delayed Feedback with Robustness to Excessive Delays. NeurIPS Saeed Masoudian, Julian Zimmert, Yevgeny Seldin
2024	A*	`conf`	Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback. NeurIPS Haolin Liu, Zakaria Mhammedi, Chen-Yu Wei, Julian Zimmert
2024	J	`jnl`	Beating Adversarial Low-Rank MDPs with Unknown Transition and Bandit Feedback. CoRR Haolin Liu, Zakaria Mhammedi, Chen-Yu Wei, Julian Zimmert
2024	J	`jnl`	Incentive-compatible Bandits: Importance Weighting No More. CoRR Julian Zimmert, Teodor V. Marinov
2024	J	`jnl`	Optimal cross-learning for contextual bandits with unknown context distributions. CoRR Jon Schneider, Julian Zimmert
2024	A*	`conf`	PRODuctive bandits: Importance Weighting No More. NeurIPS Julian Zimmert, Teodor Vanislavov Marinov
2024	A*	`conf`	Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback. ICLR Haolin Liu, Chen-Yu Wei, Julian Zimmert
2023	A*	`conf`	A Blackbox Approach to Best of Both Worlds in Bandits and Beyond. COLT Christoph Dann, Chen-Yu Wei, Julian Zimmert
2023	J	`jnl`	A Blackbox Approach to Best of Both Worlds in Bandits and Beyond. CoRR Christoph Dann, Chen-Yu Wei, Julian Zimmert
2023	B	`conf`	A Unified Algorithm for Stochastic Path Problems. ALT Christoph Dann, Chen-Yu Wei, Julian Zimmert
2023	J	`jnl`	An Improved Best-of-both-worlds Algorithm for Bandits with Delayed Feedback. CoRR Saeed Masoudian, Julian Zimmert, Yevgeny Seldin
2023	A*	`conf`	Best of Both Worlds Policy Optimization. ICML Christoph Dann, Chen-Yu Wei, Julian Zimmert
2023	J	`jnl`	Best of Both Worlds Policy Optimization. CoRR Christoph Dann, Chen-Yu Wei, Julian Zimmert
2023	A*	`conf`	Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits. NeurIPS Haolin Liu, Chen-Yu Wei, Julian Zimmert
2023	J	`jnl`	Bypassing the Simulator: Near-Optimal Adversarial Linear Contextual Bandits. CoRR Haolin Liu, Chen-Yu Wei, Julian Zimmert
2023	A*	`conf`	Optimal cross-learning for contextual bandits with unknown context distributions. NeurIPS Jon Schneider, Julian Zimmert
2023	A*	`conf`	Refined Regret for Adversarial MDPs with Linear Function Approximation. ICML Yan Dai, Haipeng Luo, Chen-Yu Wei, Julian Zimmert
2023	J	`jnl`	Refined Regret for Adversarial MDPs with Linear Function Approximation. CoRR Yan Dai, Haipeng Luo, Chen-Yu Wei, Julian Zimmert
2023	J	`jnl`	Towards Optimal Regret in Adversarial Linear MDPs with Bandit Feedback. CoRR Haolin Liu, Chen-Yu Wei, Julian Zimmert
2022	A*	`conf`	A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback. NeurIPS Saeed Masoudian, Julian Zimmert, Yevgeny Seldin
2022	J	`jnl`	A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback. CoRR Saeed Masoudian, Julian Zimmert, Yevgeny Seldin
2022	B	`conf`	A Model Selection Approach for Corruption Robust Reinforcement Learning. ALT Chen-Yu Wei, Christoph Dann, Julian Zimmert
2022	J	`jnl`	A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning. CoRR Christoph Dann, Mehryar Mohri, Tong Zhang, Julian Zimmert
2022	J	`jnl`	A Unified Algorithm for Stochastic Path Problems. CoRR Christoph Dann, Chen-Yu Wei, Julian Zimmert
2022	B	`conf`	Efficient Methods for Online Multiclass Logistic Regression. ALT Naman Agarwal, Satyen Kale, Julian Zimmert
2022	A*	`conf`	Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States. COLT Julian Zimmert, Naman Agarwal, Satyen Kale
2022	J	`jnl`	Pushing the Efficiency-Regret Pareto Frontier for Online Learning of Portfolios and Quantum States. CoRR Julian Zimmert, Naman Agarwal, Satyen Kale
2022	A*	`conf`	Return of the bias: Almost minimax optimal high probability bounds for adversarial linear bandits. COLT Julian Zimmert, Tor Lattimore
2022	A*	`conf`	Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality. NeurIPS Teodor Vanislavov Marinov, Mehryar Mohri, Julian Zimmert
2022	J	`jnl`	Stochastic Online Learning with Feedback Graphs: Finite-Time and Asymptotic Optimality. CoRR Teodor V. Marinov, Mehryar Mohri, Julian Zimmert
2021	J	`jnl`	A Model Selection Approach for Corruption Robust Reinforcement Learning. CoRR Chen-Yu Wei, Christoph Dann, Julian Zimmert
2021	A*	`conf`	A Provably Efficient Model-Free Posterior Sampling Method for Episodic Reinforcement Learning. NeurIPS Christoph Dann, Mehryar Mohri, Tong Zhang, Julian Zimmert
2021	J	`jnl`	Adapting to Misspecification in Contextual Bandits. CoRR Dylan J. Foster, Claudio Gentile, Mehryar Mohri, Julian Zimmert
2021	A*	`conf`	Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning. NeurIPS Christoph Dann, Teodor Vanislavov Marinov, Mehryar Mohri, Julian Zimmert
2021	J	`jnl`	Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning. CoRR Christoph Dann, Teodor V. Marinov, Mehryar Mohri, Julian Zimmert
2021	J	`jnl`	Efficient Methods for Online Multiclass Logistic Regression. CoRR Naman Agarwal, Satyen Kale, Julian Zimmert
2021	A*	`conf`	The Pareto Frontier of model selection for general Contextual Bandits. NeurIPS Teodor Vanislavov Marinov, Julian Zimmert
2021	J	`jnl`	The Pareto Frontier of model selection for general Contextual Bandits. CoRR Teodor V. Marinov, Julian Zimmert
2021	J	`jnl`	Tsallis-INF: An Optimal Algorithm for Stochastic and Adversarial Bandits. J. Mach. Learn. Res. Julian Zimmert, Yevgeny Seldin
2020	A*	`conf`	Adapting to Misspecification in Contextual Bandits. NeurIPS Dylan J. Foster, Claudio Gentile, Mehryar Mohri, Julian Zimmert
2020	A	`conf`	An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. AISTATS Julian Zimmert, Yevgeny Seldin
2020	A*	`conf`	Model Selection in Contextual Stochastic Bandit Problems. NeurIPS Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvári
2020	J	`jnl`	Model Selection in Contextual Stochastic Bandit Problems. CoRR Aldo Pacchiano, My Phan, Yasin Abbasi-Yadkori, Anup Rao, Julian Zimmert, Tor Lattimore, Csaba Szepesvári
2020	A*	`conf`	Online Learning for Active Cache Synchronization. ICML Andrey Kolobov, Sébastien Bubeck, Julian Zimmert
2020	J	`jnl`	Online Learning for Active Cache Synchronization. CoRR Andrey Kolobov, Sébastien Bubeck, Julian Zimmert
2019	J	`jnl`	An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. CoRR Julian Zimmert, Yevgeny Seldin
2019	A	`conf`	An Optimal Algorithm for Stochastic and Adversarial Bandits. AISTATS Julian Zimmert, Yevgeny Seldin
2019	A*	`conf`	Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously. ICML Julian Zimmert, Haipeng Luo, Chen-Yu Wei
2019	J	`jnl`	Beating Stochastic and Adversarial Semi-bandits Optimally and Simultaneously. CoRR Julian Zimmert, Haipeng Luo, Chen-Yu Wei
2019	A*	`conf`	Connections Between Mirror Descent, Thompson Sampling and the Information Ratio. NeurIPS Julian Zimmert, Tor Lattimore
2019	J	`jnl`	Connections Between Mirror Descent, Thompson Sampling and the Information Ratio. CoRR Julian Zimmert, Tor Lattimore
2018	J	`jnl`	An Optimal Algorithm for Stochastic and Adversarial Bandits. CoRR Julian Zimmert, Yevgeny Seldin
2018	A*	`conf`	Factored Bandits. NeurIPS Julian Zimmert, Yevgeny Seldin
2018	J	`jnl`	Factored Bandits. CoRR Julian Zimmert, Yevgeny Seldin
2016	J	`jnl`	Distributed Optimization of Multi-Class SVMs. CoRR Maximilian Alber, Julian Zimmert, Ürün Dogan, Marius Kloft