Statistical Modeling over Graphs via Convex Optimization

Event Details
  • Date/Time:
    • Thursday March 3, 2011
      10:00 am - 11:00 am
  • Location: ISyE Executive classroom
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    N/A
  • Extras:
Contact
No contact information submitted.
Summaries

Summary Sentence: Statistical Modeling over Graphs via Convex Optimization

Full Summary: No summary paragraph submitted.

TITLE:  Statistical Modeling over Graphs via Convex Optimization

SPEAKER:  Venkat Chandrasekaran, Faculty Candidate

ABSTRACT:

An outstanding challenge in many problems throughout science and engineering is to succinctly characterize the relationships among a large number of interacting entities. Models based on graphs offer a fruitful framework to solve such problems, as graphs often provide a concise representation of the interactions among a large set of variables. In this talk we discuss two settings in which graph-structured models play a prominent role in applications.

The first part of the talk is motivated by the following question: Suppose we have sample statistics of only a subset of a collection of random variables.  Without any additional information about the unobserved variables, is it possible to discover the effects of such hidden phenomena? We present an answer to this question in the framework of Gaussian statistical graphical models. We describe a convex optimization method for graphical model selection
with hidden variables, and provide theoretical guarantees of its consistency in the high-dimensional scaling regime. In the second part of the talk we introduce convex graph invariants, which are invariants of a graph that are convex functions of the underlying adjacency matrix. Graph invariants characterize structural properties of a graph that do not depend on the
labeling of the nodes; convex graph invariants constitute an important subclass, and they provide a systematic and unified computational framework based on convex optimization for solving a number of interesting graph problems.

We describe applications of both these methods to problems in financial modeling and network analysis, and conclude with a discussion of directions for future research.

Bio: Venkat Chandrasekaran is a Ph.D. candidate working with Prof. Alan Willsky and Prof. Pablo Parrilo in the Department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology, where he received the S.M. degree in 2007. He also received the B.S. degree in Electrical and Computer Engineering and the B.A. degree in Mathematics from Rice University in 2005. His research interests include optimization,
statistics, and signal processing.


Additional Information

In Campus Calendar
No
Groups

School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
No categories were selected.
Keywords
No keywords were submitted.
Status
  • Created By: Anita Race
  • Workflow Status: Published
  • Created On: Feb 10, 2011 - 6:32am
  • Last Updated: Oct 7, 2016 - 9:54pm