Pith. sign in

REVIEW 2 cited by

Learning Density Evolution from Snapshot Data

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

arxiv 2502.17738 v1 pith:VMPSY4MN submitted 2025-02-25 math.ST stat.COstat.TH

classification math.STstat.COstat.TH
keywords densitydatae-npmleevolutionestimatinglearningnoisysnapshot
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Motivated by learning dynamical structures from static snapshot data, this paper presents a distribution-on-scalar regression approach for estimating the density evolution of a stochastic process from its noisy temporal point clouds. We propose an entropy-regularized nonparametric maximum likelihood estimator (E-NPMLE), which leverages the entropic optimal transport as a smoothing regularizer for the density flow. We show that the E-NPMLE has almost dimension-free statistical rates of convergence to the ground truth distributions, which exhibit a striking phase transition phenomenon in terms of the number of snapshots and per-snapshot sample size. To efficiently compute the E-NPMLE, we design a novel particle-based and grid-free coordinate KL divergence gradient descent (CKLGD) algorithm and prove its polynomial iteration complexity. Moreover, we provide numerical evidence on synthetic data to support our theoretical findings. This work contributes to the theoretical understanding and practical computation of estimating density evolution from noisy observations in arbitrary dimensions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Convergence Rate of the Solution of Multi-marginal Schrodinger Bridge Problem with Marginal Constraints from SDEs

    math.PR 2025-07 conditional novelty 6.0 of 10

    When the m marginal constraints are the time-marginals of an SDE with time-dependent drift, the multi-marginal Schrödinger bridge converges to the SDE's law at KL rate O(m^{-1}).

  2. Private Continuous-Time Synthetic Trajectory Generation via Mean-Field Langevin Dynamics

    cs.LG 2025-06 reject novelty 5.0 of 10

    A differentially private particle-gradient algorithm generates continuous-time synthetic trajectories from one snapshot per person, but its headline recovery rate applies only to a non-private infinite-particle idealization.

Pith tools