Matrix completion from any given set of observations
In the matrix completion problem the aim is to recover an unknown real matrix from a subset of its entries. This problem comes up in many application areas, and has received a great deal of attention in the context of the netflix prize. A central approach to this problem is to output a matrix of low...
Saved in:
Main Authors: | Lee, Troy, Shraibman, Adi |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2014
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/106459 http://hdl.handle.net/10220/24021 http://nips.cc/Conferences/2013/Program/event.php?ID=3932 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
The cover number of a matrix and its algorithmic applications
by: Lee, Troy, et al.
Published: (2018) -
ADMM algorithms for matrix completion problem in noisy settings
by: Le, Tran Kien
Published: (2021) -
Fooling-sets and rank
by: Friesen, Mirjam, et al.
Published: (2015) -
An alignment-independent approach for the study of viral sequence diversity at any given rank of taxonomy lineage
by: Chong, Li Chuin, et al.
Published: (2022) -
Generalization bounds for inductive matrix completion in low-noise settings
by: LEDENT, Antoine, et al.
Published: (2023)