Results 31 to 40 of about 158,513 (260)
Matrix Completion With Noise [PDF]
Proceedings of the IEEE, 2010 11 pages, 4 figures, 1 ...
Candès, Emmanuel J., Plan, Yaniv
openaire +3 more sources
Nonconvex matrix completion with Nesterov’s acceleration
Big Data Analytics, 2018 Background In matrix completion fields, the traditional convex regularization may fall short of delivering reliable low-rank estimators with good prediction performance. Previous works use the alternation least squares algorithm to optimize the nonconvex
Xiao-Bo Jin +4 more
doaj +1 more source
CoRR, 2018 Matrix completion aims to reconstruct a data matrix based on observations of a small number of its entries. Usually in matrix completion a single matrix is considered, which can be, for example, a rating matrix in recommendation system. However, in practical situations, data is often obtained from multiple sources which results in a collection of ...
Alaya, Mokhtar Z., Klopp, Olga
openaire +5 more sources
CoRR, 2014 The problem of finding the missing values of a matrix given a few of its entries, called matrix completion, has gathered a lot of attention in the recent years. Although the problem under the standard low rank assumption is NP-hard, Candès and Recht showed that it can be exactly relaxed if the number of observed entries is sufficiently large.
Vassilis Kalofolias +3 more
openaire +2 more sources
Binary Matrix Completion With Nonconvex Regularizers
IEEE Access, 2019 Many practical problems involve the recovery of a binary matrix from partial information, so the binary matrix completion (BMC) technique has increasingly been of interest in machine learning. In particular, we consider a special case of the BMC problems,
Chunsheng Liu, Hong Shan
doaj +1 more source
High-Performance Homomorphic Matrix Completion on Multiple GPUs
IEEE Access, 2020 In various applications such as trajectory tracking in mobile social networks and online recommendation systems, the massive raw data are often incomplete due to various unpredictable or unavoidable reasons. Matrix completion algorithms are effective for
Tao Zhang, Han Lu, Xiao-Yang Liu
doaj +1 more source
Anomaly-Tolerant Traffic Matrix Estimation via Prior Information Guided Matrix Completion
IEEE Access, 2017 Network management, planning, and optimization rely on accurate and complete traffic measurement. However, anomalies and missing data are inevitable in direct traffic measurement because of high measurement costs and unreliable network transport ...
Wencai Ye +4 more
doaj +1 more source
Accelerated Path Tracing With GAN and Matrix Completion
IEEE Access, 2021 Denoising-based techniques have recently been shown to be effective for accelerating path tracing rendering methods. However, there remains a problem which is input images need the minimum necessary samples number in order to ensure the quality of the ...
Qiwei Xing, Chunyi Chen, Zhihua Li
doaj +1 more source
Axioms, 2023 To improve the accuracy of color image completion with missing entries, we present a recovery method based on generalized higher-order scalars. We extend the traditional second-order matrix model to a more comprehensive higher-order matrix equivalent ...
Liang Liao +9 more
doaj +1 more source
Empirical Bayes matrix completion [PDF]
Computational Statistics & Data Analysis, 2019 We develop an empirical Bayes (EB) algorithm for the matrix completion problems. The EB algorithm is motivated from the singular value shrinkage estimator for matrix means by Efron and Morris (1972). Since the EB algorithm is essentially the EM algorithm applied to a simple model, it does not require heuristic parameter tuning other than tolerance ...
Takeru Matsuda, Fumiyasu Komaki
openaire +2 more sources