Transductive Matrix Completion with Calibration for Multi-Task Learning
Multi-task learning has attracted much attention due to growing multi-purpose research with multiple related data sources. Moreover, transduction with matrix completion is a useful method in multi-label learning. In this paper, we propose a transductive matrix completion algorithm that incorporates a calibration constraint for the features under the multi-task learning framework. The proposed algorithm recovers the incomplete feature matrix and target matrix simultaneously. Fortunately, the calibration information improves the completion results. In particular, we provide a statistical guarantee for the proposed algorithm, and the theoretical improvement induced by calibration information is also studied. Moreover, the proposed algorithm enjoys a sub-linear convergence rate. Several synthetic data experiments are conducted, which show the proposed algorithm out-performs other existing methods, especially when the target matrix is associated with the feature matrix in a nonlinear way.
Code (0)
등록된 구현이 없습니다.
Tasks
Matrix CompletionMulti-Label LearningMulti-Task LearningSimilar Papers 제목 키워드 기반
Recognizing Emotions From Abstract Paintings Using Non-Linear Matrix Completion
Advanced computer vision and machine learning techniques tried to automatically categorize the emotions elicited by abstract paintings with limited success. Since the annotation of the emotional content is highly resourc…
General ClassificationMatrix CompletionMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATIONInductive Matrix Completion Based on Graph Neural Networks
We propose an inductive matrix completion model without using side information. By factorizing the (rating) matrix into the product of low-dimensional latent embeddings of rows (users) and columns (items), a majority of …
Graph Neural NetworkMatrix CompletionRecommendation SystemsTransfer LearningSpeedup Matrix Completion with Side Information: Application to Multi-Label Learning
In standard matrix completion theory, it is required to have at least $O(n\ln^2 n)$ observed entries to perfectly recover a low-rank matrix $M$ of size $n\times n$, leading to a large number of observations when $n$ is l…
Matrix CompletionMulti-Label LearningTransduction with Matrix Completion: Three Birds with One Stone
We pose transductive classification as a matrix completion problem. By assuming the underlying matrix has a low rank, our formulation is able to handle three problems simultaneously: i) multi-label learning, where each i…
General ClassificationMatrix CompletionMulti-Label LearningMulti-View Matrix Completion for Multi-Label Image Classification
There is growing interest in multi-label image classification due to its critical role in web-based image analytics-based applications, such as large-scale image retrieval and browsing. Matrix completion has recently bee…
ClassificationGeneral Classificationimage-classificationImage Classification+6