Dimensionality reduction on complex vector spaces for dynamic weighted Euclidean distance

by   Paolo Pellizzoni, et al.

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 ϵ 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 ϵ, 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.


Dimensionality Reduction for k-Distance Applied to Persistent Homology

Given a set P of n points and a constant k, we are interested in computi...

Fiberwise dimensionality reduction of topologically complex data with vector bundles

Datasets with non-trivial large scale topology can be hard to embed in l...

Exponentially Improved Dimensionality Reduction for ℓ_1: Subspace Embeddings and Independence Testing

Despite many applications, dimensionality reduction in the ℓ_1-norm is m...

Optimal (Euclidean) Metric Compression

We study the problem of representing all distances between n points in ℝ...

Dimensionality Reduction for Persistent Homology with Gaussian Kernels

Computing persistent homology using Gaussian kernels is useful in the do...

Comments on "On Approximating Euclidean Metrics by Weighted t-Cost Distances in Arbitrary Dimension"

Mukherjee (Pattern Recognition Letters, vol. 32, pp. 824-831, 2011) rece...

Integrated Random Projection and Dimensionality Reduction by Propagating Light in Photonic Lattices

It is proposed that the propagation of light in disordered photonic latt...

Please sign up or login with your details

Forgot password? Click here to reset