Flexible Low-Rank Statistical Modeling with Missing Data and Side Information
Name
1308.4211.pdf
Size
628.99 KB
Format
Adobe PDF
Checksum (MD5)
357d20fc747bc573d5789ebd89b6ff91
Author(s)
Fithian, William
Mazumder, Rahul
Date Issued
August 2017
Journal
Statistical Science
Publisher
Institute of Mathematical Statistics
Citation
Fithian, William and Rahul Mazumder. “Flexible Low-Rank Statistical Modeling with Missing Data and Side Information.” Statistical Science 33, 2 (May 2018): 238–260 © 2018 Institute of Mathematical Statistics
Version
Original manuscript
Abstract
We explore a general statistical framework for low-rank modeling of matrix-valued data, based on convex optimization with a generalized nuclear norm penalty. We study several related problems: the usual low-rank matrix completion problem with flexible loss functions arising from generalized linear models; reduced-rank regression and multi-task learning; and generalizations of both problems where side information about rows and columns is available, in the form of features or smoothing kernels. We show that our approach encompasses maximum a posteriori estimation arising from Bayesian hierarchical modeling with latent factors, and discuss ramifications of the missing-data mechanism in the context of matrix completion. While the above problems can be naturally posed as rank-constrained optimization problems, which are nonconvex and computationally difficult, we show how to relax them via generalized nuclear norm regularization to obtain convex optimization problems. We discuss algorithms drawing inspiration from modern convex optimization methods to address these large scale convex optimization computational tasks. Finally, we illustrate our flexible approach in problems arising in functional data reconstruction and ecological species distribution modeling.
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1214/18-STS642
