The weighted Euclidean distance between two vectors is a Euclidean distance where the contribution of each dimension is scaled by a given non-negative weight. The Johnson-Lindenstrauss (JL) lemma can be easily adapted to the weighted Euclidean distance if weights are known at construction time. Given a set of $n$ vectors with dimension $d$, it suffices to scale each dimension of the input vectors according to the weights, and then apply any standard JL reduction: the weighted Euclidean distance between pairs of vectors is preserved within a multiplicative factor $\epsilon$ with high probability. However, this is not the case when weights are provided after the dimensionality reduction. In this paper, we show that by applying a linear map from real vectors to a complex vector space, it is possible to update the compressed vectors so that the weighted Euclidean distances between pairs of points can be computed within a multiplicative factor $\epsilon$, even when weights are provided after the dimensionality reduction. Finally, we consider the estimation of weighted Euclidean norms in streaming settings: we show how to estimate the weighted norm when the weights are provided either after or concurrently with the input vector.
翻译:两个矢量之间加权的 ELIDE 距离为 Euclidean 距离,其中每个维度的贡献由给定的非负负重量缩放。 约翰逊- 林登斯特劳斯(JL) 列马( 焦耳马) 如果在施工时重量已知, 可以很容易地适应加权的 Euclidean 距离。 如果在施工时重量为已知的重量, 一套带有维度的 美元矢量, 它就足以根据重量来缩放输入矢量的每个维度, 然后应用任何标准的 JL 缩放: 两对矢量之间加权的Euclidean 距离保留在一个多复制因子中 $\ epslonus (美元, 概率高 ) 。 然而, 当量减少后提供重量时, John- Lindelonus (JL) lemmes, lempt the graduality expression of the sqir expressional include the exprincipal exismations, 我们就可以更新压缩矢量的计算。 最后, 我们考虑, expal eximing the export of the exprincental export.