mlsanityData to 14 Oct 2026

Sampling from Arbitrary Functions via PSD Models

arXiv 2110.10527 ↗First posted 20 Oct 2021cs.AI cs.LG math.STcited by 8

Not on the map. Why?

Abstract (arXiv)

In many areas of applied statistics and machine learning, generating an arbitrary number of independent and identically distributed (i.i.d.) samples from a given distribution is a key task. When the distribution is known only through evaluations of the density, current methods either scale badly with the dimension or require very involved implementations. Instead, we take a two-step approach by first modeling the probability distribution and then sampling from that model. We use the recently introduced class of positive semi-definite (PSD) models, which have been shown to be efficient for approximating probability densities. We show that these models can approximate a large class of densities concisely using few evaluations, and present a simple algorithm to effectively sample from these models. We also present preliminary empirical results to illustrate our assertions.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 7 of its 39 references that are in the map. First posted on arXiv 20 Oct 2021.

Builds on

7 of 39 references.

References · 7

  1. 2016Generalization Properties of Learning with Random Featurescited by 164
  2. 2015Less is More: Nystr"om Computational Regularizationcited by 91
  3. 2020Kernel methods through the roof: handling billions of points efficientlycited by 89
  4. 2017FALKON: An Optimal Large Scale Kernel Methodcited by 84
  5. 2020Non-parametric Models for Non-negative Functionscited by 41
  6. 2021PSD Representations for Effective Probability Modelscited by 23
  7. 2019Globally Convergent Newton Methods for Ill-conditioned Generalized Self-concordant Lossescited by 17

Built on by

Cited by year

Citing papers per year: 2023: 5; 2024: 2; 2025: 1.

8 papers.