Splitting numerical integration for matrix completion
Low rank matrix approximation is a popular topic in machine learning. In this paper, we propose a new algorithm for this topic by minimizing the least-squares estimation over the Riemannian manifold of fixed-rank matrices. The algorithm is an adaptation of classical gradient descent within the framework of optimization on manifolds. In particular, we reformulate an unconstrained optimization problem on a low-rank manifold into a differential dynamic system. We develop a splitting numerical integration method by applying a splitting integration scheme to the dynamic system. We conduct the convergence analysis of our splitting numerical integration algorithm. It can be guaranteed that the error between the recovered matrix and true result is monotonically decreasing in the Frobenius norm. Moreover, our splitting numerical integration can be adapted into matrix completion scenarios. Experimental results show that our approach has good scalability for large-scale problems with satisfactory accuracy
Code (0)
등록된 구현이 없습니다.
Tasks
Matrix CompletionNumerical IntegrationSimilar Papers 제목 키워드 기반
Multiple Testing of Linear Forms for Noisy Matrix Completion
Many important tasks of large-scale recommender systems can be naturally cast as testing multiple linear forms for noisy matrix completion. These problems, however, present unique challenges because of the subtle bias-an…
Matrix CompletionRecommendation SystemsvalidCompletion Time Minimization of Fog-RAN-Assisted Federated Learning With Rate-Splitting Transmission
This work studies federated learning (FL) over a fog radio access network, in which multiple internet-of-things (IoT) devices cooperatively learn a shared machine learning model by communicating with a cloud server (CS) …
Federated LearningQuantizationLeave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions
We study the problem of robust matrix completion (RMC), where the partially observed entries of an underlying low-rank matrix is corrupted by sparse noise. Existing analysis of the non-convex methods for this problem eit…
Low-Rank Matrix CompletionMatrix CompletionEuclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent
This paper proposes and analyzes a gradient-type algorithm based on Burer-Monteiro factorization, called the Asymmetric Projected Gradient Descent (APGD), for reconstructing the point set configuration from partial Eucli…
LEMMAMatrix CompletionGraph clustering, variational image segmentation methods and Hough transform scale detection for object measurement in images
We consider the problem of scale detection in images where a region of interest is present together with a measurement tool (e.g. a ruler). For the segmentation part, we focus on the graph based method by Flenner and Ber…
ClusteringGraph ClusteringImage SegmentationMatrix Completion+1