Yanjun Han

5 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0002-8335-2364

Courant Institute of Mathematical Sciences and Center for Data Science, New York University, New York, New York 10012

Publications

• Optimal No-Regret Learning in Repeated First-Price Auctions — Operations Research 2025
• On the statistical complexity of sample amplification — The Annals of Statistics 2024 (name-matched, not ORCID-linked)
• Statistical complexity and optimal algorithms for nonlinear ridge bandits — The Annals of Statistics 2024 (name-matched, not ORCID-linked)
• Lower Bounds for Learning Distributions under Communication Constraints via Fisher Information — Journal of Machine Learning Research 2020 (name-matched, not ORCID-linked)
• Optimal rates of entropy estimation over Lipschitz balls — The Annals of Statistics 2020