HackerPapers

arXiv:1410.0342stat.ML

Generalized Low Rank Models

Madeleine Udell, Corinne Horn, Reza Zadeh, Stephen Boyd

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This framework encompasses many well known techniques in data analysis, such as nonnegative matrix factorization, matrix completion, sparse and robust PCA, $k$-means, $k$-SVD, and maximum margin matrix factorization. The method handles heterogeneous data sets, and leads to coherent schemes for compressing, denoising, and imputing missing entries across all data types simultaneously. It also admits a number of interesting interpretations of the low rank factors, which allow clustering of examples or of features. We propose several parallel algorithms for fitting generalized low rank models, and describe implementations and numerical results.

arXiv comments
84 pages, 19 figures
Journal reference
DOI
Subjects
stat.MLMachine Learning (Statistics) cs.LGMachine Learning math.OCOptimization and Control

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Nov 2018 to Nov 2018.

Comments linking this paper, per year.

Discussed in comments1 thread

    • 1. > It's theoretically impossible to guarantee a convergence to global optima using gradient descent if the function is non-convex. This is false. See, e.g., [0][1]. 2. I'm not really sure what the question is here. 3. If your loss is bounded from below (it is a square norm) by…

      LolWolfView on HNParent context

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.