Campuses:

Graphical methods

Wednesday, June 3, 2015 - 2:30pm - 3:30pm
Vincent Pilaud (École Polytechnique)
Graph associahedra are natural generalizations of the classical associahedra. They provide polytopal realizations of the nested complex of a graph G, defined as the simplicial complex whose vertices are the tubes (i.e. connected induced subgraphs) of G and whose faces are the tubings (i.e. collections of pairwise nested or non-adjacent tubes) of G. They appeared in the work of M. Carr and S. Devadoss, and were further studied by A. Postnikov, by E.-M. Feichtner and B. Sturmfels, and by A. Zelevinsky. Recently, they also appeared in the work of T. Lam and P.
Friday, June 21, 2013 - 9:00am - 10:30am
David Madigan (Columbia University)
This lecture will describe two applications of Bayesian graphic models.
Thursday, June 20, 2013 - 11:00am - 12:30pm
David Madigan (Columbia University)
Graphical Markov models use graphs with nodes
corresponding to random variables, and edges that
encode conditional independence relationships between
those variables. Directed graphical models (aka Bayesian
networks) in particular have received considerable attention.
This lecture will review basic concepts in graphical
model theory such as Markov properties, equivalence,
and connections with causal inference.
Monday, March 26, 2012 - 12:00pm - 12:45pm
Anima Anandkumar (University of California)
Capturing complex interactions among a large set of variables is a
Wednesday, October 26, 2011 - 1:30pm - 2:30pm
Donald Geman (Johns Hopkins University)
Learning high-dimensional probability distributions with a very
reduced number of samples is no more difficult than with a great
many. However, arranging for such models to generalize well in the
small-sample domain is hard. Our approach is motivated by
compositional models and Bayesian networks, and designed to adapt to
sample size. We start with a large, overlapping set of elementary
statistical building blocks, or primitives, which are
low-dimensional marginal distributions learned from data. Subsets of
Thursday, January 18, 2007 - 11:00am - 11:50am
Martin Wainwright (University of California, Berkeley)
The problem of recovering the sparsity pattern of an unknown signal arises in various domains, including graphical model selection, signal denoising, constructive approximation, compressive sensing, and subset selection in regression. The standard optimization-theoretic formulation of sparsity recovery involves l_0-constraints, and typically leads to computationally intractable optimization problems.
Subscribe to RSS - Graphical methods