Sign inGet started
Paper · arXiv

Fast determinantal sampling on general spaces and diffusion geometry

Determinantal point processes have recently emerged as a kernel-based alternative to standard independent sampling for constructing efficient minibatches, coresets, and other compact representations of large-scale datasets. In particular, sampling mechanisms based on DPPs are believed to demonstrate better approximation properties compared to classical i.i.d. samplers, even at the scale of the exponent. One of the key strengths of DPP based samplers is that they can be deployed over very general spaces, in contrast to more classical sampling methods beyond i.i.d. which tend to work in very well-structured settings, principally Euclidean spaces. In this work, we establish explicit rate gua...

AuthorsHoang-Son Tran, Pranav Gupta, Subhroshekhar Ghosh
Primary categorystat.ML
Published7 July 2026
Last updated at source7 July 2026
stat.MLcs.LGmath.PR
Embed this entry
<iframe src="https://silytics.si/embed/item/9af1fa08-fd60-4a8b-975c-8d6506924919" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.