My general research interests are very broad — I’m interested in programming languages, machine learning, AI, complexity theory, algorithms, security, quantum computing, you name it. At the moment, I’m applying program synthesis techniques to automatically generate incremental update rules that can be used to accelerate approximate sampling algorithms used in probabilistic programming. In the past, I’ve applied partial evaluation and memoization to compile sampling algorithms. I am supported by an NSF Fellowship, and was supported by a Berkeley Fellowship for my first two years in grad school.