Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 59 min ago
PreprintarXiv licencearXiv

A data-driven Fourier-mixture neural-network method for density estimation

Abstract

We propose a data-driven Fourier-trained neural-network method for estimating fixed-horizon probability densities from empirical characteristic-function (CF) information. The estimator is a positive Gaussian--Laplace mixture with closed-form CF, so training can be performed directly in Fourier space while preserving nonnegativity and unit mass. We consider two sampling settings. In the direct i.i.d. sampling setting, the method is trained against an empirical CF constructed from i.i.d. samples. In the resampling-based pseudo-sampling setting, it is trained against an empirical pseudo-CF constructed from dependent data by resampling. For the direct i.i.d. case, we derive an expected squared L2 density-error bound that separates Fourier truncation, empirical training error, discretization, and CF sampling error, together with a corresponding bound for the expected L2 norm. For the pseudo-sampling case, we obtain conditional counterparts with an additional pseudo-law discrepancy term. We develop a multidimensional extension of the framework and analyze its computational complexity. Numerical experiments show competitive performance relative to Expectation--Maximization on Gaussian-mixture benchmarks and clear gains on heavy-tailed targets. A controlled comparison with exact-CF training quantifies the additional density error introduced by empirical-CF training; further experiments show that the L2 norm decays approximately as the inverse square root of the sample size when the remaining error terms are controlled, and demonstrate the method on a one-year Australian equity return law estimated from resampled dependent data.

Related

  1. Signed random Fourier features for fast density estimation with indefinite kernels
    Xie Wang, Nicolas Langrené, Wen Chen
    arXivPreprintarXiv licenceFull textProbabilityStatisticsarXiv
  2. Sandwich Variance Estimation in Scale Mixture of Skew-Normal Linear Mixed Models.
    Keyliane Travassos, Larissa A Matos, Fernanda L Schumacher
    Statistics in medicinePeer-reviewedCC BYFull textStatisticsEurope PMC
  3. Brown's loss function and estimation of the scale parameter and the entropy in scale mixture models with unknown location
    Stavros Kourouklis
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. Computer code validation via mixture model estimation
    Negar Soleimani, Pierre Barbillon, Kaniav Kamary +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  5. Mixture-based Nonparametric Estimation of Spatial Covariance Functions with Applications to HIV Key Population Size Estimation across Sub-Saharan Africa
    Manushi Siriwardana, Hyebin Song, Le Bao +1
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
BibTeX
@misc{dang2026datadriven,
  title = {{A data-driven Fourier-mixture neural-network method for density estimation}},
  author = {Duy-Minh Dang and Volter Entoma},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2605.18019},
  eprint = {2605.18019},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2605.18019},
}
RIS
TY  - UNPB
TI  - A data-driven Fourier-mixture neural-network method for density estimation
AU  - Duy-Minh Dang
AU  - Volter Entoma
PY  - 2026
DA  - 2026/09/11
PB  - arXiv
DO  - 10.48550/arxiv.2605.18019
UR  - https://arxiv.org/abs/2605.18019
AB  - We propose a data-driven Fourier-trained neural-network method for estimating fixed-horizon probability densities from empirical characteristic-function (CF) information. The estimator is a positive Gaussian--Laplace mixture with closed-form CF, so training can be performed directly in Fourier space while preserving nonnegativity and unit mass. We consider two sampling settings. In the direct i.i.d. sampling setting, the method is trained against an empirical CF constructed from i.i.d. samples. In the resampling-based pseudo-sampling setting, it is trained against an empirical pseudo-CF constructed from dependent data by resampling. For the direct i.i.d. case, we derive an expected squared L_2 density-error bound that separates Fourier truncation, empirical training error, discretization, and CF sampling error, together with a corresponding bound for the expected L_2 norm. For the pseudo-sampling case, we obtain conditional counterparts with an additional pseudo-law discrepancy term. We develop a multidimensional extension of the framework and analyze its computational complexity. Numerical experiments show competitive performance relative to Expectation--Maximization on Gaussian-mixture benchmarks and clear gains on heavy-tailed targets. A controlled comparison with exact-CF training quantifies the additional density error introduced by empirical-CF training; further experiments show that the L_2 norm decays approximately as the inverse square root of the sample size when the remaining error terms are controlled, and demonstrate the method on a one-year Australian equity return law estimated from resampled dependent data.
ER  -