Fully Dynamic Embedding into ℓp Spaces

Metric embeddings are fundamental in machine learning, enabling similarity search, dimensionality reduction, and representation learning. They underpin modern architectures like transformers and large language models, facilitating scalable training and improved generalization. Theoretically, the classic problem in embedding design is mapping arbitrary metrics into ℓ p spaces while approximately preserving pairwise distances. We study this problem in a fully dynamic setting, where the underlying metric is a graph metric subject to edge insertions and deletions. Our goal is to maintain an efficient embedding after each update. We present the first fully dynamic algorithm for this problem, achieving O(log(n)) 2q O(log(nW )) q-1 expected distortion with O(m 1/q+o(1) ) update time and O(q log(n) log(nW )) query time, where q ≥ 2 is an integer parameter.