|
Tommi S. Jaakkola, Ph.D. Associate Professor of Electrical Engineering and Computer Science MIT Computer Science and Artificial Intelligence Laboratory Stata Center, Bldg 32-G498 Cambridge, MA 02139 E-mail: tommi at csail.mit.edu |
|
Home Courses Papers People Research |
Research synopsis (more...)
On the theoretical side, our research focuses on statistical inference and estimation, development of principled approximation methods for problems with limited computational resources, analysis and development of algorithms for various modern estimation problems such as those involving predominantly incomplete data. The applied side of our work involves primarily functional genomics (transcriptional regulation), large scale inference problems, and information retrieval. Students/postdocs (more...) John Barnett, Amir Globerson, Luis Perez-Breva, Alan Qi, Jason Rennie, David Sontag Recent papers (more...) Tightening lp relaxations for map using message passing. In Proceedings of the 24rd Conference on Uncertainty in Artificial Intelligence, 2008. To appear. [pdf]
New outer bounds on the marginal polytope. In Advances in Neural Information Processing Systems 21, 2007. [pdf]
Fixing max-product: Convergent message passing algorithms for map lp-relaxations. In Advances in Neural Information Processing Systems 21, 2007. [pdf]
Automated discovery of functional generality of human gene expression programs. PloS Computational biology, 2007. To appear. [link to paper]
Convergent propagation algorithms via oriented trees. In Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, 2007. To appear. [pdf]
On iteratively constraining the marginal polytope for approximate inference and map. Technical report, 2007. [pdf]
Approximate inference using conditional entropy decompositions. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, 2007. To appear. [pdf]
Predictive discretization during model selection. In Proceedings of the 11th International Conference on Artificial Intelligence and Statistics, 2007. [pdf]
Approximate inference using planar graph decomposition. In Advances in Neural Information Processing Systems 20, 2006. [pdf]
Game theoretic algorithms for protein-dna binding. In Advances in Neural Information Processing Systems 20, 2006. To appear. [pdf]
Parameter expanded variational bayesian methods. In Advances in Neural Information Processing Systems 20, 2006. [pdf]
High-resolution computational models of genome binding events. Nature Biotechnology, 24:963--970, 2006. [pdf], [pdf]
Semi-supervised analysis of gene expression profiles for lineage-specific development in the caenorhabditis elegans embryo. Bioinformatics, 22(14):417--423, 2006. [pdf]
Dna binding and games. MIT CSAIL Technical Report TR-2006-018, 2006. [pdf]
Data dependent regularization. In Semi-supervised learning. MIT Press, 2006. [pdf]
Map estimation via agreement on (hyper)trees: Message-passing and linear-programming approaches. IEEE Transactions on Information Theory, 51(11):3697--3717, 2005. [pdf]
Using term informativeness for named entity detection. In Proceedings of the 28th Annual Conference on Research and Development in Information Retrieval (SIGIR), 2005. [pdf]
Modeling the combinatorial functions of multiple transcription factors. In The Ninth Annual International Conference on Research in Computational Molecular Biology, 2005. [pdf]
Validation and refinement of gene-regulatory pathways on a network of physical interactions. Genome Biology, 6(7):R62, 2005. [pdf], [link to paper]
A new class of upper bounds on the log partition function. IEEE Transactions on Information Theory, 51:2313--2335, 2005. [pdf]
Focused inference. In Proceedings of the Tenth International Workshop on Artificial Intelligence and Statistics, 2005. [pdf]
|