Tuesday, September 02, 2014

Thesis: Inference and Estimation in High-dimensional Data Analysis, Adel Javanmard

I just started the thesis tag for blog entries that feature thesis manuscripts. Here is a new one which might be quite appropriate in light of the potential connection between current Deep Leanring issues and Approximate Messga Passing algorithms as mentioned in Parallel Paths for Deep Learning and Signal Processing ?. Without futher ado, 

Inference and Estimation in High-dimensional Data Analysis by Adel Javanmard
Modern technologies generate vast amounts of fine-grained data at an unprecedented speed.Nowadays, high-dimensional data, where the number of variables is much larger than thesample size, occur in many applications, such as healthcare, social networks, and recommendation systems, among others. The ubiquitous interest in these applications has spurredremarkable progress in the area of high-dimensional data analysis in terms of point estimation and computation. However, one of the fundamental inference task, namely quantifyinguncertainty or assessing statistical significance, is still in its infancy for such models. In thefirst part of this dissertation, we present efficient procedures and corresponding theory forconstructing classical uncertainty measures like confidence intervals and p-values for singleregression coefficients in high-dimensional settings.In the second part, we study the compressed sensing reconstruction problem, a well known example of estimation in high-dimensional settings. We propose a new approachto this problem that is drastically different from the classical wisdom in this area. Ourconstruction of the sensing matrix is inspired by the idea of spatial coupling in codingtheory and similar ideas in statistical physics. For reconstruction, we use an approximatemessage passing algorithm. This is an iterative algorithm that takes advantage of thestatistical properties of the problem to improve convergence rate. Finally, we prove thatour method can effectively solve the reconstruction problem at (information-theoretically) optimal undersampling rate and show its robustness to measurement noise.

We've talked about Adel's work a few times before:

Join the CompressiveSensing subreddit or the Google+ Community and post there !
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.

No comments: