Results 1 to 10 of about 2,091,920 (156)
Partial Matrix Completion [PDF]
The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy can be drastically different over different entries.
Elad Hazan +4 more
core +8 more sources
Conformalized matrix completion [PDF]
Matrix completion aims to estimate missing entries in a data matrix, using the assumption of a low-complexity structure (e.g., low rank) so that imputation is possible. While many effective estimation algorithms exist in the literature, uncertainty quantification for this problem has proved to be challenging, and existing methods are extremely ...
Yu Gui, Rina Barber, Cong Ma 0001
core +5 more sources
Matrix Completion With Noise [PDF]
11 pages, 4 figures, 1 ...
Emmanuel Candès, Yaniv Plan
exaly +5 more sources
Poisson matrix completion [PDF]
Submitted to IEEE for ...
Yang Cao 0013, Yao Xie 0002
openaire +3 more sources
A Survey of Matrix Completion Methods for Recommendation Systems
In recent years, the recommendation systems have become increasingly popular and have been used in a broad variety of applications. Here, we investigate the matrix completion techniques for the recommendation systems that are based on collaborative ...
Andy Ramlatchan +5 more
doaj +3 more sources
The Q0-matrix completion problem [PDF]
A matrix is a Q0-matrix if for every k∈{1,2,…,n}, the sum of all k×k principal minors is nonnegative. In this paper, we study some necessary and sufficient conditions for a digraph to have Q0-completion. Later on we discuss the relationship between Q and
Kalyan Sinha
doaj +1 more source
Quaternion Matrix Factorization for Low-Rank Quaternion Matrix Completion
The main aim of this paper is to study quaternion matrix factorization for low-rank quaternion matrix completion and its applications in color image processing.
Jiang-Feng Chen +3 more
doaj +1 more source
Matrix Completion with Queries [PDF]
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data ...
Natali Ruchansky +2 more
openaire +3 more sources
Categorical matrix completion [PDF]
We consider the problem of completing a matrix with categorical-valued entries from partial observations. This is achieved by extending the formulation and theory of one-bit matrix completion. We recover a low-rank matrix $X$ by maximizing the likelihood ratio with a constraint on the nuclear norm of $X$, and the observations are mapped from entries of
Yang Cao 0013, Yao Xie 0002
openaire +3 more sources
Matrix completion via modified schatten 2/3-norm
Low-rank matrix completion is a hot topic in the field of machine learning. It is widely used in image processing, recommendation systems and subspace clustering.
Jincai Ha +3 more
doaj +1 more source

