Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
Arnab Maiti*, Zhiyuan Fan*, Kevin Jamieson, Lillian J. Ratliff, Gabriele Farina
Accepted at the 38th Annual Conference on Learning Theory (COLT 2025).

On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive‑Form Games
Zhiyuan Fan, Christian Kroer, Gabriele Farina
Accepted at the 38th Annual Conference on Neural Information Processing Systems (NeurIPS 2024).

Achieving Constant Regret in Linear Markov Decision Processes
Weitong Zhang*, Zhiyuan Fan*, Jiafan He, Quanquan Gu
Accepted at the 38th Annual Conference on Neural Information Processing Systems (NeurIPS 2024).

Efficient Algorithms for Sparse Moment Problems without Separation
Zhiyuan Fan*, Jian Li*
Accepted at the 36th Annual Conference on Learning Theory (COLT 2023).

On the Interplay Between Misspecification and Sub‑optimality Gap in Linear Contextual Bandits
Weitong Zhang, Jiafan He, Zhiyuan Fan, Quanquan Gu
Accepted at the 40th International Conference on Machine Learning (ICML 2023).

OpenFE: Automated Feature Generation beyond Expert‑level Performance
Tianping Zhang, Zheyu Zhang, Zhiyuan Fan, Haoyan Luo, Fengyuan Liu, Wei Cao, Jian Li
Accepted at the 40th International Conference on Machine Learning (ICML 2023).

The Exact Complexity of Pseudorandom Functions and the Black-box Natural Proof Barrier for Bootstrapping Results in Computational Complexity
Zhiyuan Fan*, Jiatu Li*, Tianqi Yang*
Accepted at the 54th Annual ACM Symposium on Theory of Computing (STOC 2022).
Best Student Paper co‑winner