1. “Sharper rates for estimating differential entropy under Gaussian convolutions.” Technical report, 2018. PDF
  2. (with J. Altschuler, F. Bach, and A. Rudi) “Approximating the quadratic transportation metric in near-linear time.” Technical report, 2018. arXiv
  3. (with P. Rigollet) “Uncoupled isotonic regression via minimum Wasserstein deconvolution.” Submitted, 2018. arXiv, video of related talk
  4. (with A Forrow, J. Hütter, M. Nitzan, P. Rigollet, and G. Schiebinger) “Statistical optimal transport via factored couplings.” Submitted, 2018. arXiv
  5. (with A. S. Bandeira, B. Blum-Smith, J. Kileel, A. Perry, and A. S. Wein) “Estimation under group actions: recovering orbits from invariants.” Submitted, 2018. arXiv
  6. (with A. Perry, A. S. Bandeira, P. Rigollet, and A. Singer) “The sample complexity of multi-reference alignment.” Submitted, 2017. arXiv
  7. (with A. S. Bandeira & P. Rigollet) “Optimal rates of estimation for multi-reference alignment.” Submitted, 2017. arXiv

Conference papers

  1. “An explicit analysis of the entropic penalty in linear programming.” Proceedings of the 31st Conference On Learning Theory (COLT 2018). PDF, video of presentation
  2. (with C. Mao and P. Rigollet) “Minimax rates and efficient algorithms for noisy sorting.” Algorithmic Learning Theory (ALT 2018). PDF
  3. (with J. Altschuler & P. Rigollet) “Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration.” Advances in Neural Information Processing Systems 30 (NeurIPS 2017), selected for spotlight presentation. PDF
  4. (with V. Perchet & P. Rigollet) “Online learning in repeated auctions.” Proceedings of the 29th Annual Conference on Learning Theory (COLT 2016). PDF, video of presentation

Journal articles

  1. (with P. Rigollet) “Entropic optimal transport is maximum-likelihood deconvolution.” In Comptes Rendus Mathématique, 356(11-12), 2018. PDF
  2. (with F. Bach) “Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance.” In Bernoulli, to appear. PDF
  3. (with S. Klassen and D. Evans) “Semi-supervised machine learning approaches for predicting the chronology of archaeological sites: A case study of temples from medieval Angkor, Cambodia.” In PLOS One. 13(11), 2018. PDF
  4. “Approximately certifying the restricted isometry property is hard.” In IEEE Transactions on Information Theory. 64(8), 2018. arXiv
  5. (with M. Sawhney) “Further results on arc and bar k-visibility graphs.” In Minnesota Journal of Undergraduate Mathematics. 3(1), 2018. (Project mentored through MIT PRIMES.) PDF
  6. (with S. Billey) Appendix to “Permutations with Kazhdan-Lusztig polynomial P_{id,w}(q) = 1 + q^h” by Alexander Woo. In Electronic Journal of Combinatorics. 16(2), 2009. PDF

Refereed book chapters

  1. “Multinational War is Hard.” In Jennifer Beineke and Jason Rosenhouse, editors, The Mathematics of Various Entertaining Subjects, Volume 2. Princeton, 2017. PDF