atlas

Research map / Learning theory and algorithms / Prediction and decision losses

A Tree-Based Method for Fast Repeated Sampling of Determinantal Point Processes

ICML 2019 · Learning theory and algorithms › Prediction and decision losses · approach: Ranking models from comparisons · 10 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
tree-based sampling replaces linear-in-N dual sampling for repeated DPP samplingDPP sampler · Movie recommendation (MovieLens, N=26744, D=30)time per sample: 42.2 ms to 3.2 msHelped
personalized tree-based sampling replaces personalized dual samplingpersonalized DPP sampler · Movie recommendation (MovieLens, N=26744, D=30)time per sample: 52.2 ms to 5.8 msHelped
approximate sampling (epsilon=0.4) on top of personalized tree sampling (ablation)personalized tree sampler · Random subset of 5000 moviessampling speed relative to exact: about 1.5x fasterHelped
approximate sampling via uniform short-circuit (epsilon=0.1) (ablation)personalized tree sampler · Synthetic, N=5000, k=5, n=5 (Figure 3)runtime (s): Approx. significantly faster than Exact under all conditionsHelped
tree-based sampling vs dual sampling on synthetic data with large NDPP sampler · N=10^5, D=10, k=10 (Figure 2)sampling speedup: over 300x speedup reported in abstractHelped

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