atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Low-Rank Factorization of Determinantal Point Processes

AAAI 2017 · Learning theory and algorithms › Matrix and tensor methods · approach: Structured low-rank learning · 39 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use low-rank kernel factorization (K=30) instead of full-rank kernelDPP for basket completion · Amazon Baby Registry (15 categories)average test log-likelihood: full-rank better in 9 categories, low-rank in 6No clear effect
use low-rank kernel factorization (K=15)DPP for basket completion · MS Storeaverage test log-likelihood: -15.10 -> -15.23Hurt
use low-rank factorization to train DPPDPP kernel learning · Amazon Baby Registrytraining time: 8.9x faster on averageHelped
use low-rank factorization for conditional predictionDPP basket completion · Amazon Baby Registryprediction time per basket: 2.55 ms -> 0.39 msHelped
use low-rank factorization for conditional prediction on larger catalogDPP basket completion · MS Store (2097 items)prediction time per basket: 1.66 s -> 83.6 ms (19.9x)Helped
increase number of latent trait dimensions K up to 14 and beyond (ablation)low-rank DPP · Amazon apparelaverage test log-likelihoodMixed
low-rank V matrix instead of full kernel storageDPP model · MS Storememory: 35.18 MB -> 251.6 KBHelped

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy