Abstract
Prior information can be incorporated in matrix completion to improve estimation accuracy and extrapolate the missing entries. Reproducing kernel Hilbert spaces provide tools to leverage the said prior information, and derive more reliable algorithms. This paper analyzes the generalization error of such approaches, and presents numerical tests confirming the theoretical results.
Original language | English (US) |
---|---|
Article number | 8974415 |
Pages (from-to) | 326-330 |
Number of pages | 5 |
Journal | IEEE Signal Processing Letters |
Volume | 27 |
DOIs | |
State | Published - 2020 |
Externally published | Yes |
Bibliographical note
Publisher Copyright:© 1994-2012 IEEE.
Keywords
- Matrix completion
- Rademacher complexity
- generalization error
- kernel regression