Parametric Models for Mutual Kernel Matrix Completion
원문 초록
Recent studies utilize multiple kernel learning to deal with incomplete-data problem. In this study, we introduce new methods that do not only complete multiple incomplete kernel matrices simultaneously, but also allow control of the flexibility of the model by parameterizing the model matrix. By imposing restrictions on the model covariance, overfitting of the data is avoided. A limitation of kernel matrix estimations done via optimization of an objective function is that the positive definiteness of the result is not guaranteed. In view of this limitation, our proposed methods employ the LogDet divergence, which ensures the positive definiteness of the resulting inferred kernel matrix. We empirically show that our proposed restricted covariance models, employed with LogDet divergence, yield significant improvements in the generalization performance of previous completion methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Contrastive Matrix Completion with Denoising and Augmented Graph Views for Robust Recommendation
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
An extrapolated and provably convergent algorithm for nonlinear matrix decomposition with the ReLU function
Interference-Aware Edge Runtime Prediction with Conformal Matrix Completion
Robust Matrix Completion for Discrete Rating-Scale Data
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
토론
이 논문과 연결된 포럼 글이 아직 없습니다.