Scalable Pairwise Kernel Learning with Stochastic Vec Trick

Napsu Karmitsa, Tapio Pahikkala, Antti Airola
6/15/2026
cs.LG

No official code found. Best implementation: napsu/SPaiK (0 stars, MIT, last commit 2026-06-16).

Abstract

Pairwise learning is a specialized form of supervised learning that focuses on predicting outcomes for pairs of objects. In this work, we introduce SPaiK, a new scalable kernel learning method tailored for pairwise settings. Our approach preserves the expressive power of kernel methods while substantially reducing computational and memory requirements. The key innovation is the stochastic generalized vec trick (sGVT), a stochastic extension of the sparse Kronecker product multiplication algorithm, which enables efficient large-scale training with pairwise kernels. By incorporating sGVT, SPaiK makes it possible to apply kernel-based pairwise learning to datasets of a size previously out of reach. We evaluate the performance of SPaiK on seven real-world drug-target affinity datasets and compare the results with state-of-the-art methods in pairwise learning.

View on arXivView PDF

Code Implementations(1)

napsu/SPaiKCommunity73%
MIT

Scalable pairwise kernel learning algorithm with stochastic generalized vec trick

00Sep 4, 20254 months agoMIT

Similar Papers

Cite this paper

@article{karmitsa2026scalable,
  title  = {Scalable Pairwise Kernel Learning with Stochastic Vec Trick},
  author = {Napsu Karmitsa and Tapio Pahikkala and Antti Airola},
  year   = {2026},
  eprint = {2606.16979},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2606.16979v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2606.16979.svg)](https://codeofpaper.com/paper/2606.16979)

Discussion