File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICDM.2019.00067
- Scopus: eid_2-s2.0-85078874206
- WOS: WOS:000555729900058
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: M-estimation in Low-Rank Matrix Factorization: A General Framework
Title | M-estimation in Low-Rank Matrix Factorization: A General Framework |
---|---|
Authors | |
Keywords | matrix recovery M-estimation matrix factorization robustness statistical foundation |
Issue Date | 2019 |
Publisher | IEEE, Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000179 |
Citation | 2019 IEEE International Conference on Data Mining (ICDM), Beijing, China, 8-11 November 2019, p. 568-577 How to Cite? |
Abstract | Many problems in science and engineering can be reduced to the recovery of an unknown large matrix from a small number of random linear measurements. Matrix factorization arguably is the most popular approach for low-rank matrix recovery. Many methods have been proposed using different loss functions, for example the most widely used L 2 loss, more robust choices such as L 1 and Huber loss, quantile and expectile loss for skewed data. All of them can be unified into the framework of M-estimation. In this paper, we present a general framework of low-rank matrix factorization based on M-estimation in statistics. The framework mainly involves two steps: firstly we apply Nesterov's smoothing technique to obtain an optimal smooth approximation for non-smooth loss function, such as L 1 and quantile loss; secondly we exploit an alternative updating scheme along with Nesterov's momentum method at each step to minimize the smoothed loss function. Strong theoretical convergence guarantee has been developed for the general framework, and extensive numerical experiments have been conducted to illustrate the performance of proposed algorithm. |
Persistent Identifier | http://hdl.handle.net/10722/286648 |
ISBN | |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Tu, W | - |
dc.contributor.author | Liu, P | - |
dc.contributor.author | Zhao, J | - |
dc.contributor.author | Liu, Y | - |
dc.contributor.author | Kong, L | - |
dc.contributor.author | Li, G | - |
dc.contributor.author | Jiang, B | - |
dc.contributor.author | Tian, G | - |
dc.contributor.author | Yao, H | - |
dc.date.accessioned | 2020-09-04T13:28:32Z | - |
dc.date.available | 2020-09-04T13:28:32Z | - |
dc.date.issued | 2019 | - |
dc.identifier.citation | 2019 IEEE International Conference on Data Mining (ICDM), Beijing, China, 8-11 November 2019, p. 568-577 | - |
dc.identifier.isbn | 1550-4786 | - |
dc.identifier.uri | http://hdl.handle.net/10722/286648 | - |
dc.description.abstract | Many problems in science and engineering can be reduced to the recovery of an unknown large matrix from a small number of random linear measurements. Matrix factorization arguably is the most popular approach for low-rank matrix recovery. Many methods have been proposed using different loss functions, for example the most widely used L 2 loss, more robust choices such as L 1 and Huber loss, quantile and expectile loss for skewed data. All of them can be unified into the framework of M-estimation. In this paper, we present a general framework of low-rank matrix factorization based on M-estimation in statistics. The framework mainly involves two steps: firstly we apply Nesterov's smoothing technique to obtain an optimal smooth approximation for non-smooth loss function, such as L 1 and quantile loss; secondly we exploit an alternative updating scheme along with Nesterov's momentum method at each step to minimize the smoothed loss function. Strong theoretical convergence guarantee has been developed for the general framework, and extensive numerical experiments have been conducted to illustrate the performance of proposed algorithm. | - |
dc.language | eng | - |
dc.publisher | IEEE, Computer Society. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000179 | - |
dc.relation.ispartof | IEEE International Conference on Data Mining Proceedings | - |
dc.rights | IEEE International Conference on Data Mining Proceedings. Copyright © IEEE, Computer Society. | - |
dc.rights | ©2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
dc.subject | matrix recovery | - |
dc.subject | M-estimation | - |
dc.subject | matrix factorization | - |
dc.subject | robustness | - |
dc.subject | statistical foundation | - |
dc.title | M-estimation in Low-Rank Matrix Factorization: A General Framework | - |
dc.type | Conference_Paper | - |
dc.identifier.email | Li, G: gdli@hku.hk | - |
dc.identifier.authority | Li, G=rp00738 | - |
dc.identifier.doi | 10.1109/ICDM.2019.00067 | - |
dc.identifier.scopus | eid_2-s2.0-85078874206 | - |
dc.identifier.hkuros | 313959 | - |
dc.identifier.spage | 568 | - |
dc.identifier.epage | 577 | - |
dc.identifier.isi | WOS:000555729900058 | - |
dc.publisher.place | United States | - |