A dual basis approach to multidimensional scaling
Not on the map. Why?
Abstract (arXiv)
Classical multidimensional scaling (CMDS) is a technique that embeds a set of objects in a Euclidean space given their pairwise Euclidean distances. The main part of CMDS involves double centering a squared distance matrix and using a truncated eigendecomposition to recover the point coordinates. In this paper, motivated by a study in Euclidean distance geometry, we explore a dual basis approach to CMDS. We give an explicit formula for the dual basis vectors and fully characterize the spectrum of an essential matrix in the dual basis framework. We make connections to a related problem in metric nearness.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 1 of its 20 references that are in the map. First posted on arXiv 10 Mar 2023.
Builds on
1 of 20 references.
References · 1
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 2.
5 papers.
- 2023Localization from structured distance matrices via low-rank matrix recoverycited by 4
- 2024Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guaranteescited by 4
- 2024Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimizationcited by 3
- 2025Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descentcited by 1
- 2025Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustnesscited by 0
- 2025Provable Non-Convex Euclidean Distance Matrix Completion: Geometry, Reconstruction, and Robustness31 Jul 2025
- 2025Euclidean Distance Matrix Completion via Asymmetric Projected Gradient Descent28 Apr 2025
- 2024Sample-Efficient Geometry Reconstruction from Euclidean Distances using Non-Convex Optimization22 Oct 2024
- 2024Riemannian Optimization for Non-convex Euclidean Distance Geometry with Global Recovery Guarantees8 Oct 2024
- 2023Localization from structured distance matrices via low-rank matrix recovery29 Nov 2023