AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

Dimensionality Reduction has Quantifiable Imperfections: Two Geometric Bounds

Kry Lui, Gavin Weiguang Ding, Ruitong Huang, Robert McCann

NeurIPS 2018 · Learning theory and algorithms › Optimal transport · approach: Wasserstein barycenters and GW · 6 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Reduce intrinsic dimension from n to m < n with a continuous mapDimensionality reduction maps · Information retrieval on an n-dimensional manifoldprecision and recallMixed
Use a continuous dimensionality-reduction mapDimensionality reduction maps · Information retrievalprecisionHurt
Apply a Lipschitz continuous dimensionality-reduction mapDimensionality reduction maps · Worst-case retrieval neighborhoodprecision: D(n, m)\,\left(\frac{r_U}{R}\right)^{n-m}\,\frac{ r_U^{^{m}} }{p^{m}(r_V/L)}Hurt
Use the Wasserstein lower bound to select the retrieval radiusDimensionality reduction retrieval · Synthetic samples in a 10-dimensional unit ballf-score (β=0.3)Improved
Measure retrieval mismatch with L2-Wasserstein distance rather than volume-only precision and recallDimensionality reduction retrieval · Information retrievaldistance distortionImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy