ویراساینس.
سند علمی

Greedy Learning of Generalized Low-Rank Models

Quanming Yao, James T. Kwok

چکیده

Learning of low-rank matrices is fundamental to many machine learning applications. A state-ofthe-art algorithm is the rank-one matrix pursuit (R1MP). However, it can only be used in matrix completion problems with the square loss. In this paper, we develop a more flexible greedy algorithm for generalized low-rank models whose optimization objective can be smooth or nonsmooth, general convex or strongly convex. The proposed algorithm has low per-iteration time complexity and fast convergence rate. Experimental results show that it is much faster than the state-of-the-art, with comparable or even better prediction performance.

اسناد مشابه

  • Learning of Generalized Low-Rank Models: A Greedy Approach

    سند علمی۲۰۱۶CoRRQuanming Yao, James T. Kwok

    Learning of low-rank matrices is fundamental to many machine learning applications. A state-of-the-art algorithm is the rank-one matrix pursuit (R1MP). However, it can only be used in matrix completion problems with the square loss. In this paper, we develop a more flexible greed

  • Time Series Forecasting via Learning Convolutionally Low-Rank Models

    مقاله‌ی دسترسی آزاد۲۰۲۲IEEE Transactions on Information Theory['Guangcan Liu', '']

    Recently, Liu and Zhang studied the rather challenging problem of time series forecasting from perspective compressed sensing. They proposed a no-learning method, named Convolution Nuclear Norm Minimization (CNNM), proved that CNNM can exactly recover future part its observed par

  • Generalized Low Rank Models a Dissertation Submitted to the Institute for Computational and Mathematical Engineering and the Committee on Graduate Studies of Stanford University in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy

    سند علمی۲۰۱۵Madeleine Udell

    Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. This dissertation extends the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal, and other data types. This fram

  • Generalized Low Rank Models

    سند علمی۲۰۱۶Foundations and Trends in Machine LearningMadeleine Udell, Corinne Horn, Reza Bosagh Zadeh, Stephen P. Boyd

    Principal components analysis (PCA) is a well-known technique for approximating a data set represented by a matrix 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. Thi

  • Discovering Patient Phenotypes Using Generalized Low Rank Models

    سند علمی۲۰۱۶Pacific Symposium on Biocomputing. Pacific Symposium on BiocomputingAlejandro Schuler, Vincent X. Liu, Joe Wan, Alison Callahan

    The practice of medicine is predicated on discovering commonalities or distinguishing characteristics among patients to inform corresponding treatment. Given a patient grouping (hereafter referred to as a phenotype), clinicians can implement a treatment pathway accounting for the

  • Generalized Low Rank Models

    مقاله‌ی دسترسی آزاد۲۰۱۶Foundations and Trends® in Machine LearningMadeleineUdell, CorinneHorn, RezaZadeh, StephenBoyd