News

  • Our manuscript Efficient Cloud Server Deployment Under Demand Uncertainty was recently accepted by Manufacturing & Service Operations Management. This paper is a collaboration with Microsoft Research.
  • I gave a talk at School of Economics and Management at Tsinghua University on August 2, 2024.
  • I won National Championship in Splendor (original version) hosted by Hunter Board Game Club in Beijing, China on July 27, 2024!
  • I gave a talk at Rideshare Seminar at Lyft on June 6, 2024.
  • I appeared in this Business Insider article on Shein's plan to sell its supply chain tech on June 6, 2024.
  • I gave a talk at Duke University's Fuqua School of Business Operations Management Seminar on April 12, 2024.
  • I appeared in this Wall Street Journal article on Material Suppliers' Next Moves on April 10, 2024.
  • I was interviewed by the Optimizing You Podcast in April, 2024.
  • I appeared in this Forbes article on Sustainable Tourism on October 13, 2023.
  • I am excited to receive Best Dissertation Prize at the Annual Supply Chain Management in the Post-Pandemic and AI Age Conference in June, 2023.
  • I gave a talk at University of Toronto's Rotman School of Management's OM&S Data Science Seminar on April 29, 2023.

Research

“How Not to Overpackage? -- AI for Sustainability in HelloFresh's Service Supply Chain.”.
Preprint

Bandits Atop Reinforcement Learning: Tackling Online Inventory Models With Cyclic Demands.
Published in Management Science, 70(9), 2024. pp. 5627-6482.

Publication

Efficient Cloud Server Deployment Under Demand Uncertainty.
Accepted at Manufacturing & Service Operations Management.

Preprint

Online Assortment Optimization with Reusable Resources.
Published in Management Science, 68(7), 2022. pp. 4772-4785.

Publication

Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits.
Accepted at Neural Information Processing Systems (NeurIPS).

Preprint

A Fast Maximum Flow Algorithm.
Published in Networks, Nov 2020.
Published in Special Issue on Celebrating 50 Years of Networks: Part 2.

Publication

Provably More Efficient Q-Learning in the One-Sided-Feedback/Full-Feedback Settings.
Accepted in ICML Workshop (Theoretical Foundations of Reinforcement Learning).

Website

Efficient Entropy For Policy Gradient with Multi-Dimensional Action Space.
Accepted in ICLR Workshop.

Website

Recent Invited Talks

Purdue Operations Conference
August 25, 2024 How Not to Overpackage? -- AI for Sustainability in HelloFresh's Service Supply Chain.
Tsinghua University Economics and Management Seminar
August 2, 2024 How Not to Overpackage? -- AI for Sustainability in HelloFresh's Service Supply Chain.
Lyft Rideshare Seminar
June 6, 2024 How Not to Overpackage? -- AI for Sustainability in HelloFresh's Service Supply Chain.
Duke University Fuqua Operations Management Seminar
Apr 12, 2024 How Not to Overpackage? -- Towards a Sustainable HelloFresh Service Supply Chain.
CMU SQUALL Seminar
Apr 8, 2024 How Not to Overpackage? -- Towards a Sustainable HelloFresh Service Supply Chain.
YinzOR 2023 Conference
Aug 26, 2023 Provably Optimal Reinforcement Learning for Inventory Problems with Unknown Cyclic Demands
Supply Chain Management in the Post-Pandemic and AI Age Conference
Jun 13, 2023 Data-Driven Decision Making in Operations Management
University of Toronto Rotman OM&S Data Science Seminar
Apr 29, 2023 Bandits Atop Reinforcement Learning: Tackling Online Inventory Models With Cyclic Demands
Wharton OID Seminar
Mar 18, 2022 Bandits Atop Reinforcement Learning: Tackling Online Inventory Models With Cyclic Demands
MIT Data Science Lab Seminar
Oct 18, 2021 Bandits Atop Reinforcement Learning: Tackling Online Inventory Models With Cyclic Demands
MIT ORC Student Seminar
Sep 24, 2021 Provably Optimal Reinforcement Learning for Online Inventory Models With Cyclic Demands
Google Intern Research Talks
Jul 22, 2021 Provably Optimal Reinforcement Learning for Online Inventory Models With Cyclic Demands
Spotlight Session at Annual INFORMS Revenue Management and Pricing Section Conference
Jun 30, 2021 Online Assortment Optimization with Reusable Resources
MIT LIDS & Stats Tea Talk
Apr 28, 2021 Provably More Efficient Q-Learning in the One-Sided-Feedback/Full-Feedback Settings

Awards

  • China's National Championship in Splendor (original version) hosted by Hunter Board Game Club, 2024
  • First Place in the Best Dissertation Competition, Supply Chain Management in the Post-Pandemic and AI Age Conference, 2023
  • Recipient, Accenture Fellowship, 2022 - 2023
  • Bayer Women in Operations Research Scholarship Recipient, INFORMS Analytics Society, 2021
  • Best Presentation Award, MIT LIDS Student Conference, 2019
  • Grand Prize, MIT Lockheed Martin Tech for Truth Hackathon (Supply Chain Track), 2019
  • Winner, MIT IDEAS Global Challenge, 2018
  • ARCC Best Social Good Hack Prize, MIT Bitcoin Hackathon, 2018
  • NYU Shanghai Provost’s Award, NYU Shanghai, 2017
  • Summa Cum Laude, New York University, 2017
  • NYU President’s Service Award, New York University, 2016
  • Resolution Fellowship, Resolution Project at Youth Assembly at the United Nations Headquarters, 2016
  • Best Venture, NYU Reynolds Changemaker Challenge, 2015

Teaching

I taught 70371 Operations Management at the Tepper School of Business at Carnegie Mellon University in Spring 2024.

Professional Services

Reviewer for Management Science, Operations Research, Manufacturing & Service Operations Management, Mathematics of Operations Research and others.

Reviewer for the 26th Conference on Integer Programming and Combinatorial Optimization (IPCO 2025).

Committee Member for 2024 INFORMS Service Science Best Student Paper Award.

Judge for 2024 CSAMSE Best Paper Competition.

Session Chair for INFORMS Annual Meeting 2024.

Session Chair for INFORMS Annual Meeting 2023.

Session Co-chair for INFORMS Annual Meeting 2021.