Pith. sign in

REVIEW 2 major objections 4 minor 1 cited by

Principal Curves In Metric Spaces And The Space Of Probability Measures

T0 review · 2 major / 4 minor · reviewed 2026-08-15 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A length-penalized curve fitted to unlabeled population snapshots provably recovers their true developmental ordering.

desk verdict A genuinely new consistency result for metric-space principal curves, but the headline theorem promises probability-1 convergence that the proofs don't deliver—subsequential convergence is the actual content. read the letter →

arxiv 2505.04168 v1 pith:QZU7P3XF submitted 2025-05-07 math.ST stat.TH

Andrew Warren , Anton Afanassiev , Forest Kobayashi , Young-Heon Kim , Geoffrey Schiebinger This is my paper · ORCID
classification math.STstat.TH MSC 62G0549Q2062P1062R20
keywords principalcurvesWassersteinspaceoptimaltransportseriationmanifoldlearningtrajectoryinferenceGlivenko-Cantelliconsistency
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper establishes that principal curves—nonlinear one-dimensional summaries of a data distribution—can be defined and computed in any compact metric space, and that in the Wasserstein space of probability measures they give a statistically consistent way to recover an unlabeled developmental trajectory. The central setting is a curve $t\mapsto \rho_t$ of cell-population distributions, of which we see only unordered, noisy empirical snapshots; the paper proves that minimizers of a length-penalized curve-fitting objective converge, as data grow and the penalty shrinks, to a curve with the same range as $\rho_t$. When $\rho_t$ is injective, the ordering of the observed snapshots is recovered up to total reversal, which turns the method into a seriation algorithm. This matters because it makes high-density time-course experiments feasible: embryos or other samples can be processed in parallel without recorded collection times, and the times can be inferred afterward.

What carries the argument

The load-bearing object is the penalized principal-curve functional $\mathrm{PPC}(\Lambda)(\gamma)=\int_X d^2(x,\Gamma)\,d\Lambda(x)+\beta\,\mathrm{Length}(\gamma)$, minimized over absolutely continuous curves; the length penalty prevents space-filling solutions that would otherwise drive the fit to zero. Its discrete analogue $\mathrm{PPC}_K(\Lambda_N)$ replaces the curve by $K$ knots and the length by a sum of pairwise distances, and is minimized by a coupled Lloyd's algorithm alternating TSP reordering, Voronoi assignment, and Wasserstein-barycenter updates. The argument is carried by three linked convergence facts: minimizers of $\mathrm{PPC}_K(\Lambda_N)$ converge piecewise-geodesically to minimizers of $\mathrm{PPC}(\Lambda)$ as $N,K\to\infty$ (Theorem 2.5); the doubly empirical distribution over empirical measures converges to the true distribution over distributions (Theorem 3.1); and, when the data distribution is supported on an injective curve, sending $\beta\to 0$ forces minimizers to have exactly the curve's range, with the only remaining freedom a monotone or reverse-monotone reparametrization (Theorem 4.2, via Lemma A.9).

What would settle it

Take a compact convex domain $V$, an explicit injective Lipschitz curve $\rho:[0,1]\to\mathcal{P}(V)$, draw $N$ i.i.d. uniform times with $M$ samples per time, and solve the discrete objective (3) at increasing $N,M,K$ with $\beta$ shrinking; if the minimizer's projection pseudotime does not drive the Kendall-tau ordering error to zero, or if the limiting curve's range strictly contains the range of $\rho$, the theorem is false.

Watch

Extended reading notes

Core claim

The paper's main theorem (Theorem 1.1) says the following. Let $V$ be compact and convex, let $\rho_t$ be an injective Lipschitz curve in the Wasserstein space $\mathcal{P}(V)$, and form the empirical measure $\hat\Lambda$ from $N$ i.i.d. uniform times, with $M$ cells sampled at each time. Then, with probability 1, minimizers of the discretized penalized objective (3) converge, as $N,M,K$ grow and $\beta\to 0$, to a curve $\gamma^*$ with the same range as $\rho_t$; if $\rho_t$ is injective, the projection pseudotime recovers the time ordering up to total reversal. The proof runs through a general theory: existence and stability of minimizers of $\mathrm{PPC}(\Lambda)(\gamma)=\int d^2(x,\Gamma)\,d\Lambda(x)+\beta\,\mathrm{Length}(\gamma)$ in compact metric spaces, a discrete-to-continuum convergence theorem for the $K$-knot discretization, an iterated Glivenko-Cantelli theorem for doubly (and triply) empirical measures, and a characterization of length-minimizing curves through the range of an injective curve. A finite-read noise version also holds when sequencing depth grows fast enough.

Load-bearing premise

The load-bearing premise is that the ground-truth curve is injective and the observed time labels are i.i.d. uniform on $[0,1]$, so the data distribution is exactly the pushforward of uniform time along the curve; without that, order is not identifiable and the proof of Theorem 4.2 does not go through.

Editorial extensions

If this is right

  • Wasserstein principal curves give a consistent seriation method: fit the discrete penalized curve to empirical distributions, project each snapshot to the curve, and read off a pseudotime that matches the true order up to reversal.
  • Developmental biologists can collect time courses in parallel and infer collection times afterward, because the estimator requires neither known time labels nor a manual per-time-point pipeline.
  • The discrete-to-continuum theorem applies in any compact geodesic metric space, so the numerical discretization scheme is rigorously justified for Euclidean principal curves as well, where such schemes had previously been justified only heuristically.
  • With single-cell sequencing noise, consistency is retained provided read depth grows fast enough relative to the number of cells per time point, so shallow but well-spread sequencing can still recover the trajectory curve.
  • The framework yields a form of trajectory inference without time labels: a corollary is recovering latent one-dimensional structure from unlabeled marginal samples, something earlier optimal-transport trajectory inference did not address.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next step the paper leaves implicit is non-uniform sampling: if collection times are denser in fast-developing phases, the projection pseudotime would need to be corrected for the sampling density; the consistency theorem assumes uniform times.
  • The same discrete-to-continuum argument appears extendable to the loop and multiple-curve variants sketched in Section 5, which would give consistent cell-cycle ordering and branching analyses, though these extensions are not proven in the paper.
  • For fixed sequencing budgets, the theorem suggests a quantitative trade-off: $M$ must grow for each empirical measure to be accurate, while $N$ must grow to sample the curve densely, so an optimal allocation balancing both limits is a testable design question.
  • In branching data, ordering snapshots in Wasserstein space yields a single comparable order across branches, unlike feature-space pseudotimes, but the consistency theory currently assumes one injective curve and does not cover branch points.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 4 minor

Summary. The paper develops a theory of length-penalized principal curves in compact metric spaces and specializes it to Wasserstein space over a compact convex domain. The main results are: existence of minimizers for the penalized functional (Proposition 2.1), stability of minimizer sets under weak-* convergence of the data distribution (Proposition 2.3), a discrete-to-continuum convergence theorem for a piecewise-geodesic discretization (Theorem 2.5), an iterated Glivenko-Cantelli theorem for doubly empirical measures over distributions (Theorem 3.1), and a seriation consistency theorem stating that, as the length penalty tends to zero, minimizers recover the range and the time-ordering (up to reversal) of an injective ground-truth curve (Theorem 4.2 and Corollary 4.3). The paper also proposes a coupled Lloyd-type algorithm, a nonlocal kernel variant, and numerical experiments on simulated branching curves in Wasserstein space. The advertised flagship result, Theorem 1.1, claims probability-1 convergence of empirical minimizers to the ground-truth curve in the joint limit over the number of time points, samples, and knots and then in the length penalty.

Significance. If the consistency claims are stated precisely, this is a valuable contribution. It provides a rigorous variational framework for principal curves in metric spaces, and the discrete-to-continuum convergence (Theorem 2.5) appears to be new even in Euclidean settings. The iterated Glivenko-Cantelli theorem for doubly empirical measures is a useful standalone tool. The application to seriation for Wasserstein-space-valued data is well motivated by single-cell trajectory inference and the experiments demonstrate that the method is competitive with spectral seriation and TSP-based seriation. The proofs are detailed and largely self-contained, with an extensive appendix covering compactness, lower semicontinuity of length, RKHS background, and deferred arguments. However, as discussed below, the informal Theorem 1.1 overstates what the proofs establish, and the fixed-endpoint variant used in the experiments is not fully justified.

major comments (2)
  1. [Section 1, Theorem 1.1; Section 4, Corollary 4.3; Section 3, Theorem 3.1] The advertised probability-1 convergence in Theorem 1.1 is not supported by the proofs. Corollary 4.3 explicitly gives convergence only "up to passage to a subsequence twice," and Theorem 3.1(1) gives weak-* convergence of the doubly empirical measure only in probability, with almost-sure convergence along a subsequence; full almost-sure convergence requires the growth condition M >= C (log N)^q from Theorem 3.1(2), which is absent from Theorem 1.1. Moreover, literal convergence of arbitrarily selected minimizers is false because of time-reversal symmetry and non-uniqueness: for X=[0,1], rho(t)=t and Lambda=Unif[0,1], both gamma(t)=t and gamma(t)=1-t minimize PPC for every beta>0, so a sequence of minimizers alternating between the two has no limit as beta tends to 0. The theorem should be restated as a subsequential consistency result, or should explicitly impose a selection rule and the M-growth condition if an almost-sure statement is intended.
  2. [Section 4.2 and Appendix D.2, Algorithm 3] The experimental estimator is the fixed-endpoint, nonlocal objective PPC_K^w run with Algorithm 3. Appendix D.2 states that consistency for the fixed-endpoint variant "can be shown ... by an identical argument," but no proof is given, and the nonlocal discretization proof in Proposition D.1 does not address fixed endpoints. Since the experiments and the claimed practical seriation performance rely on this specific variant, the paper should either supply the missing consistency proof or explicitly identify this variant as heuristic and outside the proven theory.
minor comments (4)
  1. [Section 1, Theorem 1.1 display] The displayed sum in Theorem 1.1 uses the index T in the upper limit while the surrounding text uses N; the notation should be harmonized.
  2. [Section 3, Theorem 3.1] The notation for the doubly empirical measure alternates between \hat{\Lambda}_{N,M} and \hat{\Lambda}_{M,N}; please standardize to avoid confusion.
  3. [Section 4.2 and Appendix E] There are several typographical errors, including "principle curve" in the captions of Figures 3 and 4 and "V oronoi" spacing artifacts; these should be corrected in the final version.
  4. [Appendix A, Lemma A.9] The proof of Lemma A.9 is somewhat involved and its role in Theorem 4.2 is central; consider adding a short intuitive explanation before the formal casework.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the estimator is not defined from the ground-truth curve, and the consistency proof is self-contained.

full rationale

The derivation chain is self-contained. The ground-truth curve ρ enters the statistical model only through the data distribution Λ = ρ#Leb, while the estimator minimizes the empirical objective (3), which is defined directly from the observed empirical measures and does not use ρ or its time labels. The consistency argument proceeds by standard compactness (Arzelà–Ascoli), lower semicontinuity of length, the limiting behavior of the data fit term, and the in-paper Lemma A.9 characterizing length-minimizing curves through the range of an injective AC curve. No fitted parameter is renamed as a prediction: β is a regularization parameter sent to 0, and the limiting curve is shown to have the same range as ρ by a variational argument, not by fitting to ρ. The author-overlapping citations ([60], [54], [57]) provide biological motivation, the finite-reads noise model, and a remark that Proposition 2.3 is analogous to prior work; none of these carries the central noiseless consistency result, whose proofs (Theorems 2.5, 3.1, 4.2 and Corollary 4.3) are given in the paper. The skeptical concern that Theorem 1.1 asserts full probability-one convergence while the proofs establish only subsequential convergence is a rigor/correctness issue, not a circular reduction: it does not identify any quantity that is defined in terms of the quantity it is supposed to predict. Therefore no circular step is present.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

The central consistency theorem rests on standard variational arguments plus three domain assumptions: the base space V is compact/geodesic, the ground truth curve is injective and regular, and time labels are uniform. The noisy-read extension additionally imports an approximate-uniform-read assumption from [54]. The free parameters are the length penalty β and kernel bandwidth h, which are tuning parameters (sent to zero in the theory, tuned on training data in the experiments); the kernel shape w and knot count K are under-specified in the experimental appendix.

free parameters (4)
  • β (length penalty) = β = 0.17 and 0.037 in experiments (tuned on training data)
    Controls the trade-off between fit and curve length in objective (1); theory requires β→0 for consistency; in experiments it is chosen by grid search.
  • h (kernel bandwidth in nonlocal scheme) = h = 0.037 and 0.01 in experiments
    Bandwidth of the smoothing kernel in PPC_w^K; theory requires h→0; tuned on training data.
  • w (kernel shape parameters p, q) = not specified
    The nonlocal kernel is suggested as (1-|t|^p)^q_+ but the parameters are not given; this affects the experimental method.
  • K (number of knots) = not reported
    Discretization resolution in Algorithm 1/3; the theory sends K→∞, but experiments do not state K.
assumptions (6)
  • domain assumption V is a compact, convex domain (or compact metric space), so that (P(V), W₂) is a compact geodesic metric space.
    Used throughout Section 3 and Theorem 2.5; requires existence of geodesics between probability measures.
  • domain assumption The ground truth curve ρ_t is injective and absolutely continuous (it suffices that it is Lipschitz).
    Needed for Theorem 4.2 and Proposition 4.4; injectivity allows uniqueness of the length-minimizing curve through the range (Lemma A.9) and identification of the ordering up to reversal.
  • domain assumption The observed time labels are i.i.d. uniform on [0,1], so Λ = ρ(·)#Leb[0,1].
    This is the data-generating model in Section 1 and Section 4; the seriation consistency relies on the volume measure being the pushforward of Lebesgue.
  • standard math There exists an RKHS H on V whose MMD metrizes the weak* topology on P(V).
    Proved in Appendix B via embedding compact metric spaces into ℓ₂ and using results of [93]; used in the proof of Theorem 3.1 for Glivenko-Cantelli rates.
  • domain assumption For the noisy finite-read model, the distribution of reads satisfies Assumption 2.3 of [54] (approximately uniform reads).
    Imported from prior work to prove Proposition 3.2; the assumption is not restated.
  • standard math Classical results: Arzelà-Ascoli compactness, lower semicontinuity of length, Glivenko-Cantelli, Prokhorov's theorem, optimal transport theory.
    Used throughout the proofs.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Principal Curves In Metric Spaces And The Space Of Probability Measures." pith.science (2026). https://pith.science/paper/QZU7P3XF

@misc{pith2026250504168,
  author       = {Pith},
  title        = {Pith review of: Principal Curves In Metric Spaces And The Space Of Probability Measures},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QZU7P3XF}},
  note         = {Machine review of arXiv:2505.04168}
}
read the original abstract

We introduce principal curves in Wasserstein space, and in general compact metric spaces. Our motivation for the Wasserstein case comes from optimal-transport-based trajectory inference, where a developing population of cells traces out a curve in Wasserstein space. Our framework enables new experimental procedures for collecting high-density time-courses of developing populations of cells: time-points can be processed in parallel (making it easier to collect more time-points). However, then the time of collection is unknown, and must be recovered by solving a seriation problem (or one-dimensional manifold learning problem). We propose an estimator based on Wasserstein principal curves, and prove it is consistent for recovering a curve of probability measures in Wasserstein space from empirical samples. This consistency theorem is obtained via a series of results regarding principal curves in compact metric spaces. In particular, we establish the validity of certain numerical discretization schemes for principal curves, which is a new result even in the Euclidean setting.

Figures

Figures reproduced from arXiv: 2505.04168 by the authors.

Figure 1
Figure 1. (a) An illustration showing ρt (blue) at evenly-spaced time samples t1, . . ., tN , with the samples comprising ρˆtn shown in red. (b) An illustration of a principal curve γt (black curve) “fitting” the empirical measures ρˆtn , each of which is represented by a single red dot. Note that the curve achieves low average projection distance, while the curve itself is not “too long”. The straight lines connecting indivi… view at source ↗
Figure 2
Figure 2. A visualization of one loop of the algorithm. (a) A local view of the situation in the [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. A simple curve of probability measures with 250 time points that undergoes a branch [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figures from the paper (5 more)
Figure 4
Figure 4. Figure 4: A curve in the space of probability measures with a non-trivial change in direction, [PITH_FULL_IMAGE:figures/full_fig_p022_4.png]
Figure 4
Figure 4. Figure 4: Illustration for the proof of Proposition [PITH_FULL_IMAGE:figures/full_fig_p037_4.png]
Figure 5
Figure 5. Figure 5: A set of parameter sweeps on Test Dataset 1 generated with [PITH_FULL_IMAGE:figures/full_fig_p052_5.png]
Figure 6
Figure 6. Figure 6: A set of parameter sweeps on Test Dataset 2 generated with [PITH_FULL_IMAGE:figures/full_fig_p052_6.png]
Figure 7
Figure 7. Figure 7: A sweep of kernel bandwidths for spectral seriation for Test Dataset 1 (A) and the Test [PITH_FULL_IMAGE:figures/full_fig_p053_7.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. On the convergence of graph Laplacians with a symmetric divergence

    stat.ML 2026-07 conditional novelty 6.0 of 10

    Graph Laplacians constructed from a smooth nondegenerate symmetric divergence D on a compact Riemannian manifold converge pointwise to the Laplace–Beltrami operator under a fourth-order closeness condition to squared ...

Reference graph

Works this paper leans on

100 extracted references · 72 canonical work pages · cited by 1 Pith paper

  1. [1]

    Barycenters in the wasserstein space

    Martial Agueh and Guillaume Carlier. Barycenters in the wasserstein space. SIAM Journal on Mathematical Analysis, 43(2):904–924, 2011

    2011

  2. [2]

    Ambrosio and P

    L. Ambrosio and P. Tilli. Topics on Analysis in Metric Spaces. Oxford lecture series in mathematics and its applications. Oxford University Press, 2004

    2004

  3. [3]

    A user’s guide to optimal transport

    Luigi Ambrosio and Nicola Gigli. A user’s guide to optimal transport. In Modelling and optimisation of flows on networks, pages 1–155. Springer, 2013

    2013

  4. [4]

    Gradient flows: in metric spaces and in the space of probability measures

    Luigi Ambrosio, Nicola Gigli, and Giuseppe Savaré. Gradient flows: in metric spaces and in the space of probability measures. Springer Science & Business Media, 2008

    2008

  5. [5]

    The traveling salesman problem: a computational study, volume 17

    David L Applegate. The traveling salesman problem: a computational study, volume 17. Princeton university press, 2006

    2006

  6. [6]

    Atkins, Erik G

    Jonathan E. Atkins, Erik G. Boman, and Bruce Hendrickson. A Spectral Algorithm for Seriation and the Consecutive Ones Problem. SIAM Journal on Computing, 28(1):297–310, 1998. _eprint: https://doi.org/10.1137/S0097539795285771

    doi:10.1137/s0097539795285771 1998

  7. [7]

    Rademacher and gaussian complexities: Risk bounds and structural results

    Peter L Bartlett and Shahar Mendelson. Rademacher and gaussian complexities: Risk bounds and structural results. Journal of Machine Learning Research, 3(Nov):463–482, 2002

    2002

  8. [8]

    Second-order models for optimal transport and cubic splines on the wasserstein space

    Jean-David Benamou, Thomas O Gallouët, and François-Xavier Vialard. Second-order models for optimal transport and cubic splines on the wasserstein space. Foundations of Computational Mathematics, 19:1113–1143, 2019

    2019

Show all 100 references
  1. [9]

    Parameter Selection for Principal Curves

    Gérard Biau and Aurélie Fischer. Parameter Selection for Principal Curves. IEEE Trans. Inf. Theory, 58(3):1924–1939, October 2011

    1924

  2. [10]

    Dhillon, and Robert A

    Paolo Bientinesi, Inderjit S. Dhillon, and Robert A. van de Geijn. A Parallel Eigensolver for Dense Symmetric Matrices Based on Multiple Relatively Robust Representations. SIAM Journal on Scientific Computing, 27(1):43–66, 2005. _eprint: https://doi.org/10.1137/030601107

    2005 doi

  3. [11]

    Geodesic PCA in the Wasserstein space by convex PCA

    Jérémie Bigot, Raul Gouet, Thierry Klein, and Alfredo Lopez. Geodesic PCA in the Wasserstein space by convex PCA. Annales de l’Institut Henri Poincaré (B) Probabilités et Statistiques, 53(1):1–26, 2017

    2017

  4. [12]

    On the mean speed of convergence of empirical and occupation measures in Wasserstein distance

    Emmanuel Boissard and Thibaut Le Gouic. On the mean speed of convergence of empirical and occupation measures in Wasserstein distance. Annales de l’Institut Henri Poincaré (B) Probabilités et Statistiques, 50(2):539–563, 2014

    2014

  5. [13]

    Γ-convergence for beginners, volume 22 of of Oxford Lecture Series in Mathematics and its Applications

    Andrea Braides. Γ-convergence for beginners, volume 22 of of Oxford Lecture Series in Mathematics and its Applications. Oxford University Press, 2002

    2002

  6. [14]

    A course in metric geometry

    Dmitri Burago, Yuri Burago, and Sergei Ivanov. A course in metric geometry. American Mathematical Society, 2001

    2001

  7. [15]

    Optimal transportation problems with free dirichlet regions

    Giusppe Buttazzo, Edouard Oudet, and Eugene Stepanov. Optimal transportation problems with free dirichlet regions. In Gianni dal Maso and Franco Tomarelli, editors, Variational Methods for Discontinuous Structures, vol- ume 51 of Progress in Nonlinear Differential Equations an...

  8. [16]

    Hierarchical integral probability metrics: A distance on random probability measures with low sample com- plexity

    Marta Catalano and Hugo Lavenant. Hierarchical integral probability metrics: A distance on random probability measures with low sample com- plexity. In Ruslan Salakhutdinov, Zico Kolter, Katherine Heller, Adrian Weller, Nuria Oliver, Jonathan Scarlett, and Felix Berkenkamp, ed...

    2024

  9. [17]

    Geodesic pca versus log-pca of histograms in the wasserstein space

    Elsa Cazelles, Vivien Seguy, Jérémie Bigot, Marco Cuturi, and Nicolas Papadakis. Geodesic pca versus log-pca of histograms in the wasserstein space. SIAM Journal on Scientific Computing, 40(2):B429–B456, 2018. 26

    2018

  10. [18]

    Wasserstein regression

    Yaqing Chen, Zhenhua Lin, and Hans-Georg Müller. Wasserstein regression. Journal of the American Statistical Association, 118(542):869–882, 2023

    2023

  11. [19]

    Genovese, and Larry Wasserman

    Yen-Chi Chen, Christopher R. Genovese, and Larry Wasserman. Asymptotic theory for density ridges. Annals of Statistics, 43(5):1896–1928, 2015

    1928

  12. [20]

    Measure-valued spline curves: An optimal transport viewpoint

    Yongxin Chen, Giovanni Conforti, and Tryphon T Georgiou. Measure-valued spline curves: An optimal transport viewpoint. SIAM Journal on Mathematical Analysis, 50(6):5947–5968, 2018

    2018

  13. [21]

    Fast and smooth interpolation on wasserstein space

    Sinho Chewi, Julien Clancy, Thibaut Le Gouic, Philippe Rigollet, George Stepaniants, and Austin Stromme. Fast and smooth interpolation on wasserstein space. In International Conference on Artificial Intelligence and Statistics, pages 3061–3069. PMLR, 2021

    2021

  14. [22]

    Doubly regularized entropic wasserstein barycenters

    Lénaïc Chizat. Doubly regularized entropic wasserstein barycenters. arXiv preprint arXiv:2303.11844, 2023

    2023 arXiv

  15. [23]

    Trajectory inference via mean-field langevin in path space

    Lénaïc Chizat, Stephen Zhang, Matthieu Heitz, and Geoffrey Schiebinger. Trajectory inference via mean-field langevin in path space. Advances in Neural Information Processing Systems, 35:16731–16742, 2022

    2022

  16. [24]

    Spectral graph theory, volume 92 of Regional Conference Series in Mathematics

    Fan RK Chung. Spectral graph theory, volume 92 of Regional Conference Series in Mathematics. American Mathematical Society, 1997

    1997

  17. [25]

    Fast computation of wasserstein barycenters

    Marco Cuturi and Arnaud Doucet. Fast computation of wasserstein barycenters. In International conference on machine learning, pages 685–693. PMLR, 2014

    2014

  18. [26]

    Best approximation properties of spline functions of odd degree

    Carl De Boor. Best approximation properties of spline functions of odd degree. Journal of Mathematics and Mechanics, pages 747–749, 1963

    1963

  19. [27]

    Selected Papers

    Ennio De Giorgi. Selected Papers. Springer Collected Works in Mathematics. Springer Berlin Heidelberg, 2013

    2013

  20. [28]

    On principal curves with a length constraint

    Sylvain Delattre and Aurélie Fischer. On principal curves with a length constraint. Annales de l’Institut Henri Poincaré (B) Probabilités et Statistiques, 56(3):2108–2140, August 2020

    2020

  21. [29]

    Another look at principal curves and surfaces

    Pedro Delicado. Another look at principal curves and surfaces. Journal of Multivariate Analysis, 77(1):84–116, 2001

    2001

  22. [30]

    Persi Diaconis and R. L. Graham. Spearman’s footrule as a measure of disarray. Journal of the Royal Statistical Society. Series B (Methodological), 39(2):262–268, 1977

    1977

  23. [31]

    Extremal properties of principal curves in the plane

    Tom Duchamp and Werner Stuetzle. Extremal properties of principal curves in the plane. The Annals of Statistics, 24(4):1511 – 1520, 1996

    1996

  24. [32]

    Optimal rates of statistical seriation

    Nicolas Flammarion, Cheng Mao, and Philippe Rigollet. Optimal rates of statistical seriation. Bernoulli, 25(1):623–653, 2019

    2019

  25. [33]

    Spectral ranking using seriation

    Fajwel Fogel, Alexandre d’Aspremont, and Milan V ojnovic. Spectral ranking using seriation. Journal of Machine Learning Research, 17(88):1–45, 2016

    2016

  26. [34]

    The geometry of nonparametric filament estimation

    Christopher R Genovese, Marco Perone-Pacifico, Isabella Verdinelli, and Larry Wasserman. The geometry of nonparametric filament estimation. Journal of the American Statistical Association, 107(498):788–799, 2012

    2012

  27. [35]

    Nonparametric ridge estimation

    Christopher R Genovese, Marco Perone-Pacifico, Isabella Verdinelli, and Larry Wasserman. Nonparametric ridge estimation. The Annals of Statistics, pages 1511–1545, 2014

    2014

  28. [36]

    Regularization-free principal curve estimation

    Samuel Gerber and Ross Whitaker. Regularization-free principal curve estimation. Journal of Machine Learning Research, 14(39):1285–1302, 2013

    2013

  29. [37]

    Flinders petrie, the travelling salesman problem, and the beginning of mathematical modeling in archaeol- ogy

    Thomas L Gertzen and Martin Grötschel. Flinders petrie, the travelling salesman problem, and the beginning of mathematical modeling in archaeol- ogy. PRINCIPAL CURVES IN METRIC SPACES AND W2 SPACE 27 Documenta Mathematica, 2012:199–210, 2012

    2012

  30. [38]

    Distribution-on-distribution regression via optimal transport maps

    Laya Ghodrati and Victor M Panaretos. Distribution-on-distribution regression via optimal transport maps. Biometrika, 109(4):957–974, 2022

    2022

  31. [39]

    Localization in 1d non-parametric latent space models from pairwise affinities

    Christophe Giraud, Yann Issartel, and Nicolas Verzelen. Localization in 1d non-parametric latent space models from pairwise affinities. Electronic Journal of Statistics, 17(1):1587–1662, 2023

    2023

  32. [40]

    Manifold learning in Wasserstein space

    Keaton Hamm, Caroline Moosmüller, Bernhard Schmitzer, and Matthew Thorpe. Manifold learning in Wasserstein space. arXiv preprint arXiv:2311.08549, 2023

    2023 arXiv

  33. [41]

    Principal Curves and Surfaces

    Trevor Hastie. Principal Curves and Surfaces. PhD thesis, Stanford University, 1984

    1984

  34. [42]

    Principal Curves

    Trevor Hastie and Werner Stuetzle. Principal Curves. Journal of the American Statistical Association, 84(406):502–516, 1989. Publisher: [American Statistical Association, Taylor & Francis, Ltd.]

    1989

  35. [43]

    Principal curves on riemannian manifolds

    Søren Hauberg. Principal curves on riemannian manifolds. IEEE transactions on pattern analysis and machine intelligence, 38(9):1915–1921, 2015

    1915

  36. [44]

    Weighted ultrafast diffusion equations: from well-posedness to long-time behaviour

    Mikaela Iacobelli, Francesco S Patacchini, and Filippo Santambrogio. Weighted ultrafast diffusion equations: from well-posedness to long-time behaviour. Archive for Rational Mechanics and Analysis, 232:1165–1206, 2019

    2019

  37. [45]

    Reconstruction of line-embeddings of graphons

    Jeannette Janssen and Aaron Smith. Reconstruction of line-embeddings of graphons. Electronic Journal of Statistics, 16(1):331–407, 2022

    2022

  38. [46]

    The variational formulation of the Fokker–Planck equation

    Richard Jordan, David Kinderlehrer, and Felix Otto. The variational formulation of the Fokker–Planck equation. SIAM Journal on Mathematical Analysis, 29(1):1–17, 1998

    1998

  39. [47]

    Approximation of splines in wasserstein spaces

    Jorge Justiniano, Martin Rumpf, and Matthias Erbar. Approximation of splines in wasserstein spaces. arXiv preprint arXiv:2302.10682, 2023

    2023 arXiv

  40. [48]

    Regression analysis of distributional data through multi-marginal optimal transport

    Amirhossein Karimi and Tryphon T Georgiou. Regression analysis of distributional data through multi-marginal optimal transport. arXiv preprint arXiv:2106.15031, 2021

    2021 arXiv

  41. [49]

    Statistical learning in wasserstein space

    Amirhossein Karimi, Luigia Ripani, and Tryphon T Georgiou. Statistical learning in wasserstein space. IEEE Control Systems Letters, 5(3):899–904, 2020

    2020

  42. [50]

    Classical descriptive set theory, volume 156

    Alexander Kechris. Classical descriptive set theory, volume 156. Springer Science & Business Media, 2012

    2012

  43. [51]

    Learning and design of principal curves

    Balázs Kégl, Adam Krzyzak, Tamás Linder, and Kenneth Zeger. Learning and design of principal curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(3):281–297, 2000

    2000

  44. [52]

    Incidence matrices, interval graphs and seriation in archeology

    David Kendall. Incidence matrices, interval graphs and seriation in archeology. Pacific Journal of mathematics, 28(3):565–570, 1969

    1969

  45. [53]

    A statistical approach to flinders petrie’s sequence-dating

    David G Kendall. A statistical approach to flinders petrie’s sequence-dating. Bulletin of the International Statistical Institute, 40(2):657–681, 1963

    1963

  46. [54]

    Optimal sequencing depth for single-cell rna-sequencing in wasserstein space

    Jakwang Kim, Sharvaj Kubal, and Geoffrey Schiebinger. Optimal sequencing depth for single-cell rna-sequencing in wasserstein space. arXiv preprint arXiv:2409.14326, 2024

    2024

  47. [55]

    Wasserstein barycenters over riemannian manifolds

    Young-Heon Kim and Brendan Pass. Wasserstein barycenters over riemannian manifolds. Advances in Mathematics, 307:640–683, 2017

    2017

  48. [56]

    Multiple penalized principal curves: Analysis and computation

    Slav Kirov and Dejan Slep ˇcev. Multiple penalized principal curves: Analysis and computation. Journal of Mathematical Imaging and Vision, 59:234–256, 2017. 28

    2017

  49. [57]

    Monge-kantorovich fitting with sobolev budgets

    Forest Kobayashi, Jonathan Hayase, and Young-Heon Kim. Monge-kantorovich fitting with sobolev budgets. arXiv preprint arXiv:2409.16541, 2024

    2024 arXiv

  50. [58]

    Elements of the Theory of Functions and Functional Analysis

    Andrey Kolmogorov and Sergey Fomin. Elements of the Theory of Functions and Functional Analysis. Dover, 1999

    1999

  51. [59]

    The seriation problem and the travelling salesman problem

    Gilbert Laporte. The seriation problem and the travelling salesman problem. Journal of Computational and Applied Mathematics, 4(4):259–268, 1978

    1978

  52. [60]

    Toward a mathematical theory of trajectory inference

    Hugo Lavenant, Stephen Zhang, Young-Heon Kim, and Geoffrey Schiebinger. Toward a mathematical theory of trajectory inference. The Annals of Applied Probability, 34(1A):428 – 500, 2024

    2024

  53. [61]

    Reconstructing cell cycle pseudo time-series via single-cell transcriptome data

    Zehua Liu, Huazhe Lou, Kaikun Xie, Hao Wang, Ning Chen, Oscar M Aparicio, Michael Q Zhang, Rui Jiang, and Ting Chen. Reconstructing cell cycle pseudo time-series via single-cell transcriptome data. Nature communications, 8(1):22, 2017

    2017

  54. [62]

    Regularity of densities in relaxed and penalized average distance problem

    Xin Yang Lu. Regularity of densities in relaxed and penalized average distance problem. Networks and Heterogeneous Media, 10(4):837–855, 2015

    2015

  55. [63]

    Average-distance problem for parameterized curves

    Xin Yang Lu and Dejan Slep ˇcev. Average-distance problem for parameterized curves. ESAIM: Control, Optimisation and Calculus of Variations, 22(2):404–416, 2016

    2016

  56. [64]

    Average-distance problem with curvature penalization for data parameterization: regularity of minimizers

    Xin Yang Lu and Dejan Slep ˇcev. Average-distance problem with curvature penalization for data parameterization: regularity of minimizers. ESAIM: Control, Optimisation and Calculus of Variations, 27:8, 2021

    2021

  57. [65]

    Marek, V

    A. Marek, V . Blum, R. Johanni, V . Havu, B. Lang, T. Auckenthaler, A. Heinecke, H.-J. Bungartz, and H. Lederer. The ELPA library: scalable parallel eigenvalue solutions for electronic structure theory and computational science. Journal of Physics: Condensed Matter, 26(21):213...

    2014

  58. [66]

    Massri, Alejandro Berrio, Anton Afanassiev, Laura Greenstreet, Krista Pipho, Maria Byrne, Ge- offrey Schiebinger, David R

    Abdull J. Massri, Alejandro Berrio, Anton Afanassiev, Laura Greenstreet, Krista Pipho, Maria Byrne, Ge- offrey Schiebinger, David R. McClay, and Gregory A. Wray. Single-cell transcriptomics reveals evolutionary reconfiguration of embryonic cell fate specification in the sea ur...

    2024

  59. [67]

    A single-embryo, single-cell time-resolved model for mouse gastrulation

    Markus Mittnenzweig, Yoav Mayshar, Saifeng Cheng, Raz Ben-Yair, Ron Hadas, Yoach Rais, Elad Chom- sky, Netta Reines, Anna Uzonyi, Lior Lumerman, et al. A single-embryo, single-cell time-resolved model for mouse gastrulation. Cell, 184(11):2825–2842, 2021

    2021

  60. [68]

    Consistency of spectral seriation

    Amine Natik and Aaron Smith. Consistency of spectral seriation. arXiv preprint arXiv:2112.04408, 2021

    2021 arXiv

  61. [69]

    On spectral clustering: Analysis and an algorithm

    Andrew Ng, Michael Jordan, and Yair Weiss. On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems, 14, 2001

    2001

  62. [70]

    Locally defined principal curves and surfaces

    Umut Ozertem and Deniz Erdogmus. Locally defined principal curves and surfaces. The Journal of Machine Learning Research, 12:1249–1286, 2011

    2011

  63. [71]

    Computational optimal transport: With applications to data science

    Gabriel Peyré and Marco Cuturi. Computational optimal transport: With applications to data science. Foundations and Trends in Machine Learning, 11(5-6):355–607, 2019

    2019

  64. [72]

    Distribution-free distribution regression

    Barnabas Poczos, Aarti Singh, Alessandro Rinaldo, and Larry Wasserman. Distribution-free distribution regression. In Carlos M. Carvalho and Pradeep Ravikumar, editors, Proceedings of the Sixteenth International Confer- ence on Artificial Intelligence and Statistics, volume 31 ...

    2013

  65. [73]

    The lazy travelling salesman problem in R2

    Paz Polak and Gershon Wolansky. The lazy travelling salesman problem in R2. ESAIM: Control, Optimisation and Calculus of Variations, 13(3):538–552, 2007

    2007

  66. [74]

    Wasserstein k-means for clustering tomographic projections

    Rohan Rao, Amit Moscovich, and Amit Singer. Wasserstein k-means for clustering tomographic projections. In Advances in neural information processing systems, 2020

    2020

  67. [75]

    A method for chronologically ordering archaeological deposits

    William S Robinson. A method for chronologically ordering archaeological deposits. American antiquity, 16(4):293–301, 1951

    1951

  68. [76]

    A comparison of single-cell trajectory inference methods

    Wouter Saelens, Robrecht Cannoodt, Helena Todorov, and Yvan Saeys. A comparison of single-cell trajectory inference methods. Nature biotechnology, 37(5):547–554, 2019

    2019

  69. [77]

    Principal curves with bounded turn

    Sathyakama Sandilya and Sanjeev R Kulkarni. Principal curves with bounded turn. IEEE Transactions on Information Theory, 48(10):2789–2793, 2002

    2002

  70. [78]

    {Euclidean, metric, and Wasserstein} gradient flows: an overview

    Filippo Santambrogio. {Euclidean, metric, and Wasserstein} gradient flows: an overview. Bulletin of Mathematical Sciences, 7:87–154, 2017

    2017

  71. [79]

    Reconstructing developmental landscapes and trajectories from single-cell data

    Geoffrey Schiebinger. Reconstructing developmental landscapes and trajectories from single-cell data. Current Opinion in Systems Biology, 27:100351, 2021

    2021

  72. [80]

    Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogram- ming

    Geoffrey Schiebinger et al. Optimal-transport analysis of single-cell gene expression identifies developmental trajectories in reprogram- ming. Cell, 176(4):928–943, 2019

    2019

  73. [81]

    The geometry of kernelized spectral clustering

    Geoffrey Schiebinger, Martin J Wainwright, and Bin Yu. The geometry of kernelized spectral clustering. The Annals of Statistics, 43(2):819–846, 2015

    2015

  74. [82]

    Principal geodesic analysis for probability measures under the optimal transport metric

    Vivien Seguy and Marco Cuturi. Principal geodesic analysis for probability measures under the optimal transport metric. In Proceedings of the 28th International Conference on Neural Information Processing Systems-Volume 2, pages 3312–3320, 2015

    2015

  75. [83]

    Stochastically transitive models for pairwise comparisons: Statistical and computational issues

    Nihar B Shah, Sivaraman Balakrishnan, Adityanand Guntuboyina, and Martin J Wainwright. Stochastically transitive models for pairwise comparisons: Statistical and computational issues. IEEE Transactions on Information Theory, 63(2):934–959, 2016

    2016

  76. [84]

    Counterexample to regularity in average-distance problem

    Dejan Slep ˇcev. Counterexample to regularity in average-distance problem. Annales de l’IHP Analyse non linéaire, 31(1):169–184, 2014

    2014

  77. [85]

    Regularized principal manifolds

    Alexander J Smola, Sebastian Mika, Bernhard Schölkopf, and Robert C Williamson. Regularized principal manifolds. Journal of machine learning research, 1:179–209, 2001

    2001

  78. [86]

    Principal curves revisited

    Robert Tibshirani. Principal curves revisited. Statistics and computing, 2:183–190, 1992

    1992

  79. [87]

    Sparsity and smoothness via the fused lasso

    Robert Tibshirani, Michael Saunders, Saharon Rosset, Ji Zhu, and Keith Knight. Sparsity and smoothness via the fused lasso. Journal of the Royal Statistical Society Series B: Statistical Methodology, 67(1):91–108, 2005

    2005

  80. [88]

    V . S. Varadarajan. On the convergence of sample probability distributions. Sankhy¯a: The Indian Journal of Statistics (1933-1960), 19(1/2):23–26, 1958

    1933

  81. [89]

    Hybrid wasserstein distance and fast distribution clustering

    Isabella Verdinelli and Larry Wasserman. Hybrid wasserstein distance and fast distribution clustering. Electronic Journal of Statistics, 13:5088–5119, 2019

    2019

  82. [90]

    Optimal transport: old and new, volume 338

    Cédric Villani. Optimal transport: old and new, volume 338. Springer Science & Business Media, 2008

    2008

  83. [91]

    High-dimensional statistics: A non-asymptotic viewpoint, volume 48

    Martin J Wainwright. High-dimensional statistics: A non-asymptotic viewpoint, volume 48. Cambridge university press, 2019. 30

    2019

  84. [92]

    A linear optimal transportation framework for quantifying and visualizing variations in sets of images

    Wei Wang, Dejan Slep ˇcev, Saurav Basu, John A Ozolek, and Gustavo K Rohde. A linear optimal transportation framework for quantifying and visualizing variations in sets of images. International journal of computer vision, 101:254–269, 2013

    2013

  85. [93]

    George Wynne and Andrew B. Duncan. A kernel two-sample test for functional data. Journal of Machine Learning Research, 23(73):1–51, 2022

    2022

  86. [94]

    Exploring the use of spectral seriation to uncover dynamics in embryonic development: a geometric and probabilistic approach

    Roomina Zendehboodi. Exploring the use of spectral seriation to uncover dynamics in embryonic development: a geometric and probabilistic approach. Master’s thesis, University of British Columbia, 2023

    2023

  87. [95]

    Determining sequencing depth in a single-cell rna-seq experiment

    Martin Jinye Zhang, Vasilis Ntranos, and David Tse. Determining sequencing depth in a single-cell rna-seq experiment. Nature communications, 11(1):774, 2020

    2020

  88. [96]

    Wasserstein k-means for clustering probability distributions

    Yubo Zhuang, Xiaohui Chen, and Yun Yang. Wasserstein k-means for clustering probability distributions. In Proceedings of the 36th International Conference on Neural Information Processing Systems , pages 11382–11395, 2022. APPENDIX A: PROPERTIES OF CURVES IN METRIC SPACES In t...

    2022

  89. [97]

    We want to show that g = ˆf up to time-reversal

    Suppose g is injective. We want to show that g = ˆf up to time-reversal. To that end, by Lemma A.6,g−1 is well-defined and continuous. Soh : [0, 1]→ [0, 1] given by h(t) =g−1(f(t)) is a continuous bijection. By Lemma A.8, we thus see Length(g) = Length(g◦h) = Length(f). It rem...

  90. [98]

    We want to show this implies Length(g)> Length(f)

    Suppose that g is not injective and that{g(0),g (1)}̸ ={f(0),f (1)}. We want to show this implies Length(g)> Length(f). To that end: First note that reversing the parametrization off as necessary we may assume infg−1({f(0)})< infg−1({f(1)}). 34 (Note that we cannot always achi...

  91. [99]

    average distance variational problem

    Suppose g is not injective and that {g(0),g (1)} ={f(0),f (1)}. We want to show Length(g)> Length(f). To that end fix t∈ [0, 1] such that g−1({g(t)}) contains mul- tiple values. Let t0 = infg−1({g(t)}) and t1 = supg−1({g(t)}). Notet0̸=t1. Observe that sinceg has constant-speed...

  92. [100]

    In what follows, we write ¯h := maxj∈[1,K]hj

    Note that for each j we allow the choice of a different hj; for example, each hj can be chosen adaptively given the data. In what follows, we write ¯h := maxj∈[1,K]hj. PROPOSITION D.1. LetX be a compact geodesic metric space. Minimizers of the func- tional PPCK w (ΛN) converge...

Pith tools

Reviewed August 15, 2026 · model on record in the stance chip above.