Stata Center. 32 Vassar Street

Cambridge, MA 02139

Office G32-578

jerryzli AT mit DOT edu

My CV (last updated 4/25/2016)I am a Ph.D student studying theoretical computer science at MIT. My advisor is Ankur Moitra. I did my masters at MIT under the wonderful supervision of Nir Shavit. I am partially supported by an NSF Graduate Research Fellowship. My primary research interests are in learning theory and distributed algorithms, but I am broadly interested in many other things in TCS. I particularly like applications of analysis and analytic techniques to TCS problems.

As an undergrad at the University of Washington, I worked on complexity of branching programs, and how we could prove hardness of techniques used for naturally arising learning problems in database theory and AI.

In my free time I enjoy being remarkably mediocre at ultimate frisbee, chess, and piano, amongst other things.

**Robust Sparse Estimation Tasks in High Dimensions**

Jerry Li

manuscript

*Note: the arXiv version improves the rate for robust sparse PCA over a preliminary draft which was circulated***The Power of Choice in Priority Scheduling**

Dan Alistarh, Justin Kopinsky, Jerry Li, Giorgi Nadiradze

manuscript**ZipML: An End-to-end Bitwise Framework for Dense Generalized Linear Models**

(by contribution) Hantian Zhang, Kaan Kara, Jerry Li, Dan Alistarh, Ji Liu, Ce Zhang

manuscript

**Efficient and Optimally Robust Learning of High-Dimensional Gaussians**

Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, Alistair Stewart

manuscript

**A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k**

Jerry Li, Ludwig Schmidt.

manuscript

**Exact Model Counting of Query Expressions: Limitations of Propositional Methods**

Paul Beame, Jerry Li, Sudeepa Roy, Dan Suciu.

to appear,*ACM Transactions on Database Systems*

**Sample Optimal Density Estimation in Nearly-Linear Time**

Jayadev Acharya, Ilias Diakonikolas, Jerry Li, Ludwig Schmidt.

SODA 2017

TCS+ talk by Ilias, which discussed the piecewise polynomial framework and our results at a high level

**QSGD: Randomized Quantization for Communication-Optimal Stochastic Gradient Descent**

Dan Alistarh, Jerry Li, Ryota Tomioka, Milan Vojnovic

preliminary version in OPT 2016

**Robust Estimators in High Dimensions, without the Computational Intractability**

Ilias Diakonikolas, Gautam Kamath, Daniel Kane, Jerry Li, Ankur Moitra, Alistair Stewart

FOCS 2016

Invited to Highlights of Algorithms 2017

**Invited to appear in special issue of SIAM Journal on Computing for FOCS 2016.**

MIT News, USC Viterbi News**Fast Algorithms for Segmented Regression**

Jayadev Acharya, Ilias Diakonikolas, Jerry Li, Ludwig Schmidt

ICML 2016

**Replacing Mark Bits with Randomness in Fibonacci Heaps**

Jerry Li, John Peebles.

ICALP 2015

**Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms**

Jayadev Acharya, Ilias Diakonikolas, Chinmay Hegde, Jerry Li, Ludwig Schmidt.

PODS 2015

**The SprayList: A Scalable Relaxed Priority Queue**

Dan Alistarh, Justin Kopinsky, Jerry Li, Nir Shavit.

PPoPP 2015,**Best Artifact Award**

See also the full version

Slashdot, MIT News**On the Importance of Registers for Computability**

Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit.

OPODIS 2014

The following two papers are subsumed by the journal paper **Model Counting of Query Expressions: Limitations of Propositional Methods**

Paul Beame, Jerry Li, Sudeepa Roy, Dan Suciu.

ICDT 2014

**Invited to appear in special issue of ACM Transactions on Database Systems for ICDT 2014.****Lower bounds for exact model counting and applications in probabilistic databases**

Paul Beame, Jerry Li, Sudeepa Roy, and Dan Suciu.

UAI 2013, selected for plenary presentation.

**The SprayList: A Scalable Relaxed Priority Queue**

Jerry Li.

Master's thesis

**Solutions of the Stochastic Dirichlet Problem**

Jerry Li.

My undergraduate thesis, a literature review of the basics of stochastic calculus

**Tracking Serial Criminals with a Road Metric**

Mark Bun, Jerry Li, Ian Zemke.

Our 2010 MCM submission, which was awarded an Outstanding Winner prize (the top prize).

**Robust Estimators In High Dimensions without the Computational Intractability**[slides]

**Fast Algorithms for Segmented Regression**[slides]

ICML 2016 [video]

**Fast and Near-Optimal Algorithms for Approximating Distributions by Histograms**[slides]

PODS 2015

**Model Counting of Query Expressions: Limitations of Propositional Methods**[slides]

ICDT 2015

MIT Theory Lunch, 2014

TA for 6.852, Distributed Algorithms, Fall 2014.

TA for the UW Math REU under Dr. James Morrow, Summer 2013.

TA for MATH 334/5/6, Advanced Accelerated Second Year Honors Calculus, 2012-2013.

TA for CS 373, Algorithms and Data Structures, Spring 2012.

TA for CS 344, Databases, Winter 2012.

I am on the steering committee for SLOGN*

I organized the Great Ideas in Theoretical Computer Science (aka theory lunch) in the 2013-2014 academic year.

I stole the boombox from the Glorious Office 3 times, then promptly lost it back each time.

* This might be false