BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20170410T222326Z
DTSTART;TZID=America/Los_Angeles:20170419T150000
DTEND;TZID=America/Los_Angeles:20170419T160000
TRANSP:OPAQUE
SUMMARY:Data-Driven Methods for Sparse Network Estimation
UID:108627-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:3110 Etcheverry Hall
DESCRIPTION:Somayeh Sojoudi\, Assistant Project Scientist\, University of California\, Berkeley\n\nSystem identification is a fundamental area in control theory\, which is concerned with finding mathematical models of dynamical systems from data. As a special case of this area\, the problem of finding the underlying network structure of a system from measured data is of interest in many areas. This problem can be addressed through the notion of graphical models\, which aims to capture the relationships between the parameters of a system using graphs. Graphical models have applications in many areas\, such as social sciences\, robotics\, biology\, neuroscience\, and power systems. Learning graphical models is often challenged by the fact that only a small number of samples are available. Despite the popularity of graphical lasso for solving this problem\, there is not much known about the properties of this statistical method as an optimization algorithm. In this talk\, we will develop new notions of sign-consistent matrices and inverse-consistent matrices to obtain key properties of graphical lasso. In particular\, we will prove that although the complexity of solving graphical lasso is high\, the sparsity pattern of its solution has a simple formula if a sparse graphical model is sought. Besides graphical lasso\, there are several techniques for learning graphical models. We will design an optimization-based mathematical framework to compare the performance of various techniques and find the best one for each application. We will illustrate our results in different case studies.\n\nBIO\nSomayeh Sojoudi is an Assistant Project Scientist at the University of California\, Berkeley. She received her PhD degree in Control & Dynamical Systems from California Institute of Technology in 2013. She was an Assistant Research Scientist at New York University School of Medicine from 2013 to 2015. She has worked on several interdisciplinary problems in optimization theory\, control theory\, machine learning\, data analytics\, and power systems. Somayeh Sojoudi is an associate editor for the IEEE Transactions on Smart Grid. She is a co-recipient of the 2015 INFORMS Optimization Society Prize for Young Researchers and a co-recipient of the 2016 INFORMS ENRE Energy Best Publication Award. She is a co-author of a best student paper award finalist for the 53rd IEEE Conference on Decision and Control 2014.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=108627&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20170410T222326Z
LAST-MODIFIED:20170410T230349Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR