stat.MLOct 9, 2026

Scalable Learning of Determinantal Point Processes with Kernel-Structured Interactions

Authors: Takahiro Kawashima, Hideitsu Hino

Organizations: ZOZO Research · Institute of Statistical Mathematics · Waseda University

Abstract

Determinantal point processes (DPPs) on a finite set are probability models that exhibit repulsion where inter-item similarities are encoded by a positive definite kernel matrix. Scaling DPP learning to large datasets typically requires imposing structural constraints on the kernel matrix, such as a low-rank-plus-diagonal form. However, structural assumptions introduce a severe trade-off between expressive power and computational scalability. Our study addresses this challenge by (a) modeling the full-rank interactions via a nonlinear kernel function and latent features, (b) designing a surrogate function for the maximum likelihood estimator, and (c) adopting stochastic optimization using random features of the nonlinear kernel. Numerical experiments on real-world datasets demonstrate that our method significantly improves this trade-off, achieving better generalization performance with remarkable parameter efficiency.

Figures & tables

Appendix figures & tables3 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Generalized Determinantal Point Processes for Attraction and Repulsion with Distinct Interaction Kernels

    Oct 9, 2026Hideaki Ishibashi, Takahiro Kawashima, Hideitsu HinoDeterminantal Point Process

  2. Fast determinantal sampling on general spaces and diffusion geometry

    Jul 7, 2026Hoang-Son Tran, Pranav Gupta, Subhroshekhar GhoshDeterminantal Point Process