Publications

* stands for the alphabetical order.

Preprints

• Nika Haghtalab, Yanjun Han*, Abhishek Shetty, Kunhe Yang, “Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries”, Feb 2022.

• Brian Axelrod, Shivam Garg, Yanjun Han*, Vatsal Sharan, Gregory Valiant, “On the Statistical Complexity of Sample Amplification”, Jan 2022.

• Nived Rajaraman, Yanjun Han, Lin F. Yang, Kannan Ramchandran, Jiantao Jiao, “Provably Breaking the Quadratic Error Compounding Barrier in Imitation Learning, Optimally”, Feb 2021.

• Yanjun Han, Zhengyuan Zhou, Aaron Flores, Erik Ordentlich, Tsachy Weissman, “Learning to Bid Optimally and Efficiently in Adversarial First-price Auctions”, Jul 2020. (slides) (video)

• Yanjun Han, Zhengqing Zhou, Zhengyuan Zhou, Jose Blanchet, Peter Glynn, Yinyu Ye, “Sequential Batch Learning in Finite-Action Linear Contextual Bandits”, Apr 2020.

• Yanjun Han, Zhengyuan Zhou, Tsachy Weissman, “Optimal No-regret Learning in Repeated First-price Auctions”, Mar 2020. (slides) (video)

Publications

• Yanjun Han*, Soham Jana, Yihong Wu, “Optimal prediction of Markov chains with and without spectral gap”, Conference on Neural Information Processing Systems (NeurIPS), Dec 2021.

• Nived Rajaraman, Yanjun Han, Lin F. Yang, Jingbo Liu, Jiantao Jiao, Kannan Ramchandran, “On the Value of Interaction and Function Approximation in Imitation Learning”, Conference on Neural Information Processing Systems (NeurIPS), Dec 2021.

• Yanjun Han, Kedar Tatwawadi, Zhengqing Zhou, Gowtham Kurri, Vinod Prabhakaran, Tsachy Weissman, “Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation”, IEEE Transactions on Information Theory, Dec 2021. (ISIT’21) (slides) (video)

• Yanjun Han, Ayfer Ozgur, Tsachy Weissman, “Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraints”, IEEE Transactions on Information Theory, Dec 2021. (COLT’18) (ISIT’18) (COLT slides) (ISIT slides)
  (Errata: Earlier versions (including the conference proceeding) of this paper had a mistake in the lower bound argument for blackboard communication protocols, and the journal version fixes it. Also see the errata.)

• Wei Zhang, Brendan Kitts, Yanjun Han, Zhengyuan Zhou, Tingyu Mao, Hao He, Shengjun Pan, Aaron Flores, San Gultekin, Tsachy Weissman, “MEOW: A Space-Efficient Non-Parametric Bid Shading Algorithm”, ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), Aug 2021.

• Xi Chen, Yanjun Han*, Yining Wang, “Adversarial Combinatorial Bandits with General Non-linear Reward Functions”, International Conference on Machine Learning (ICML), Jul 2021. (slides) (poster)

• Yanjun Han, “On the High Accuracy Limitation of Adaptive Property Estimation”, International Conference on Artificial Intelligence and Statistics (AISTATS), Apr 2021. (slides) (poster) (video)

• Yanjun Han, Kirankumar Shiragur, “On the Competitive Analysis and High Accuracy Optimality of Profile Maximum Likelihood”, Symposium on Discrete Algorithms (SODA), Jan 2021. (slides) (video)

• Yanjun Han, Jiantao Jiao, Tsachy Weissman, Yihong Wu, “Optimal Rates of Entropy Estimation over Lipschitz Balls”, the Annals of Statistics, Dec 2020. (AoS Special Invited Session at JSM 2021) (slides)

• Zijun Gao, Yanjun Han, “Minimax Optimal Nonparametric Estimation of Heterogeneous Treatment Effects”, Conference on Neural Information Processing Systems (NeurIPS) (Spotlight), Dec 2020. (slides)

• Yanjun Han, Jiantao Jiao, Tsachy Weissman, “Minimax Estimation of KL Divergence between Discrete Distributions”, Journal on Selected Areas in Information Theory, Nov 2020. (an earlier version) (ISITA’16, Student Paper Award) (slides) (code)

• Leighton Barnes, Yanjun Han, Ayfer Ozgur, “Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information”, Journal of Machine Learning Research, Oct 2020. (ISIT’19)

• Jayadev Acharya, Clement L. Canonne, Yanjun Han*, Ziteng Sun, Himanshu Tyagi, “Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit”, Conference on Learning Theory (COLT), Jul 2020. (short slides) (long slides) (video)

• Jiantao Jiao, Yanjun Han, “Bias Correction with Jackknife, Bootstrap, and Taylor Series”, IEEE Transactions on Information Theory, Jul 2020.

• Yanjun Han, Jiantao Jiao, Rajarshi Mukherjee, “On Estimation of $L_r$-norms in Gaussian White Noise Models”, Probability Theory and Related Fields, Jun 2020. (slides)

• Yanjun Han, Constrained Functional Value under General Convexity Conditions with Applications to Distributed Simulation, International Symposium on Information Theory (ISIT), Jun 2020. (slides)

• Zijun Gao, Yanjun Han*, Zhimei Ren, Zhengqing Zhou, “Batched Multi-armed Bandits Problem”, Conference on Neural Information Processing Systems (NeurIPS) (Oral), Dec 2019. (slides) (poster)

• Jiantao Jiao, Yanjun Han, Irena Fischer-Hwang, Tsachy Weissman, “Estimating the Fundamental Limits is Easier than Achieving the Fundamental Limits”, IEEE Transactions on Information Theory, Oct 2019.

• Yanjun Han, Guanyang Wang, “Expectation of the Largest Bet Size in the Labouchere System”, Electronic Communications in Probability, Feb 2019.

• Yanjun Han*, Jiantao Jiao, Chuan-Zheng Lee, Tsachy Weissman, Yihong Wu, Tiancheng Yu, “Entropy Rate Estimation for Markov Chains with Large State Space”, Conference on Neural Information Processing Systems (NIPS) (Spotlight), Dec 2018. (slides) (poster)

• Jiantao Jiao, Weihao Gao, Yanjun Han, “The Nearest Neighbor Information Estimator is Adaptively Near Minimax Rate-Optimal”, Conference on Neural Information Processing Systems (NIPS) (Spotlight), Dec 2018. (slides) (poster)

• Jiantao Jiao, Yanjun Han, Tsachy Weissman, “Minimax Estimation of the Distance”, IEEE Transactions on Information Theory, Oct 2018. (ISIT’16, Best Student Paper Finalist)

• Yanjun Han, Jiantao Jiao, Tsachy Weissman, “Local Moment Matching: a Unified Methodology for Symmetric Functional Estimation and Distribution Estimation under Wasserstein Distance”, Conference on Learning Theory (COLT), Jul 2018. (COLT slides) (Long slides)

• Jiantao Jiao, Yanjun Han, Tsachy Weissman, “Generalizations of Maximal Inequalities to Arbitrary Selection Rules”, Statistics & Probability Letters, Jan 2018. (ISIT’17)

• Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman, “Maximum Likelihood Estimation of Functionals of Discrete Distributions”, IEEE Transactions on Information Theory, Oct 2017. (ISIT’15a) (ISIT’15b)

• Yanjun Han*, Or Ordentlich, Ofer Shayevitz, “Mutual Information Bounds via Adjacency Events”, IEEE Transactions on Information Theory, Nov 2016.

• Yanjun Han, Yuan Shen, Xiao-Ping Zhang, Moe Z. Win, Huadong Meng, “Performance Limits and Geometric Properties of Array Localization”, IEEE Transactions on Information Theory, Feb 2016. (ICASSP’14)

• Yanjun Han, Jiantao Jiao, Tsachy Weissman, “Minimax Estimation of Discrete Distributions under $ell_1$ Loss”, IEEE Transactions on Information Theory, Nov 2015. (ISIT’15)

• Jiayi Zhang, Linglong Dai, Yanjun Han, Yu Zhang, Zhaocheng Wang, “On the Ergodic Capacity of MIMO Free-Space Optical Systems over Turbulence Channels”, IEEE Journal on Selected Areas in Communications, Sept 2015.

• Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman, “Minimax Estimation of Functionals of Discrete Distributions”, IEEE Transactions on Information Theory, May 2015. (ISIT’15) (code)

Technical Reports

• Yanjun Han, Jiantao Jiao, Tsachy Weissman, “Adaptive Estimation of Shannon Entropy”, Feb 2015. (ISIT’15) (slides)

• Jiantao Jiao, Kartik Venkat, Yanjun Han, Tsachy Weissman, “Beyond Maximum Likelihood: from Theory to Practice”, Sept 2014. (Asilomar’16)