I am a recently minted PhD from the University of Toronto, where I was a member of the DCS Theory Group. This fall I am a research fellow in the Lower Bounds program at the Simons Institute for the Theory of Computing. Following this, I will begin a joint postdoc between DIMACS and the Institute for Advanced Study.
My primary area of research is computational complexity theory, with an emphasis in circuit complexity, proof complexity, and related topics. I have also worked in intersection of theoretical computer science and cognitive science.
Package for converting a halfspace representation of a polytope into a vertex representation of a polytope. Written in the R programming language (a port of lrslib, written by David Avis).
Consider the following problem: we are given a collection of sets of isotopic measurements (perhaps measuring the concentration of some particular isotopes of carbon and nitrogen, for example) taken from a fixed "predator" species and a collection of "prey" species for which we know the "predator" preys on. In an ideal world, the set of measurements from each predator would be a convex combination of the isotopic measurements from some samples of the 'prey' distributions, and using standard machine learning techniques (Gaussian mixture models) we could get an estimate of what proportion of each type of 'prey' the 'predator' sample is eating. Unfortunately, the world is not ideal in this way, and typically the above experiment can only be run up to certain "error terms", which are known in the computational ecology literature as discrimination factors. EDFIR (Estimating Discrimination Factors in R) is a collection of functions for reading in data sets of isotopic measurements and generating a prior distribution of discrimination factors for later input into a Gaussian mixture model. Joint work with Alex Bond.