mlsanityData to 7 Oct 2026

Density Estimation in Infinite Dimensional Exponential Families

arXiv 1312.3516 ↗First posted 12 Dec 2013math.ST stat.ME stat.MLcited by 41

Not on the map. Why?

Abstract (arXiv)

In this paper, we consider an infinite dimensional exponential family, P of probability densities, which are parametrized by functions in a reproducing kernel Hilbert space, H and show it to be quite rich in the sense that a broad class of densities on ℝd can be approximated arbitrarily well in Kullback-Leibler (KL) divergence by elements in P. The main goal of the paper is to estimate an unknown density, p0 through an element in P. Standard techniques like maximum likelihood estimation (MLE) or pseudo MLE (based on the method of sieves), which are based on minimizing the KL divergence between p0 and P, do not yield practically useful estimators because of their inability to efficiently handle the log-partition function. Instead, we propose an estimator, hatpn based on minimizing the Fisher divergence, J(p0Vert p) between p0 and p∈ P, which involves solving a simple finite-dimensional linear system. When p0∈P, we show that the proposed estimator is consistent, and provide a convergence rate of n^-minleftfrac23,frac2β+12β+2right in Fisher divergence under the smoothness assumption that log p0∈R(Cβ) for some β≥ 0, where C is a certain Hilbert-Schmidt operator on H and R(Cβ) denotes the image of Cβ. We also investigate the misspecified case of p0notinP and show that J(p0Verthatpn)rightarrow infp∈PJ(p0Vert p) as nrightarrow∞, and provide a rate for this convergence under a similar smoothness condition as above. Through numerical simulations we demonstrate that the proposed estimator outperforms the non-parametric kernel density estimator, and that the advantage with the proposed estimator grows as d increases.

Key facts. Cited by 41 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Dec 2013.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 9; 2022: 4; 2023: 11; 2024: 4; 2025: 8; 2026: 5.

41 papers.

Sort:

By area:

  1. 2024Optimal score estimation via empirical Bayes smoothingcited by 60
  2. 2021Nonlinear Invariant Risk Minimization: A Causal Approachcited by 42
  3. 2023Causal Representation Learning Made Identifiable by Grouping of Observational Variablescited by 30
  4. 2021PSD Representations for Effective Probability Modelscited by 22
  5. 2022Causal Balancing for Domain Generalizationcited by 20
  6. 2023Robust and Scalable Bayesian Online Changepoint Detectioncited by 16
  7. 2023Provable benefits of annealing for estimating normalizing constants: Importance Sampling, Noise-Contrastive Estimation, and beyondcited by 13
  8. 2021A Computationally Efficient Method for Learning Exponential Family Distributionscited by 10
  9. 2023Sampling Multimodal Distributions with the Vanilla Score: Benefits of Data-Based Initializationcited by 10
  10. 2023The Score-Difference Flow for Implicit Generative Modelingcited by 9
  11. 2023Differentiable Neural Networks with RePU Activation: with Applications to Score Estimation and Isotonic Regressioncited by 8
  12. 2022Algorithmic Differentiation for Automated Modeling of Machine Learned Force Fieldscited by 7
29 more
  1. 2023Neural Operator Variational Inference based on Regularized Stein Discrepancy for Deep Gaussian Processescited by 6
  2. 2021Exponential Family Model-Based Reinforcement Learning via Score Matchingcited by 5
  3. 2021Active Slices for Sliced Stein Discrepancycited by 3
  4. 2022Do autoencoders need a bottleneck for anomaly detection?cited by 3
  5. 2024Nonparametric Automatic Differentiation Variational Inference with Spline Approximationcited by 3
  6. 2023Conditionally Strongly Log-Concave Generative Modelscited by 2
  7. 2023Sobolev Space Regularised Pre Density Modelscited by 2
  8. 2023On Computationally Efficient Learning of Exponential Family Distributionscited by 2
  9. 2024Stein's method for marginals on large graphical modelscited by 2
  10. 2025Avoiding subtraction and division of stochastic signals using normalizing flows: NFdeconvolvecited by 2
  11. 2025Learning Theory for Kernel Bilevel Optimizationcited by 2
  12. 2025Fast and Scalable Score-Based Kernel Calibration Testscited by 2
  13. 2021Denoising Score Matching with Random Fourier Featurescited by 1
  14. 2022Strong posterior contraction rates via Wasserstein dynamicscited by 1
  15. 2023Bayes Hilbert Spaces for Posterior Approximationcited by 1
  16. 2024Robust Estimation for Kernel Exponential Families with Smoothed Total Variation Distancescited by 1
  17. 2025Uniform Convergence Beyond Glivenko-Cantellicited by 1
  18. 2026Provably Reliable Classifier Guidance via Cross-Entropy Controlcited by 1
  19. 2021Scalable Personalised Item Ranking through Parametric Density Estimationcited by 0
  20. 2021Estimating the Arc Length of the Optimal ROC Curve and Lower Bounding the Maximal AUCcited by 0
  21. 2021Kernel Deformed Exponential Families for Sparse Continuous Attentioncited by 0
  22. 2025Guiding Time-Varying Generative Models with Natural Gradients on Exponential Family Manifoldcited by 0
  23. 2025Nonparametric learning of heterogeneous graphical model on network-linked datacited by 0
  24. 2025Distributional Shrinkage I: Universal Denoiser Beyond Tweedie's Formulacited by 0
  25. 2025Distributional Shrinkage II: Higher-Order Scores Encode Brenier Mapcited by 0
  26. 2026Variance-Reduced Diffusion Sampling via Target Score Identitycited by 0
  27. 2026Finite Sample Bounds for Learning with Score Matchingcited by 0
  28. 2026Non-parametric recovery of causal diffusion mechanisms from steady-state observationscited by 0
  29. 2026Copula Active Subspaces I: A Score-Covariance Method for Reduced-Order Non-Gaussian Density Estimationcited by 0