Tuesday, April 10, 2012 - 12:30

Spectral Clustering and Higher-Order Cheeger Inequalities

Speaker: James Lee, Dept. Computer Science & Eng., Univ. Washington
Location: Gates Commons

I will try to tell a story of spectral clustering, from
heuristics, to experiments, to a new algorithm and its formal analysis.
In an interesting twist, the same tools used to analyze spectral
partitioning yield new ways to mine the structure of noisy systems of
linear equations modulo a prime. This, in turn, allows us to mount a
spectral attack on one of the most prominent open problems in complexity
theory. [This is based partly on joint work with Shayan Oveis-Gharan and
Luca Trevisan.]

Tuesday, March 6, 2012 - 12:30

Gaussian Processes for Approximating Complex Models

Speaker: Murali Haran, Pennsylvania State University
Location: EEB 037

This is a tutorial on the use of Gaussian process to approximate complex models often used in modeling phenomena like climate, disease dynamics, etc. The tutorial will begin with an introduction to Gaussian processes followed by a discussion of how Gaussian processes can be used for both computer model emulation (approximation) and calibration.

Tuesday, February 28, 2012 - 12:30


Speaker: Thomas Richardon, University of Washington
Location: EEB 037

As these talks are intended as overviews, time permitting, I plan to give two mini-tutorials: The first will be on the idea of counterfactuals/potential outcomes. Basically answering the question: how does data obtained from a simple randomized experiment differ from that obtained from an observational study, and how does that weaken inferences that can be obtained. The second will require assume a little bit of background on Bayesian networks and will answer the question: if we obtain data from a subset of the variables in a causal Bayesian network, which causal effects are identified and how can they be computed efficiently.

Tuesday, February 21, 2012 - 12:30

Counting and Sampling Solutions of Combinatorial Problems

Speaker: Ashish Sabharwal, IBM T,J, Watson
Location: EEB 037

This tutorial presents a survey of algorithms that are used for counting and sampling of SAT problems.

Tuesday, February 14, 2012 - 12:30

Knowledge Extraction for Biomedical Text

Speaker: Hoifung Poon, Microsoft Research

This tutorial summarizes the literature on knowledge extraction in scientific domains, such as biomedical texts.

Tuesday, February 7, 2012 - 12:30

Machine Learning for Information Retrieval

Speaker: Niranjan Balasubramanian, University of Washington
Location: EEB 037

This tutorial discusses the machine learning techniques popular in the information retrieval subcommunity such as ranking techniques, pagerank, etc.

Tuesday, January 31, 2012 - 12:30

Trajectory Optimization with Differential Dynamic Programming

Speaker: Tom Erez, University of Washington
Location: EEB 037

This tutorial gives an introduction to the control theory, in particular, discussing the trajectory optimization techniques.

Tuesday, January 24, 2012 - 12:30

Latent Variable Models of Lexical Semantics

Speaker: Alan Ritter, University of Washington
Location: EEB 037

This tutorial discusses probabilistic models popular in the NLP lexical semantics community.

Tuesday, January 17, 2012 - 12:30

Latent Factor Models for Relational and Network Data

Speaker: Peter Hoff, University of Washington
Location: EEB 037

This tutorial discusses probabilistic models for social and other network data.

Tuesday, January 10, 2012 - 12:30

Submodular Functions and Active Learning

Speaker: Andrew Guillory, University of Washington
Location: EEB 037

This tutorial presents a brief survey of active learning, submodular functions, and the interesting algorithms and analyses at their intersection. Minimal background knowledge is assumed, and emphasis is placed on open problems and gaps between theory and practice. Slides at: http://ml.cs.washington.edu/www/media/presentations/submodularity_tutori...

Machine Learning Seminars

Sponsored by