Jiaqi Yang

Hi! I am a senior undergraduate at the Institute for Interdisciplinary Information Sciences, Tsinghua University. I major in Computer Science and Technology (Yao Class).

During Spring 2020 and Summer 2020, I visited the University of Illinois at Urbana-Champaign, hosted by Prof. Yuan Zhou.

My research interests are broadly in theoretical machine learning, including bandits, online learning, reinforcement learning, representation learning, and deep learning. I am also interested in topics in theoretical computer science, such as online algorithm, learning-aided algorithm design, streaming algorithm, approximation algorithm, and randomized algorithm.

I am applying for graduate schools in 2020-21.

Manuscripts

1. Fully Gap-Dependent Bounds for Multinomial Logit Bandit
   Jiaqi Yang
2. Provable Benefits of Representation Learning in Linear Bandits
   Jiaqi Yang, Wei Hu, Jason D. Lee, Simon S. Du
3. Linear Bandits with Limited Adaptivity and Learning Distributional Optimal Design
   Yufei Ruan*, Jiaqi Yang*, Yuan Zhou*

Selected Awards

• • 2017.12
  • 42^nd ACM-ICPC Asia East Continent League Final, Gold Medal (1^st Place)
• • 2017.08
  • 29^th International Olympiad in Informatics, Silver Medal
• • 2016.08
  • 33^rd Chinese National Olympiad in Informatics, Gold Medal

Teaching Assistant

• Autumn 2020: Machine Learning

Contact

E-mail: yangjq17 ᴀᴛ {gmail.com, mails.tsinghua.edu.cn}