mlsanityData to 7 Oct 2026

On the Selection of Tuning Parameters for Patch-Stitching Embedding Methods

arXiv 2207.07218 ↗First posted 14 Jul 2022stat.ME math.MG math.STcited by 0

Not on the map. Why?

Abstract (arXiv)

While classical scaling, just like principal component analysis, is parameter-free, other methods for embedding multivariate data require the selection of one or several tuning parameters. This tuning can be difficult due to the unsupervised nature of the situation. We propose a simple, almost obvious, approach to supervise the choice of tuning parameter(s): minimize a notion of stress. We apply this approach to the selection of the patch size in a prototypical patch-stitching embedding method, both in the multidimensional scaling (aka network localization) setting and in the dimensionality reduction (aka manifold learning) setting. In our study, we uncover a new bias--variance tradeoff phenomenon.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 5 of its 85 references that are in the map. First posted on arXiv 14 Jul 2022.

Builds on

5 of 85 references.

References · 5

  1. 2018UMAP: Uniform Manifold Approximation and Projection for Dimension Reductioncited by 2,841
  2. 2020Attraction-Repulsion Spectrum in Neighbor Embeddingscited by 41
  3. 2021On UMAP's true loss functioncited by 32
  4. 2018Intrinsic Isometric Manifold Learning with Application to Localizationcited by 11
  5. 2017Unconstrained and Curvature-Constrained Shortest-Path Distances and their Approximationcited by 4

Built on by

Not cited yet.