Kernel Singular Value Decomposition with Extension to Multiple Data Sources

arXiv:2610.03216v1 Announce Type: new Abstract: Kernel Singular Value Decomposition (KSVD) learns a pair of singular vectors w.r.t. an asymmetric kernel matrix, which can be induced by two data sources, e.g., the queries and keys in self-attention or the rows and columns of a given matrix. In this work, we extend KSVD to multiple data sources, namely eKSVD, which conducts joint nonlinear feature learning upon asymmetric kernels. In the primal formulation, the projections associated with each data source are jointly learned to capture maximal information, while incorporating pair-wise couplings. With the Lagrangian and its Karush-Kuhn-Tucker (KKT) conditions, the optimization in the dual leads to a generalization of the shifted eigenvalue problem in Lanczos decomposition theorem of KSVD. Further, a covariance-based framework is derived together with using neural networks (NNs) for explicit feature mappings, complementary to the kernel-based interpretation and optimization. Numerical experiments verify the effectiveness of our eKSVD compared to methods based on Mercer kernels for tackling multiple data sources, and our innovation of deploying NNs demonstrates great flexibility for kernel methods.

Related

• Learning predictive models for combinations of heterogeneous proteomic data sources
• Active multiple matrix completion with adaptive confidence sets
• Multi-kernel spectral clustering: Entrywise eigenvector perturbation bounds and exact recovery
• Kernel-based Operator Learning: Error Analysis, Budget Allocation, and a Physics-Informed Extension

Source: arXiv cs.LG | 2026-10-05