## Yanjun Han
## Recent papersNived Rajaraman, **Yanjun Han**, Jiantao Jiao, Kannan Ramchandran, “Beyond UCB: Statistical Complexity and Optimal Algorithm for Non-linear Ridge Bandits”, in preparation.Ishaq Aden-Ali, **Yanjun Han***, Jelani Nelson, Huacheng Yu, “On the amortized complexity of approximate counting”, Nov 2022.Wei Zhang, **Yanjun Han**, Zhengyuan Zhou, Aaron Flores, Tsachy Weissman, “Leveraging the Hints: Adaptive Bidding in Repeated First-Price Auctions”, NeurIPS, Nov 2022 (**Spotlight**).Yifei Wang, Tavor Baharav, **Yanjun Han**, Jiantao Jiao, David Tse, “Beyond the Best: Estimating Distribution Functionals in Infinite-Armed Bandits”, NeurIPS, Nov 2022.Nika Haghtalab, **Yanjun Han***, Abhishek Shetty, Kunhe Yang, “Oracle-Efficient Online Learning for Beyond Worst-Case Adversaries”, NeurIPS, Nov 2022 (**Designated as Oral**).Brian Axelrod, Shivam Garg, **Yanjun Han***, Vatsal Sharan, Gregory Valiant, “On the Statistical Complexity of Sample Amplification”, Jan 2022.
## ContactEmail: yjhan [at] {stanford, berkeley, mit} [dot] edu (last one preferred for now) E17-481A, IDSS, MIT |