Mining structured matrices in high dimensions
| dc.contributor.advisor | Ghosh, Joydeep | |
| dc.contributor.committeeMember | Bovik, Alan C | |
| dc.contributor.committeeMember | Caramanis, Constantine | |
| dc.contributor.committeeMember | Ravikumar, Pradeep | |
| dc.contributor.committeeMember | Sanghavi, Sujay | |
| dc.creator | Gunasekar, Suriya | |
| dc.date.accessioned | 2016-11-17T19:52:24Z | |
| dc.date.accessioned | 2018-01-22T22:31:06Z | |
| dc.date.available | 2016-11-17T19:52:24Z | |
| dc.date.available | 2018-01-22T22:31:06Z | |
| dc.date.issued | 2016-08 | |
| dc.date.submitted | August 2016 | |
| dc.date.updated | 2016-11-17T19:52:24Z | |
| dc.description.abstract | Structured matrices refer to matrix valued data that are embedded in an inherent lower dimensional manifold with smaller degrees of freedom compared to the ambient or observed dimensions. Such hidden (or latent) structures allow for statistically consistent estimation in high dimensional settings, wherein the number of observations is much smaller than the number of parameters to be estimated. This dissertation makes significant contributions to statistical models, algorithms, and applications of structured matrix estimation in high dimensional settings. The proposed estimators and algorithms are motivated by and evaluated on applications in e--commerce, healthcare, and neuroscience. In the first line of contributions, substantial generalizations of existing results are derived for a widely studied problem of matrix completion. Tractable estimators with strong statistical guarantees are developed for matrix completion under (a) generalized observation models subsuming heterogeneous data--types, such as count, binary, etc., and heterogeneous noise models beyond additive Gaussian, (b) general structural constraints beyond low rank assumptions, and (c) collective estimation from multiple sources of data. The second line of contributions focuses on the algorithmic and application specific ideas for generalized structured matrix estimation. Two specific applications of structured matrix estimation are discussed: (a) a constrained latent factor estimation framework that extends the ideas and techniques hitherto discussed, and applies them for the task of learning clinically relevant phenotypes from Electronic Health Records (EHRs), and (b) a novel, efficient, and highly generalized algorithm for collaborative learning to rank (LETOR) applications. | |
| dc.description.department | Electrical and Computer Engineering | |
| dc.format.mimetype | application/pdf | |
| dc.identifier | doi:10.15781/T2154DR89 | |
| dc.identifier.uri | http://hdl.handle.net/2152/43772 | |
| dc.language.iso | en | |
| dc.subject | Matrix completion | |
| dc.subject | High dimensional estimation | |
| dc.subject | EHRs | |
| dc.subject | Letor | |
| dc.subject | Matrix estimation | |
| dc.subject | Sample complexity | |
| dc.title | Mining structured matrices in high dimensions | |
| dc.type | Thesis | |
| dc.type.material | text |