Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces

Abstract: We study online embeddings of metric spaces into Euclidean spaces of a constant dimension $d&gt;1$, against an adaptive adversary. While the case of $d=1$ is well understood, for higher dimensions little is known. In particular, even for $d=2$ it remains unknown whether the worst-case distortion grows exponentially with the number of exposed points, as it does in the case for the line, or whether it is polynomial, as in the case for unbounded $d$. Our first result is about fixed {\em solid} graphs, i.e., $K_5$, whose edges are solid intervals, equipped with the shortest-path metric. We show that if the input points arrive from such a metric space, they can indeed be online-embedded into ${\mathbb R}<sup>2$ with a polynomial distortion. This refutes the previously believed conjecture that the topological non-embeddability of $K_5$ into the plane could be exploited for establishing exponential lower bounds. The second results is about online embeddings of tree metrics of a certain type, including, e.g., ultrametrics and HST's. Somewhat surprisingly, we show that for metrics from this class the worst-case online embedding into ${\mathbb R}<sup>d$ is not much worse that the offline embedding, both being $n<sup>{Θ(1/d)}$, and this holds even when $d = Θ(\log n)$. This is in a stark contrast to the more common situation where the online-offline gap is typically huge, and even exponential. This result allows us to transfer results about probabilistic embeddings of metrics into HST's to low-dimensional Euclidean spaces, in an almost optimal possible manner.

• The paper presents a deterministic online algorithm for embedding arbitrary metric spaces into fixed low-dimensional Euclidean spaces with polynomial distortion bounds.
• It employs innovative techniques such as the 2-path game and recursive decomposition to handle adversarial input sequences and non-planar graph metrics.
• The study achieves significantly improved distortion bounds for solid graphs, ultrametrics, and α-trees, challenging previous exponential distortion conjectures.

Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces

Introduction

The paper "Deterministic Online Embedding of Metric Spaces into Low Dimensional Spaces" (2607.10624) addresses the fundamental question of how to embed arbitrary metric spaces into low-dimensional Euclidean spaces in an online, deterministic fashion, where an adversarial input sequence of points must be embedded as they appear, and the adversary can adapt based on prior embeddings. This expands the theory of metric embeddings, moving beyond classic offline results (e.g., Johnson-Lindenstrauss, Bourgain) and probabilistic online settings, by directly confronting worst-case, deterministic adaptive online protocols for Euclidean embeddings with constant dimension $d$.

Problem Setting and Significance

The main challenge analyzed is the evolution of distortion in deterministic online embeddings for Euclidean spaces of constant dimension, in particular whether exponential distortion is necessary for $d=2$ (the plane), as is known for the line ($d=1$), or whether polynomial bounds suffice. Distortion is defined as the product of the maximum expansion and contraction over all pairs of embedded points. The paper also considers online deterministic embeddings of tree metrics (ultrametrics, HSTs, and generalizations like $\alpha$-trees) and analyzes the gap between the online and offline settings, which is typically large, but is shown to be remarkably small here for certain classes.

Main Results: The 2-Path Game

A central technical device is the "2-path game," where two unit-length paths (horizontal and vertical) are to be embedded into a square, with their endpoints fixed on orthogonal sides. For offline embedding of $q$ points, distortion $O(q)$ is tight, but the paper shows that for the online deterministic setting, polynomial distortion $O(q^2)$ is achievable if $q$ is known in advance, and $O(q^2\log^{2+\epsilon}q)$ for unknown $q$. This substantially refutes prior conjectures that the non-planarity of solid $d=2$0 submetrics would force exponential distortion for deterministic online planar embeddings.

Figure 1: The horizontal (blue) and vertical (red) paths with fixed endpoints embedded in the square; endpoints constrain the allowed embeddings and complicate online placement.

Online Embedding of Solid Graph Metrics

Building upon the 2-path game, the authors develop deterministic online embedding algorithms for solid graph metrics—metrics arising from shortest paths in a fixed, edge-labeled graph. The embedding strategy involves:

• Preprocessing: Embed all "non-intersection" points in advance.
• Online phase: For each exposed point (potentially in a 1-intersection region), use the 2-path game algorithm or its $d=2$1-path generalization to embed the point, ensuring non-crossing and separation.

For solid $d=2$2, which is not planar and difficult to embed even offline, the paper achieves an online embedding of $d=2$3 points with distortion $d=2$4, polynomial in the number of exposed points, with a similar approach generalizable to other graphs and weighted cases.

Figure 2: Embedding of metric in solid $d=2$5, with the blue 1-intersection territory handling edge crossings using the 2-paths game algorithm; all other points mapped linearly along edges.

Embedding Tree Metrics: Ultrametrics and $d=2$6-Trees

The paper next addresses deterministic online embeddings for ultrametrics and $d=2$7-trees—a generalization of HSTs. For ultrametrics, the embedding can be performed online into $d=2$8 with distortion $d=2$9, closely matching optimal offline bounds, assuming $d=1$0 is known. For $d=1$1, constant distortion is achievable; for the line and plane, $d=1$2 and $d=1$3 distortion, respectively.

For $d=1$4-trees, the embedding into $d=1$5 achieves distortion $d=1$6, again nearly matching offline performance. The procedures necessitate initial exposure of the root and exploit the recursive clustered structure of the metrics, ensuring that subtree embeddings remain tightly controlled.

Figure 3: Paths with endpoints embedded in the grid, illustrating recursive handling of tree submetrics and activation of intervals for embedding.

Figure 4: Activation of segments in response to online queries—embedding decisions for intervals adaptively activate next regions.

Technical Approaches

The paper's algorithms hinge on designing online protocols that:

• Maintain an invariant (e.g., only one active interval exists per color at any time in the 2-path game).
• Allocate geometric regions (rectangular or grid-aligned) to embed each metric segment or cluster, with careful handling of intersection points via specialized gadgets.
• Use recursive decomposition (e.g., conductance-based or low-diameter decomposition for graphs) to assign embedding regions, achieving improved distortion bounds.
• Employ shifted grid or spherical code embeddings for ultrametrics and recursively clustered metrics, balancing expansion and contraction.
• Exploit properties of tree metrics (natural order exposure) to control distortion in $d=1$7-tree embeddings, even for adversarial exposure sequences.

These techniques are combined to systematically resolve traditional topological obstructions (e.g., graph non-planarity), defy prior expectations of exponential distortion, and propagate near-optimal embedding guarantees to more general metric classes.

Numerical Results and Contradictory Claims

The paper boldly contradicts previous beliefs by demonstrating that the deterministic online embedding of solid $d=1$8 (and general solid non-planar graphs) into $d=1$9 can be achieved with polynomial, not exponential, distortion. For tree metrics and ultrametrics, the deterministic online distortion closely matches the best possible offline distortion up to polynomial factors in $\alpha$0 and $\alpha$1, while for general metrics, exponential distortion is unavoidable in $\alpha$2. The theoretical framework and detailed algorithms specify the distortion bounds for various classes:

Metric Class	Offline Distortion	Online Deterministic Distortion
Solid $\alpha$3 (planar)	$\alpha$4	$\alpha$5
Ultrametrics	$\alpha$6	$\alpha$7
$\alpha$8-trees	$\alpha$9	$q$0
General Metrics ($q$1)	$q$2	$q$3

Implications and Future Directions

This work uncovers unexpected structure in online deterministic embeddings, showing that polynomial distortion suffices for broad metric classes, even in low-dimensional Euclidean spaces. The results facilitate effective applications in real-time data processing scenarios requiring dynamic geometric embeddings, such as online clustering, nearest neighbor queries, and principled dimensionality reduction in streaming environments.

The elimination of exponential lower bounds for graphs and trees opens the door to further theoretical developments. Potential future work includes:

• Characterizing the precise online/offline distortion gap for additional metric classes.
• Extending deterministic protocols to more general adversarial input models.
• Developing practical algorithms based on these theoretical insights for high-dimensional geometric data.
• Further analysis of embeddings into structured spaces such as Banach spaces or complex networks.

Conclusion

The paper makes authoritative contributions to the theory of deterministic online embeddings in low-dimensional Euclidean spaces. By harnessing combinatorial, geometric, and metric decomposition techniques, it achieves polynomial distortion bounds for solid graphs and tree metrics, overturning prior conjectures and providing nearly optimal algorithms for several important metric classes. These findings enrich both the practical and theoretical landscape of geometric data analysis and real-time streaming algorithms, and lay a foundation for further breakthroughs in online metric embedding theory.