paper

Additive Approximation Schemes for Low-Dimensional Embeddings

arXiv:2509.09652

Abstract

We consider the task of fitting low-dimensional embeddings to high-dimensional data. In particular, we study the -Euclidean Metric Violation problem ($\textsf{$k$-EMV}$), where the input is and the goal is to find the closest vector , where is the set of all -dimensional Euclidean metrics on points, and closeness is formulated as the following optimization problem, where is the entry-wise norm: \[ \textsf{OPT}_{\textrm{EMV}} = \min_{X \in \mathbb{M}_{k} } \Vert D - X \Vert_2^2\,.\] Cayton and Dasgupta [CD'06] showed that this problem is NP-Hard, even when . Dhamdhere [Dha'04] obtained a -approximation for $\textsf{$1$-EMV}$ and leaves finding a PTAS for it as an open question (reiterated recently by Lee [Lee'25]). Although $\textsf{$k$-EMV}$ has been studied in the statistics community for over 70 years, under the name "multi-dimensional scaling", there are no known efficient approximation algorithms for , to the best of our knowledge. We provide the first polynomial-time additive approximation scheme for $\textsf{$k$-EMV}$. In particular, we obtain an embedding with objective value in time, where each entry in can be represented by bits. We believe our algorithm is a crucial first step towards obtaining a PTAS for $\textsf{$k$-EMV}$. Our key technical contribution is a new analysis of correlation rounding for Sherali-Adams / Sum-of-Squares relaxations, tailored to low-dimensional embeddings. We also show that our techniques allow us to obtain additive approximation schemes for two related problems: a weighted variant of $\textsf{$k$-EMV}$ and low-rank approximation for .

57 pages

Additive Approximation Schemes for Low-Dimensional Embeddings · wovepaper