{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:52:27Z","timestamp":1781110347615,"version":"3.54.1"},"reference-count":162,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,6,23]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1561\/2200000055","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T06:16:03Z","timestamp":1466662563000},"page":"1-118","source":"Crossref","is-referenced-by-count":211,"title":["Generalized Low Rank Models"],"prefix":"10.1108","volume":"9","author":[{"given":"Madeleine","family":"Udell","sequence":"first","affiliation":[{"name":"Operations Research and Information Engineering Cornell University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Corinne","family":"Horn","sequence":"additional","affiliation":[{"name":"Electrical Engineering Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Reza","family":"Zadeh","sequence":"additional","affiliation":[{"name":"Computational and Mathematical Engineering Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[{"name":"Electrical Engineering Stanford University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"140","published-online":{"date-parts":[[2016,6,23]]},"reference":[{"key":"2026033014113953800_ref001","first-page":"803","article-title":"A new approach to collaborative filtering: Operator estimation with spectral regularization","volume":"10","author":"Abernethy","year":"2009","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033014113953800_ref002","article-title":"Learning sparsely used overcomplete dictionaries via alternating minimization","volume-title":"arXiv:1310.7991","author":"Agarwal","year":"2013"},{"key":"2026033014113953800_ref003","first-page":"155","volume-title":"Proceedings of the 23rd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems","author":"Agarwal","year":"2004"},{"issue":"11","key":"2026033014113953800_ref004","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"k-SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"Aharon","year":"2006","journal-title":"IEEE Transactions on Signal Processing"},{"key":"2026033014113953800_ref005","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Arthur","year":"2007"},{"issue":"1","key":"2026033014113953800_ref006","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0893-6080(89)90014-2","article-title":"Neural networks and principal component analysis: Learning from examples without local minima","volume":"2","author":"Baldi","year":"1989","journal-title":"Neural Networks"},{"issue":"1","key":"2026033014113953800_ref007","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.csda.2006.11.006","article-title":"Algorithms and applications for approximate nonnegative matrix factorization","volume":"52","author":"Berry","year":"2007","journal-title":"Computational Statistics & Data Analysis"},{"key":"2026033014113953800_ref008","first-page":"1","article-title":"Incremental gradient, subgradient, and proximal methods for convex optimization: A survey","volume":"2010","author":"Bertsekas","year":"2011","journal-title":"Optimization for Machine Learning"},{"key":"2026033014113953800_ref009","article-title":"Julia: A fast dynamic language for technical computing","volume-title":"arXiv:1209.5145","author":"Bezanson","year":"2012"},{"key":"2026033014113953800_ref010","first-page":"1223","article-title":"Factoring nonnegative matrices with linear programs","volume":"25","author":"Bittorf","year":"2012","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033014113953800_ref011","first-page":"1","article-title":"Proximal alternating linearized minimization for nonconvex and nonsmooth problems","volume-title":"Mathematical Programming","author":"Bolte","year":"2013"},{"key":"2026033014113953800_ref012","volume-title":"Convex analysis and nonlinear optimization: theory and examples","author":"Borwein","year":"2010"},{"key":"2026033014113953800_ref013","article-title":"Smallk is a C++\/Python high-performance software library for nonnegative matrix factorization (NMF) and hierarchical and flat clustering using the NMF ; current version 1.2.0","author":"Boyd","year":"2014"},{"key":"2026033014113953800_ref014","first-page":"962","article-title":"Accuracy at the top","volume-title":"Advances in Neural Information Processing Systems","author":"Boyd","year":"2012"},{"key":"2026033014113953800_ref015","volume-title":"Lecture notes for EE364b","author":"Boyd","year":"2003"},{"issue":"1","key":"2026033014113953800_ref016","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/2200000016","article-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","volume":"3","author":"Boyd","year":"2011","journal-title":"Foundations and Trends in Machine Learning"},{"key":"2026033014113953800_ref017","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"Boyd","year":"2004"},{"key":"2026033014113953800_ref018","volume-title":"Subgradient methods","author":"Boyd","year":"2003"},{"issue":"2","key":"2026033014113953800_ref019","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s10107-002-0352-8","article-title":"A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization","volume":"95","author":"Burer","year":"2003","journal-title":"Mathematical Programming"},{"key":"2026033014113953800_ref020","doi-asserted-by":"crossref","DOI":"10.1007\/s10107-004-0564-1","article-title":"Local minima and convergence in low-rank semidefinite programming","volume":"103","author":"Burer","year":"2005","journal-title":"Mathematical Programming"},{"issue":"3","key":"2026033014113953800_ref021","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1970392.1970395","article-title":"Robust principal component analysis?","volume":"58","author":"Cand\u00e9s","year":"2011","journal-title":"Journal of the ACM (JACM)"},{"key":"2026033014113953800_ref022","article-title":"Matrix completion with noise","volume-title":"CoRR","author":"Cand\u00e9s","year":"2009"},{"key":"2026033014113953800_ref023","article-title":"Exact matrix completion via convex optimization","volume-title":"CoRR","author":"Cand\u00e9s","year":"2008"},{"issue":"5","key":"2026033014113953800_ref024","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","article-title":"The power of convex relaxation: Near-optimal matrix completion","volume":"56","author":"Cand\u00e9s","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"2026033014113953800_ref025","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1207\/s15327906mbr0102_10","article-title":"The scree test for the number of factors","volume":"1","author":"Cattell","year":"1966","journal-title":"Multivariate behavioral research"},{"issue":"1","key":"2026033014113953800_ref026","first-page":"177","article-title":"Matrix estimation by universal singular value thresholding","volume":"43","author":"Chatterjee","year":"2014","journal-title":"The Annals of Statistics"},{"key":"2026033014113953800_ref027","doi-asserted-by":"crossref","DOI":"10.1109\/HPTCDL.2014.9","article-title":"Parallel prefix polymorphism permits parallelization, presentation & proof","volume-title":"arXiv:1410.6409","author":"Chen","year":"2014"},{"issue":"1","key":"2026033014113953800_ref028","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","article-title":"Atomic decomposition by basis pursuit","volume":"20","author":"Chen","year":"1998","journal-title":"SIAM Journal on Scientific Computing"},{"key":"2026033014113953800_ref029","first-page":"23","article-title":"A generalization of principal component analysis to the exponential family","volume":"13","author":"Collins","year":"2001","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033014113953800_ref030","first-page":"265","article-title":"On the algorithmic implementation of multiclass kernel-based vector machines","volume":"2","author":"Crammer","year":"2002","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033014113953800_ref031","article-title":"Random projections for non-negative matrix factorization","volume-title":"arXiv:1505.0275","author":"Damle","year":"2014"},{"key":"2026033014113953800_ref032","article-title":"Quadratic programing solver for non-negative matrix factorization with spark","volume-title":"Spark Summit 2014","author":"Das","year":"2014"},{"key":"2026033014113953800_ref033","first-page":"41","article-title":"A direct formulation for sparse PCA using semidefinite programming","volume":"16","author":"d\u2019Aspremont","year":"2004","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033014113953800_ref034","article-title":"1-bit matrix completion","volume-title":"arXiv:1209.3672","author":"Davenport","year":"2012"},{"key":"2026033014113953800_ref035","first-page":"415","article-title":"The Gifi system of nonlinear multivariate analysis","volume":"3","author":"De Leeuw","year":"1984","journal-title":"Data analysis and informatics"},{"key":"2026033014113953800_ref036","first-page":"1","article-title":"Gift methods for optimal scaling in R: The package homals","author":"De Leeuw","year":"2009","journal-title":"Journal of Statistical Software"},{"issue":"4","key":"2026033014113953800_ref037","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/BF02296971","article-title":"Additive structure in qualitative data: An alternating least squares method with optimal scaling features","volume":"41","author":"De Leeuw","year":"1976","journal-title":"Psychometrika"},{"key":"2026033014113953800_ref038","article-title":"Global convergence of stochastic gradient descent for some nonconvex matrix problems","volume-title":"CoRR","author":"De Sa","year":"2014"},{"key":"2026033014113953800_ref039","article-title":"CVXPY: A Python-embedded modeling language for convex optimization, version 0.2","author":"Diamond","year":"2014"},{"key":"2026033014113953800_ref040","doi-asserted-by":"crossref","DOI":"10.1613\/jair.105","article-title":"Solving multiclass learning problems via error-correcting output codes","volume-title":"CoRR","author":"Dietterich","year":"1995"},{"key":"2026033014113953800_ref041","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/1150402.1150420","volume-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Ding","year":"2006"},{"issue":"2","key":"2026033014113953800_ref042","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1177\/1536867X0900900207","article-title":"Implementing Horn\u2019s parallel analysis for principal component analysis and factor analysis","volume":"9","author":"Dinno","year":"2009","journal-title":"Stata Journal"},{"issue":"1-3","key":"2026033014113953800_ref043","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","article-title":"Clustering large graphs via the singular value decomposition","volume":"56","author":"Drineas","year":"2004","journal-title":"Machine Learning"},{"issue":"3","key":"2026033014113953800_ref044","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02288367","article-title":"The approximation of one matrix by another of lower rank","volume":"1","author":"Eckart","year":"1936","journal-title":"Psychometrika"},{"key":"2026033014113953800_ref045","doi-asserted-by":"crossref","first-page":"2790","DOI":"10.1109\/CVPR.2009.5206547","volume-title":"IEEE Conference on Computer Vision and Pattern Recognition, 2009","author":"Elhamifar","year":"2009"},{"key":"2026033014113953800_ref046","doi-asserted-by":"crossref","first-page":"3273","DOI":"10.23919\/ACC.2004.1384521","volume-title":"Proceedings of the 2004 American Control Conference (ACC)","author":"Fazel","year":"2004"},{"issue":"3","key":"2026033014113953800_ref047","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1162\/neco.2008.04-08-771","article-title":"Nonnegative matrix factorization with the Itakura-Saito divergence: With application to music analysis","volume":"21","author":"F\u00e9votte","year":"2009","journal-title":"Neural Computation"},{"key":"2026033014113953800_ref048","article-title":"Scalable convex methods for flexible low-rank matrix modeling","volume-title":"arXiv:1308.4211","author":"Fithian","year":"2013"},{"key":"2026033014113953800_ref049","volume-title":"Nonnegative matrix factorization: Complexity, algorithms and applications","author":"Gillis","year":"2011"},{"issue":"4","key":"2026033014113953800_ref050","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1137\/110820361","article-title":"Low-rank matrix approximation with weights or missing data is NP-hard","volume":"32","author":"Gillis","year":"2011","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"3","key":"2026033014113953800_ref051","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/s10898-013-0053-2","article-title":"A continuous characterization of the maximum-edge biclique problem","volume":"58","author":"Gillis","year":"2014","journal-title":"Journal of Global Optimization"},{"key":"2026033014113953800_ref052","first-page":"757","article-title":"Transduction with matrix completion: Three birds with one stone","volume-title":"Advances in Neural Information Processing Systems","author":"Goldberg","year":"2010"},{"key":"2026033014113953800_ref053","first-page":"577","article-title":"Generalized2 linear2 models","volume-title":"Advances in Neural Information Processing Systems","author":"Gordon","year":"2002"},{"key":"2026033014113953800_ref054","doi-asserted-by":"crossref","first-page":"1169","DOI":"10.1145\/2661829.2662030","volume-title":"Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management","author":"Gress","year":"2014"},{"key":"2026033014113953800_ref055","first-page":"194","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Gunasekar","year":"2013"},{"issue":"1","key":"2026033014113953800_ref056","first-page":"1461","article-title":"Training highly multiclass classifiers","volume":"15","author":"Gupta","year":"2014","journal-title":"The Journal of Machine Learning Research"},{"issue":"2","key":"2026033014113953800_ref057","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/090771806","article-title":"Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions","volume":"53","author":"Halko","year":"2011","journal-title":"SIAM Review"},{"key":"2026033014113953800_ref058","article-title":"On the provable convergence of alternating minimization for matrix completion","volume-title":"arXiv:1312.0925","author":"Hardt","year":"2013"},{"key":"2026033014113953800_ref059","article-title":"Fast matrix completion without the condition number","volume-title":"arXiv:1407.4070","author":"Hardt","year":"2014"},{"key":"2026033014113953800_ref060","article-title":"Matrix completion and low-rank svd via fast alternating least squares","author":"Hastie","year":"2014"},{"issue":"2","key":"2026033014113953800_ref061","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF02289447","article-title":"A rationale and test for the number of factors in factor analysis","volume":"30","author":"Horn","year":"1965","journal-title":"Psychometrika"},{"issue":"6","key":"2026033014113953800_ref062","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1037\/h0071325","article-title":"Analysis of a complex of statistical variables into principal components","volume":"24","author":"Hotelling","year":"1933","journal-title":"Journal of Educational Psychology"},{"issue":"3-4","key":"2026033014113953800_ref063","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1093\/biomet\/28.3-4.321","article-title":"Relations between two sets of variates","volume":"28","author":"Hotelling","year":"1936","journal-title":"Biometrika"},{"issue":"4","key":"2026033014113953800_ref064","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1109\/91.784206","article-title":"A fuzzy fc-modes algorithm for clustering categorical data","volume":"7","author":"Huang","year":"1999","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"2026033014113953800_ref065","doi-asserted-by":"crossref","DOI":"10.1002\/0471725250","volume-title":"Robust Statistics","author":"Huber","year":"1981"},{"key":"2026033014113953800_ref066","first-page":"665","volume-title":"Proceedings of the 45th annual ACM Symposium on the Theory of Computing","author":"Jain","year":"2013"},{"key":"2026033014113953800_ref067","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-1904-8","volume-title":"Principal component analysis","author":"Jolliffe","year":"1986"},{"key":"2026033014113953800_ref068","article-title":"Stable autoencoding: A flexible framework for regularized low-rank matrix estimation","volume-title":"arXiv:1410.8275","author":"Josse","year":"2014"},{"key":"2026033014113953800_ref069","article-title":"Confidence areas for fixed-effects pea","volume-title":"arXiv:1407.7614","author":"Josse","year":"2014"},{"issue":"5","key":"2026033014113953800_ref070","doi-asserted-by":"crossref","first-page":"2327","DOI":"10.1137\/080731359","article-title":"Low-rank optimization on the cone of positive semidefinite matrices","volume":"20","author":"Journ\u00e9e","year":"2010","journal-title":"SIAM Journal on Optimization"},{"key":"2026033014113953800_ref071","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"Kaufman","year":"2009"},{"key":"2026033014113953800_ref072","volume-title":"Efficient algorithms for collaborative filtering","author":"Keshavan","year":"2012"},{"key":"2026033014113953800_ref073","first-page":"1503","volume-title":"2010 IEEE International Symposium on Information Theory Proceedings (ISIT)","author":"Keshavan","year":"2010"},{"key":"2026033014113953800_ref074","first-page":"952","article-title":"Matrix completion from noisy entries","volume-title":"Advances in Neural Information Processing Systems","author":"Keshavan","year":"2009"},{"key":"2026033014113953800_ref075","article-title":"A gradient descent algorithm on the Grassman manifold for matrix completion","volume-title":"arXiv:0910.5260","author":"Keshavan","year":"2009"},{"issue":"1","key":"2026033014113953800_ref076","doi-asserted-by":"crossref","first-page":"2980","DOI":"10.1109\/TIT.2010.2046205","article-title":"Matrix completion from a few entries","volume":"56","author":"Keshavan","year":"2010","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"2026033014113953800_ref077","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1093\/bioinformatics\/btm134","article-title":"Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis","volume":"23","author":"Kim","year":"2007","journal-title":"Bioinformatics"},{"issue":"2","key":"2026033014113953800_ref078","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/07069239X","article-title":"Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method","volume":"30","author":"Kim","year":"2008","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"2026033014113953800_ref079","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10898-013-0035-4","article-title":"Algorithms for nonnegative matrix and tensor factorizations: A unified view based on block coordinate descent framework","volume":"58","author":"Kim","year":"2014","journal-title":"Journal of Global Optimization"},{"key":"2026033014113953800_ref080","first-page":"353","article-title":"Toward faster nonnegative matrix factorization: A new algorithm and comparisons","volume-title":"Eighth IEEE International Conference on Data Mining","author":"Kim","year":"2008"},{"issue":"6","key":"2026033014113953800_ref081","doi-asserted-by":"crossref","first-page":"3261","DOI":"10.1137\/110821172","article-title":"Fast nonnegative matrix factorization: An activeset-like method and comparisons","volume":"33","author":"Kim","year":"2011","journal-title":"SIAM Journal on Scientific Computing"},{"key":"2026033014113953800_ref082","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511754098","volume-title":"Quantile regression","author":"Koenker","year":"2005"},{"key":"2026033014113953800_ref083","doi-asserted-by":"crossref","first-page":"33","DOI":"10.2307\/1913643","article-title":"Regression quantiles","author":"Koenker","year":"1978","journal-title":"Econometrica: Journal of the Econometric Society"},{"issue":"4","key":"2026033014113953800_ref084","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: A survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Operations Research"},{"issue":"6755","key":"2026033014113953800_ref085","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"Lee","year":"1999","journal-title":"Nature"},{"key":"2026033014113953800_ref086","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume-title":"Advances in Neural Information Processing Systems","author":"Lee","year":"2001"},{"key":"2026033014113953800_ref087","first-page":"801","article-title":"Efficient sparse coding algorithms","volume-title":"Advances in Neural Information Processing Systems","author":"Lee","year":"2006"},{"key":"2026033014113953800_ref088","first-page":"1297","article-title":"Practical large-scale optimization for max-norm regularization","volume-title":"Advances in Neural Information Processing Systems","author":"Lee","year":"2010"},{"issue":"465","key":"2026033014113953800_ref089","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1198\/016214504000000098","article-title":"Multicategory support vector machines: Theory and application to the classification of microarray data and satellite radiance data","volume":"99","author":"Lee","year":"2004","journal-title":"Journal of the American Statistical Association"},{"key":"2026033014113953800_ref090","article-title":"A technique for the measurement of attitudes","author":"Likert","year":"1932","journal-title":"Archives of Psychology"},{"issue":"10","key":"2026033014113953800_ref091","doi-asserted-by":"crossref","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","article-title":"Projected gradient methods for nonnegative matrix factorization","volume":"19","author":"Lin","year":"2007","journal-title":"Neural Computation"},{"issue":"3","key":"2026033014113953800_ref092","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1137\/090755436","article-title":"Interior-point method for nuclear norm approximation with application to system identification","volume":"31","author":"Liu","year":"2009","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"2026033014113953800_ref093","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"key":"2026033014113953800_ref094","article-title":"Deflation methods for sparse PCA","volume-title":"Advances in Neural Information Processing Systems","author":"Mackey","year":"2009"},{"key":"2026033014113953800_ref095","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1145\/1553374.1553463","volume-title":"Proceedings of the 26th Annual International Conference on Machine Learning","author":"Mairal","year":"2009"},{"key":"2026033014113953800_ref096","first-page":"1033","article-title":"Supervised dictionary learning","volume-title":"Advances in Neural Information Processing Systems","author":"Mairal","year":"2009"},{"key":"2026033014113953800_ref097","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-2227-2","volume-title":"Low Rank Approximation: Algorithms, Implementation, Applications","author":"Markovsky","year":"2012"},{"key":"2026033014113953800_ref098","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"Mazumder","year":"2010","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033014113953800_ref099","article-title":"Efficient estimation of word representations in vector space","volume-title":"arXiv:1301.3781","author":"Mikolov","year":"2013"},{"key":"2026033014113953800_ref100","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume-title":"Advances in Neural Information Processing Systems","author":"Mikolov","year":"2013"},{"key":"2026033014113953800_ref101","first-page":"598","volume-title":"Advances in Neural Information Processing Systems","author":"Minka","year":"2001"},{"key":"2026033014113953800_ref102","doi-asserted-by":"crossref","first-page":"2953","DOI":"10.1109\/ACC.2010.5531594","volume-title":"Proceedings of the 2010 American Control Conference (ACC)","author":"Mohan","year":"2010"},{"key":"2026033014113953800_ref103","first-page":"1107","article-title":"Provable non-convex robust PCA","volume-title":"Advances in Neural Information Processing Systems","author":"Netrapalli","year":"2014"},{"key":"2026033014113953800_ref104","article-title":"Hogwild!: A lock-free approach to parallelizing stochastic gradient descent","volume-title":"Advances in Neural Information Processing Systems","author":"Niu","year":"2011"},{"key":"2026033014113953800_ref105","volume-title":"Numerical optimization","author":"Nocedal","year":"2006"},{"issue":"23","key":"2026033014113953800_ref106","doi-asserted-by":"crossref","first-page":"3311","DOI":"10.1016\/S0042-6989(97)00169-7","article-title":"Sparse coding with an overcomplete basis set: A strategy employed by V1?","volume":"37","author":"Olshausen","year":"1997","journal-title":"Vision Research"},{"key":"2026033014113953800_ref107","volume-title":"Low Rank Representations of Matrices using Nuclear Norm Heuristics","author":"Osnaga","year":"2014"},{"key":"2026033014113953800_ref108","first-page":"564","article-title":"Bi-cross-validation of the svd and the nonnegative matrix factorization","author":"Owen","year":"2009","journal-title":"The Annals of Applied Statistics"},{"issue":"3","key":"2026033014113953800_ref109","first-page":"123","article-title":"Proximal algorithms","volume":"1","author":"Parikh","year":"2013","journal-title":"Foundations and Trends in Optimization"},{"issue":"2, Part 2","key":"2026033014113953800_ref110","doi-asserted-by":"crossref","first-page":"3336","DOI":"10.1016\/j.eswa.2008.01.039","article-title":"A simple and fast algorithm for k-medoids clustering","volume":"36","author":"Park","year":"2009","journal-title":"Expert Systems with Applications"},{"issue":"11","key":"2026033014113953800_ref111","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1080\/14786440109462720","article-title":"On lines and planes of closest fit to systems of points in space","volume":"2","author":"Pearson","year":"1901","journal-title":"The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science"},{"key":"2026033014113953800_ref112","doi-asserted-by":"crossref","DOI":"10.3115\/v1\/D14-1162","article-title":"Glove: Global vectors for word representation","volume":"12","author":"Pennington","year":"2014","journal-title":"Proceedings of the Empiricial Methods in Natural Language Processing (EMNLP 2014)"},{"key":"2026033014113953800_ref113","article-title":"Cross-validation for unsupervised learning","volume-title":"arXiv:0909.3052","author":"Perry","year":"2009"},{"key":"2026033014113953800_ref114","first-page":"547","article-title":"Large margin DAGs for multiclass classification","volume-title":"Advances in Neural Information Processing Systems","author":"Platt","year":"1999"},{"issue":"1","key":"2026033014113953800_ref115","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1207\/S15328031US0201_02","article-title":"Repairing Tom Swift\u2019s electric factor analysis machine","volume":"2","author":"Preacher","year":"2003","journal-title":"Understanding Statistics: Statistical Issues in Psychology, Education, and the Social Sciences"},{"key":"2026033014113953800_ref116","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/1273496.1273592","volume-title":"Proceedings of the 24th International Conference on Machine Learning","author":"Raina","year":"2007"},{"issue":"3","key":"2026033014113953800_ref117","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","article-title":"Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization","volume":"52","author":"Recht","year":"2010","journal-title":"SIAM Review"},{"issue":"2","key":"2026033014113953800_ref118","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s12532-013-0053-8","article-title":"Parallel stochastic gradient algorithms for large-scale matrix completion","volume":"5","author":"Recht","year":"2013","journal-title":"Mathematical Programming Computation"},{"key":"2026033014113953800_ref119","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","volume-title":"Advances in Neural Information Processing Systems","author":"Recht","year":"2011"},{"key":"2026033014113953800_ref120","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1145\/1102351.1102441","volume-title":"Proceedings of the 22nd International Conference on Machine Learning","author":"Rennie","year":"2005"},{"key":"2026033014113953800_ref121","article-title":"Personality, motivation and cognitive performance: Final report to the army research institute on contract MDA 903-93-K-0008","author":"Revelle","year":"1998"},{"key":"2026033014113953800_ref122","article-title":"Alternating maximization: Unifying framework for 8 sparse PCA formulations and efficient parallel codes","volume-title":"arXiv:1212.4137","author":"Richt\u00e1rik","year":"2012"},{"key":"2026033014113953800_ref123","first-page":"101","article-title":"In defense of one-vs-all classification","volume":"5","author":"Rifkin","year":"2004","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033014113953800_ref124","first-page":"46","article-title":"A generalized linear model for principal component analysis of binary data","volume":"38","author":"Schein","year":"2003","journal-title":"Proceedings of the Ninth International Workshop on Artificial Intelligence and Statistics"},{"key":"2026033014113953800_ref125","article-title":"Factorbird \u2014 a parameter server approach to distributed matrix factorization","volume-title":"NIPS 2014 Workshop on Distributed Machine Learning and Matrix Computations","author":"Scheiter","year":"2014"},{"issue":"2","key":"2026033014113953800_ref126","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.ipm.2004.11.005","article-title":"Document clustering using nonnegative matrix factorization","volume":"42","author":"Shahnaz","year":"2006","journal-title":"Information Processing & Management"},{"key":"2026033014113953800_ref127","article-title":"Large-scale convex minimization with a low-rank constraint","volume-title":"arXiv:1106.1622","author":"Shalev-Shwartz","year":"2011"},{"issue":"6","key":"2026033014113953800_ref128","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.1016\/j.jmva.2007.06.007","article-title":"Sparse principal component analysis via regularized low rank matrix approximation","volume":"99","author":"Shen","year":"2008","journal-title":"Journal of Multivariate Analysis"},{"key":"2026033014113953800_ref129","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/978-3-540-87481-2_24","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"Singh","year":"2008"},{"key":"2026033014113953800_ref130","first-page":"2689","volume-title":"Proceedings of the 2010 American Control Conference (ACC)","author":"Smith","year":"2012"},{"issue":"4","key":"2026033014113953800_ref131","doi-asserted-by":"crossref","first-page":"2195","DOI":"10.1214\/12-AOS1034","article-title":"A geometric analysis of subspace clustering with outliers","volume":"40","author":"Soltanolkotabi","year":"2012","journal-title":"The Annals of Statistics"},{"key":"2026033014113953800_ref132","article-title":"Robust subspace clustering","volume-title":"arXiv:1301.2603","author":"Soltanolkotabi","year":"2013"},{"key":"2026033014113953800_ref133","volume-title":"Learning with Matrix Factorizations","author":"Srebro","year":"2004"},{"key":"2026033014113953800_ref134","first-page":"720","article-title":"Weighted low-rank approximations","volume":"3","author":"Srebro","year":"2003","journal-title":"ICML"},{"key":"2026033014113953800_ref135","first-page":"1329","article-title":"Maximum-margin matrix factorization","volume":"17","author":"Srebro","year":"2004","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2026033014113953800_ref136","first-page":"3266","article-title":"Learning distributed representations for structured output prediction","volume-title":"Advances in Neural Information Processing Systems","author":"Srikumar","year":"2014"},{"issue":"1","key":"2026033014113953800_ref137","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"The Journal of Machine Learning Research"},{"key":"2026033014113953800_ref138","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-540-74958-5_33","volume-title":"Machine Learning: ECML 2007","author":"Steck","year":"2007"},{"key":"2026033014113953800_ref139","doi-asserted-by":"crossref","DOI":"10.1109\/ICASSP.2014.6854796","article-title":"Alternating direction method of multipliers for non-negative matrix factorization with the beta-divergence","volume-title":"IEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP)","author":"Sun","year":"2014"},{"key":"2026033014113953800_ref140","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/FOCS.2015.25","volume-title":"2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS)","author":"Sun","year":"2015"},{"issue":"1","key":"2026033014113953800_ref141","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF02293745","article-title":"Nonmetric individual differences multidimensional scaling: an alternating least squares method with optimal scaling features","volume":"42","author":"Takane","year":"1977","journal-title":"Psychometrika"},{"issue":"3","key":"2026033014113953800_ref142","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1111\/1467-9868.00196","article-title":"Probabilistic principal component analysis","volume":"61","author":"Tipping","year":"1999","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"key":"2026033014113953800_ref143","article-title":"The information bottleneck method","volume-title":"physics\/0004057","author":"Tishby","year":"2000"},{"key":"2026033014113953800_ref144","volume-title":"Topics in Sparse Approximation","author":"Tropp","year":"2004"},{"issue":"12","key":"2026033014113953800_ref145","doi-asserted-by":"crossref","first-page":"4655","DOI":"10.1109\/TIT.2007.909108","article-title":"Signal recovery from random measurements via orthogonal matching pursuit","volume":"53","author":"Tropp","year":"2007","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"2026033014113953800_ref146","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/A:1004678431677","article-title":"Nearest q-flat to m points","volume":"105","author":"Tseng","year":"2000","journal-title":"Journal of Optimization Theory and Applications"},{"key":"2026033014113953800_ref147","first-page":"579","article-title":"An index which distinguishes between some important exponential families","volume-title":"Statistics: Applications and New Directions. Proceedings of the Indian Statistical Institute Golden Jubilee International Conference","author":"Tweedie","year":"1984"},{"key":"2026033014113953800_ref148","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1145\/1553374.1553509","volume-title":"Proceedings of the 26th annual International Conference on Machine Learning","author":"Usunier","year":"2009"},{"issue":"3","key":"2026033014113953800_ref149","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/070709967","article-title":"On the complexity of nonnegative matrix factorization","volume":"20","author":"Vavasis","year":"2009","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"2026033014113953800_ref150","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1109\/MSP.2010.939739","article-title":"A tutorial on subspace clustering","volume":"28","author":"Vidal","year":"2010","journal-title":"IEEE Signal Processing Magazine"},{"issue":"3","key":"2026033014113953800_ref151","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1109\/TASL.2006.885253","article-title":"Monaural sound source separation by nonnegative matrix factorization with temporal continuity and sparseness criteria","volume":"15","author":"Virtanen","year":"2007","journal-title":"IEEE Transactions on Audio, Speech, and Language Processing"},{"key":"2026033014113953800_ref152","first-page":"2670","article-title":"Fantope projection and selection: A near-optimal convex relaxation of sparse PCA","volume-title":"Advances in Neural Information Processing Systems 26","author":"Vu","year":"2013"},{"issue":"1","key":"2026033014113953800_ref153","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10994-010-5198-3","article-title":"Large scale image annotation: Learning to rank with joint word-image embeddings","volume":"81","author":"Weston","year":"2010","journal-title":"Machine Learning"},{"key":"2026033014113953800_ref154","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/2507157.2507210","volume-title":"Proceedings of the 7th ACM Conference on Recommender Systems","author":"Weston","year":"2013"},{"key":"2026033014113953800_ref155","article-title":"A penalized matrix decomposition, with applications to sparse principal components and canonical correlation analysis","volume-title":"Biostatistics","author":"Witten","year":"2009"},{"key":"2026033014113953800_ref156","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization","volume":"3","author":"Wright","year":"2009","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"5","key":"2026033014113953800_ref157","doi-asserted-by":"crossref","first-page":"3047","DOI":"10.1109\/TIT.2011.2173156","article-title":"Robust PCA via outlier pursuit","volume":"58","author":"Xu","year":"2012","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"2026033014113953800_ref158","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/BF02296972","article-title":"Regression with qualitative and quantitative variables: An alternating least squares method with optimal scaling features","volume":"41","author":"Young","year":"1976","journal-title":"Psychometrika"},{"key":"2026033014113953800_ref159","article-title":"NOMAD: Non-locking, stOchastic Multi-machine algorithm for Asynchronous and Decentralized matrix completion","volume-title":"arXiv:1312.0193","author":"Yun","year":"2013"},{"key":"2026033014113953800_ref160","first-page":"10","article-title":"Spark: Cluster computing with working sets","volume-title":"Proceedings of the 2nd USENIX conference on hot topics in cloud computing","author":"Zaharia","year":"2010"},{"issue":"2","key":"2026033014113953800_ref161","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1198\/106186006X113430","article-title":"Sparse principal component analysis","volume":"15","author":"Zou","year":"2006","journal-title":"Journal of Computational and Graphical Statistics"},{"issue":"3","key":"2026033014113953800_ref162","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1037\/0033-2909.99.3.432","article-title":"Comparison of five rules for determining the number of compo","volume":"99","author":"Zwick","year":"1986","journal-title":"Psychological bulletin"}],"container-title":["Foundations and Trends\u00ae in Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftmal\/article-pdf\/9\/1\/1\/11154049\/2200000055en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftmal\/article-pdf\/9\/1\/1\/11154049\/2200000055en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:10:48Z","timestamp":1777486248000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftmal\/article\/9\/1\/1\/1332389\/Generalized-Low-Rank-Models"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,23]]},"references-count":162,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,6,23]]}},"URL":"https:\/\/doi.org\/10.1561\/2200000055","relation":{},"ISSN":["1935-8237","1935-8245"],"issn-type":[{"value":"1935-8237","type":"print"},{"value":"1935-8245","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,23]]}}}