Density estimation using the perceptron

MaRDI QIDQ6887388zbMATH OpenFDO

Authors Patrik Róbert Gerber, Tianze Jiang, Yury Polyanskiy, Rui Sun

Publication date 9 December 2025

Published in Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://jmlr.org/papers/v26/24-0261.html

zbMATH Keywords

density estimationdiscrete distributionsGANhalfspacesone-hot encodingperceptrontotal variation

Mathematics Subject Classification ID

Density estimation (62G07) Learning and adaptive systems in artificial intelligence (68T05)

Cites work

• A kernel two-sample test
• Class of constructive asymptotically good algebraic codes
• Eigenvalues of euclidean distance matrices
• Energy statistics: a class of statistics based on distances
• Equivalence of distance-based and RKHS-based statistics in hypothesis testing
• Error bounds for approximations with deep ReLU networks
• Estimation of distribution density
• Hardness of learning halfspaces with noise
• High-dimensional probability. An introduction with applications in data science
• scientific article; zbMATH DE number 1909499 (Why is no real title available?)
• scientific article; zbMATH DE number 7626743 (Why is no real title available?)
• scientific article; zbMATH DE number 3367521 (Why is no real title available?)
• scientific article; zbMATH DE number 3399629 (Why is no real title available?)
• Kernel Mean Embedding of Distributions: A Review and Beyond
• Measure estimation on manifolds: an optimal transport approach
• Minimax bounds for estimating multivariate Gaussian location mixtures
• Minimax rate of distribution estimation on unknown submanifolds under adversarial losses
• Minimax Testing of Nonparametric Hypotheses on a Distribution Density in the $L_p$ Metrics
• Nonparametric goodness-of-fit testing under Gaussian models
• Norm estimates for the inverses of a general class of scattered-data radial-function interpolation matrices
• Random codes: minimum distances and error exponents
• Rates of convergence of minimum distance estimators and Kolmogorov's entropy
• Remember the curse of dimensionality: the case of goodness-of-fit testing in arbitrary dimension
• Simultaneous approximation of a smooth function and its derivatives by deep neural networks with piecewise-polynomial activations
• Some Inequalities involving (r!)^1/r
• Wasserstein upper bounds of L^p-norms for multivariate densities in Besov spaces
• Wasserstein upper bounds of the total variation for smooth densities

Cited in

(1)

• Attainability of two-point testing rates for finite-sample location estimation

This page was built for publication: Density estimation using the perceptron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6887388)