The weighted pnorm of a vector can easily be computed when the weights are known in advance: it sufficies to scale the contribution of each component by the correspondent weight. However, such computation becomes challenging when, due to space or privacy constraints, only a compressed version of the vector is made available. This work is meant to elaborate on the paper "Dimensionality reduction on complex vector spaces for Euclidean distance with dynamic weights" by Pellizzoni, Moretti and Silvestri, which presents a dimensionality reduction technique inspired by the JohnsonLindenstrauss Lemma to smartly compress very large vectors, while still enabling the computation of the weighted Euclidean norm. Here, an extension to compute an estimate of the generic weighted pnorms is introduced, as well as an experimental evaluation of strategies to reduce the variance of such estimators.
The weighted pnorm of a vector can easily be computed when the weights are known in advance: it sufficies to scale the contribution of each component by the correspondent weight. However, such computation becomes challenging when, due to space or privacy constraints, only a compressed version of the vector is made available. This work is meant to elaborate on the paper "Dimensionality reduction on complex vector spaces for Euclidean distance with dynamic weights" by Pellizzoni, Moretti and Silvestri, which presents a dimensionality reduction technique inspired by the JohnsonLindenstrauss Lemma to smartly compress very large vectors, while still enabling the computation of the weighted Euclidean norm. Here, an extension to compute an estimate of the generic weighted pnorms is introduced, as well as an experimental evaluation of strategies to reduce the variance of such estimators.
Complex Dimensionality Reduction for the Estimation of DynamicallyWeighted Norms
TOGNON, MARIAFIORE
2023/2024
Abstract
The weighted pnorm of a vector can easily be computed when the weights are known in advance: it sufficies to scale the contribution of each component by the correspondent weight. However, such computation becomes challenging when, due to space or privacy constraints, only a compressed version of the vector is made available. This work is meant to elaborate on the paper "Dimensionality reduction on complex vector spaces for Euclidean distance with dynamic weights" by Pellizzoni, Moretti and Silvestri, which presents a dimensionality reduction technique inspired by the JohnsonLindenstrauss Lemma to smartly compress very large vectors, while still enabling the computation of the weighted Euclidean norm. Here, an extension to compute an estimate of the generic weighted pnorms is introduced, as well as an experimental evaluation of strategies to reduce the variance of such estimators.File  Dimensione  Formato  

Tognon_Mariafiore.pdf
embargo fino al 03/07/2027
Dimensione
1.22 MB
Formato
Adobe PDF

1.22 MB  Adobe PDF 
The text of this website © Università degli studi di Padova. Full Text are published under a nonexclusive license. Metadata are under a CC0 License
https://hdl.handle.net/20.500.12608/65951