- This event has passed.
Algorithms for Modern Massive Data Sets (MMDS 2016) Workshop
June 21, 2016 @ 8:00 am - June 24, 2016 @ 5:00 pm
Early Registration deadline: Sunday, May 1, 2016. Download the full pdf program here.
This four-day series of academic workshops addresses algorithmic and statistical challenges in modern large-scale data analysis. The goals of this series of workshops are to explore novel techniques for modeling and analyzing massive, high-dimensional, and non-linearly structured scientific and internet data sets and to bring together computer scientists, statisticians, mathematicians, and data analysis practitioners to promote the cross-fertilization of ideas.
CDAR associate Alexander Shkolnik from the Department of Economics at UC Berkeley will be presenting his work on Identifying Financial Risk Factors with a Low-Rank Sparse Decomposition.
Abstract: Factor models of security returns aim to decompose an asset return covariance matrix into a systematic component and a specific risk component. Standard approaches like PCA and maximum likelihood suffer from several drawbacks including a lack of robustness as well as their strict assumptions on the underlying model of returns. We survey some modern, robust methods to uniquely decompose a return covariance matrix into a low-rank component and a sparse component. Surprisingly, the identification of the unique low rank and sparse components is feasible under mild assumptions. We apply the method of Chanrasekaran,Parillo and Willsky (2012) for latent graphical models to decompose a security return covariance matrix. The low rank component includes the market and other broad factors that affect most securities. The sparse component includes thin factors such as industry and country, which affect only a small number of securities, but in an important way. We illustrate the decomposition on simulated data, and also an empirical data set drawn from 25,000 global equities.