Research

Papers

Theoretical Computer Science

Faster Matrix Inversion and Rank Computation in Finite Fields, with Rasmus Kyng. In ITCS 2022. arXiv.

NLP

Evaluating Word Embeddings with Categorical Modularity, with Karina Halevy and Damián Blasi. In Findings of ACL, 2021. arXiv, GitHub.

Interpretable ML

PCACE: A Statistical Approach to Ranking Neurons for CNN Interpretability, with Esra Suel and Seth Flaxman. In Responsible AI and DeepSpatial workshops at KDD 2021.

Number Theory

On the Divisibility of Binomial Coefficients. Ars Math. Contemp. 19 (2020), 297-309. arXiv.

Talks

  • Faster sparse matrix inversion and rank computation in finite fields, Exact Computing Research Seminar at Université de Montpellier (France), January 2022.
  • Faster sparse matrix inversion and rank computation in finite fields, Google Zurich Algorithms & Optimization Group Seminar (virtual), December 2021.
  • Verification of differentially private algorithms, Harvard PRISE final presentation (virtual), August 2021.
  • PCACE: A Statistical Approach to Ranking Neurons for CNN Interpretability, Responsible AI workshop and DeepSpatial workshop at KDD 2021, August 2021.
  • Oblivious pseudorandom functions (OPRFs): origins and modern applications, IBM Research Security Seminar, May 2021.
  • Why are p-adic numbers useful for fast linear algebra algorithms?, Harvard Math Table (poster, slides), December 2020.
  • On the divisibility of binomial coefficients, final presentation at the Research Science Institute at MIT (video), August 2017.