平移下地球移动距离的细粒度复杂度
Fine-Grained Complexity of Earth Mover's Distance under Translation
AI总结:
针对平移下的地球移动距离(EMDuT),提出ℝ¹中Õ(n²)时间近最优算法(基于正交向量假设下界)及ℝᵈ中L₁/L∞度量下Õ(n²ᵈ⁺²)时间算法(基于指数时间假设证明d依赖性紧),解决了此前仅存在近似算法的问题。
摘要:
地球移动距离是计算机科学多个分支中广泛使用的相似性度量,用于衡量两点集间完美匹配的最小总边长。平移下的地球移动距离(EMDuT)是其平移不变版本,需在一个点集的所有平移中最小化地球移动距离。针对ℝ¹中的EMDuT,我们提出了一个时间复杂度为Õ(n²)的算法,并基于正交向量假设给出匹配的条件下界,证明该算法接近最优。针对ℝᵈ中L₁和L∞度量下的EMDuT,我们提出Õ(n²ᵈ⁺²)时间算法,并基于指数时间假设证明该d依赖性渐近紧。此前这些问题仅存在近似算法。
英文摘要:
The Earth Mover's Distance is a popular similarity measure in several branches of computer science. It measures the minimum total edge length of a perfect matching between two point sets. The Earth Mover's Distance under Translation ($\mathrm{EMDuT}$) is a translation-invariant version thereof. It minimizes the Earth Mover's Distance over all translations of one point set. For $\mathrm{EMDuT}$ in $\mathbb{R}^1$, we present an $\tilde{\mathcal{O}}(n^2)$-time algorithm. We also show that this algorithm is nearly optimal by presenting a matching conditional lower bound based on the Orthogonal Vectors Hypothesis. For $\mathrm{EMDuT}$ in $\mathbb{R}^d$, we present an $\tilde{\mathcal{O}}(n^{2d+2})$-time algorithm for the $L_1$ and $L_\infty$ metric. We show that this dependence on $d$ is asymptotically tight, as an $n^{o(d)}$-time algorithm for $L_1$ or $L_\infty$ would contradict the Exponential Time Hypothesis (ETH). Prior to our work, only approximation algorithms were known for these problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。