Computer Science Department, Princeton University

Address: 35 Olden Street, Princeton, NJ, 08540,

E-mail: firstname at cs dot princeton dot edu

Office: 416, CS building

Hi! I am currently a fourth-year graduate student at Princeton University, advised by Professor Sanjeev Arora. I am broadly interested in algorithm design and machine learning, including non-convex optimization, deep learning, natural language processing, distributed optimization, convex relaxation (e.g. sum of squares hierarchy), etc. Before coming to U.S, I studied at Andrew Chi-Chih Yao's CS pilot class at Tsinghua University.

2016-2017 Siebel Scholarship

2016-2017 Dodds Fellowship

2015 Wu Prizes for Excellence

2015- IBM PhD Fellowship

2014-2016 Simons Award for Graduate Students in Theoretical Computer Science

2010.12 8th Place in Putnam Mathematical Competition (Putnam10)

2007.07 Silver Medal in 47th International Mathematical Olympiad (IMO07)

with Rong Ge and Jason D. Lee

NIPS (oral), 2016

A non-generative theory for unsupervised learning and efficient improper dictionary learning

with Elad Hazan

NIPS, 2016

with Sanjeev Arora, Yuanzhi Li, Yingyu Liang, and Andrej Risteski

manuscript, 2016

Gradient Descent Learns Linear Dynamical Systems

with Moritz Hardt and Benjamin Recht

manuscript, 2016

Polynomial-time Tensor Decompositions with Sum-of-squares

with Jonathan Shi and David Steurer

FOCS, 2016

with Sanjeev Arora, Rong Ge, Frederic Koehler, and Ankur Moitra

ICML 2016

with Sanjeev Arora, Yuanzhi Li, Yingyu Liang and Andrej Risteski

Transactions of the Association for Computational Linguistics(TACL)

with Mark Braverman, Ankit Garg, Huy L. Nguyen and David P. Woodruff

STOC 2016

with Sanjeev Arora and Yingyu Liang

manuscript, 2015

with Avi Wigderson

NIPS 2015

with Rong Ge

RANDOM/APPROX 2015

with Dan Garber,
and Elad Hazan

ICML 2015

with Sanjeev Arora, Rong Ge and Ankur Moitra

COLT 2015

with Ankit Garg and Huy Nguyễn

NIPS 2014, oral presentation

with Sanjeev Arora, Aditya Bhaskara and Rong Ge

ICML 2014

Sum-of-squares Algorithms for Over-complete Tensor Decomposition

IAS CSDM seminar, Mar 2016, Princeton, USA

Communication Lower Bounds For Statistical Estimation Problems via a Distributed Data Processing Inequality

STOC, Jun 2016, Boston, USA

Invited talk at CISS, Mar 2016, Princeton, USA

The Linear Algebraic Structure of Word Meanings

UW Theory seminar, Apr 2016, Madison, USA

MSR Talk Series, Nov 2015, Redmond, USA

Analyzing Non-convex Optimization for Dictionary Learning

ICML, July 2015, Lille, France

MSR Redmond, Nev 2014, Redmond, USA

Dagstuhl Seminar, Sep 2014, Dagstuhl, Germany

On Communication Cost of Distributed Statistical Estimation and Dimensionality

NIPS, Dec 2014, Montreal, Canada

Provable Bounds for Learning Some Deep Representations

ICML, Jun 2014, Beijing, China

Columbia theory lunch, Feb 2014, NYC, USA

CMU theory lunch, Feb 2014, Pittsburgh, USA

The simulate greedy algorithm for several submodular matroid secretary problems

30th Symposium on Theoretical Aspects of Computer Science(STACS), Kiel, Germany, Feb 2013

A new variation of hat guessing games

17th International Computing and Combinatorics Conference(COCOON), Dallas, Texas, Aug 2011

Journal refereeing: Journal of Machine Learning Research, Mathematics of Operations Research, IEEE transaction on Information theory, Optimization Methods and Software, Theoretical Computer Science

Conference refereeing: STOC, FOCS, ICML, NIPS, COLT, SODA, ISSAC