arXiv Statistics ML By Mateo D\'iaz, Nicol\'as Garc\'ia Trillos, Daniel L\'opez-Casta\~no, Congwei Yang

Wasserstein approximation of measures via orthogonal frames: statistical and computational complexities

Read the original on arXiv Statistics ML →

arXiv:2610. 36581v1 Announce Type: cross Abstract: Dimension-reduction methods such as PCA identify a subspace capturing most of the variation in the data, but not a distinguished basis within it.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Statistics ML.

Hugging Face Trending Papers
Oct 21

Lifting PCA in the Wasserstein Space

Principal Component Analysis (PCA) is a fundamental tool for statistical dimension reduction, yet no canonical extension to distribution-valued data has emerged within the framework of optimal transpo...

arXiv Machine Learning
Oct 12

Linearized Wasserstein dimensionality reduction with approximation guarantees

The paper introduces LOT Wassmap, an algorithm designed to uncover low‑dimensional structures in the Wasserstein space without computing a full pairwise distance matrix. It leverages approximation schemes such as Sinkhorn distances and linearized optimal transport to accelerate computations, and provides theoretical guarantees on embedding quality even when only finite samples are available. Experiments show that LOT Wassmap achieves accurate embeddings that improve with larger sample sizes while significantly reducing computational cost compared to traditional pairwise‑distance‑based methods.

By Alexander Cloninger, Keaton Hamm, Varun Khurana, Caroline Moosm\"uller
arXiv Machine Learning
Oct 22

Lifting PCA in the Wasserstein Space

The paper introduces Lifted PCA, a canonical extension of Euclidean PCA to the Wasserstein space of probability measures. By lifting variational formulations on the Stiefel and Grassmann manifolds, the authors derive equivalent minimization problems over probability measures that correspond to Wasserstein barycenters with generalized costs. The work establishes dual formulations, optimality conditions, connections to multimarginal optimal transport, statistical consistency, and computational algorithms, and demonstrates practical performance on distributional datasets.

By J\'er\'emie Bigot, Cl\'ement Bonet
arXiv Machine Learning
Jun 30

Learning from samples: inverse problems over measures

arXiv:2505. 07124v3 Announce Type: replace Abstract: We study inverse problems where an unknown potential is observed only through samples from the measure it induces by a convex variational principle.

By Francisco Andrade, Gabriel Peyr\'e, Clarice Poon