Loading Events

« All Events

  • This event has passed.

New provable techniques for learning and inference in probabilistic graphical models

September 8 @ 11:00 am - 12:00 pm

Andrej Risteski (Princeton University)

Abstract: A common theme in machine learning is succinct modeling of distributions over large domains. Probabilistic graphical models are one of the most expressive frameworks for doing this. The two major tasks involving graphical models are learning and inference. Learning is the task of calculating the “best fit” model parameters from raw data, while inference is the task of answering probabilistic queries for a model with known parameters (e.g. what is the marginal distribution of a subset of variables, after conditioning on the values of some other variables). Learning can be thought of as finding a graphical model that “explains” the raw data, while the inference queries extract the “knowledge” the graphical model contains.

I will focus on a few vignettes from my research which give new provable techniques for these tasks:
– In the context of learning, I will talk about method-of-moments techniques for learning noisy-or Bayesian networks, which are used for modeling the causal structure of diseases and symptoms.
– In the context of inference, I will talk about a new understanding of a class of algorithms for calculating partition functions, called variational methods, through the
lens of convex programming hierarchies. Time permitting, I will also speak about MCMC methods for sampling from highly multimodal distributions using simulated tempering.

The talk will assume no background, and is meant as a “meet and greet” talk surveying various questions I’ve worked on and am interested in.


Biography: I work in the intersection of machine learning and theoretical computer science, with the primary goal of designing provable and practical algorithms for problems arising in machine learning. Broadly, this includes tasks like clustering, maximum likelihood estimation, inference, learning generative models.

All of these tend to be non-convex in nature and intractable in general. However, in practice, a plethora of heuristics like gradient descent, alternating minimization, convex relaxations, variational methods work reasonably well. In my research, I endeavor to understand what are realistic conditions under which we can give guarantees of the performance of these algorithms, as well as devise new, more efficient methods.

I was a PhD student in the Computer Science Department at Princeton University, working under the advisement of Sanjeev Arora. Starting September 2017, I will hold a joint position in the Institute for Data, Systems, and Society (IDSS) and the Applied Mathematics department at MIT, as a Norbert Wiener Fellow and applied mathematics instructor respectively.


September 8
11:00 am - 12:00 pm
Event Category:



Speaker Name(s)
Andrej Risteski (Princeton University)