Name
Abstract | ||
|---|---|---|
Matrix factorization is a popular approach to solving matrix estimation problems based on partial observations. Existing matrix factorization is based on least squares and aims to yield a low-rank matrix to interpret the conditional sample means given the observations. However, in many real applications with skewed and extreme data, least squares cannot explain their central tendency or tail distributions, yielding undesired estimates. In this paper, we propose expectile matrix factorization by introducing asymmetric least squares, a key concept in expectile regression analysis, into the matrix factorization framework. We propose an efficient algorithm to solve the new problem based on alternating minimization and quadratic programming. We prove that our algorithm converges to a global optimum and exactly recovers the true underlying low-rank matrices when noise is zero. For synthetic data with skewed noise and a real-world dataset containing web service response times, the proposed scheme achieves lower recovery errors than the existing matrix factorization method based on least squares in a wide range of settings. |
Year | Venue | Field |
|---|---|---|
2017 | THIRTY-FIRST AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE | Mathematical optimization,Congruence of squares,Incomplete Cholesky factorization,Matrix decomposition,Eigendecomposition of a matrix,Non-negative matrix factorization,Dixon's factorization method,Linear least squares,Mathematics,Quadratic sieve |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rui Zhu | 1 | 6 | 0.78 |
| Di Niu | 2 | 453 | 41.73 |
| Linglong Kong | 3 | 42 | 11.37 |
| Zongpeng Li | 4 | 2054 | 153.21 |