arXiv (All)
open access
Linearized Wasserstein dimensionality reduction with approximation guarantees
We introduce LOT Wassmap, a computationally feasible algorithm to uncover low-dimensional structures in the Wasserstein space. The algorithm is motivated by the observation that many datasets are naturally interpreted as probability measures rather than points in $\mathbb{R}^n$, and that finding low
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Gromov-Wasserstein Quantization and Clustering: Structure, Rates, and Algorithms#444632
- Low-Dimensional Embeddings for Gaussian Kernels on Manifolds#1109229
- Out-of-Distribution Generalization of In-Context Learning: A Low-Dimensional Subspace Perspective#179165
- Selective Inference for Deep Clustering in Latent Spaces#1076412
- Dense uniqueness and dense nonuniqueness of Fréchet means#1249226
Record · ID 1296324
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive