My research goals revolve around developing efficient
probabilistic reasoning algorithms. I am currently
interested in reasoning with uncertainty over permutations.
Permutations appear in a variety of real world problems but
present a challenging problem for inference due to the fact
that there are n! permutations. I have been using Fourier
theoretic methods to develop principled and efficient
approximate methods for reasoning with permutations.
(LDA) Latent Dirichlet Allocation
Jonathan Huang and
Tomasz Malisiewicz,
An implementation of the mean field inference/learning
algorithms from
Blei et al. (2003)
Sperner's Lemma
,
Jonathan Huang,
Some theorems/corollaries of Sperner's Lemma that I collected for a
combinatorics class. Sperner is an easy combinatorial fact about labelings
on a simplicial complex, but it has several surprising applications in
topology and analysis.
Cup Products in Computational Topology
,
Jonathan Huang,
Senior Honors Thesis (advisor: Gunnar Carlsson). We
show an application of topological persistence to computing invariants
related to the cohomology (cup product structure) of a finite simplicial
complex.