REVIEW 4 cited by
On minimax density estimation via measure transport
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We study the convergence properties, in Hellinger and related distances, of nonparametric density estimators based on measure transport. These estimators represent the measure of interest as the pushforward of a chosen reference distribution under a transport map, where the map is chosen via a maximum likelihood objective (equivalently, minimizing an empirical Kullback-Leibler loss) or a penalized version thereof. We establish concentration inequalities for a general class of penalized measure transport estimators, by combining techniques from M-estimation with analytical properties of the transport-based density representation. We then demonstrate the implications of our theory for the case of triangular Knothe-Rosenblatt (KR) transports on the $d$-dimensional unit cube, and show that both penalized and unpenalized versions of such estimators achieve minimax optimal convergence rates over H\"older classes of densities. Specifically, we establish optimal rates for unpenalized nonparametric maximum likelihood estimation over bounded H\"older-type balls, and then for certain Sobolev-penalized estimators and sieved wavelet estimators.
Forward citations
Cited by 4 Pith papers
-
Convergence Rates for Distribution Matching with Sliced Optimal Transport
For Gaussian distributions, slice-matching to an isotropic target with decaying step sizes converges at rate O(k^{-(2α-1)}) in expectation.
-
Error Analysis of Triangular Optimal Transport Maps for Filtering
Conditional Brenier-map estimators provably converge to true conditionals, with mean map error decaying like N^{-1/4} (slow) or sqrt(log N / N) (fast), and these rates carry over to an idealized optimal-transport filter.
-
Generative multi-scale modeling and downscaling via spatial autoregressive transport maps
A new multi-fidelity Bayesian transport map method learns non-Gaussian joint distributions across spatial scales and outperforms existing emulators in downscaling climate fields from small training sets.
-
Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations
Sample-compressible distribution families are shown to be PAC-learnable under additive noise and adversarial corruption, given new stability and low-frequency assumptions.
Discussion (0). Continue with ORCID to comment.