Very Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections

Simple item page
dc.creatorLi, Ping
dc.date2006-11-22
dc.date2006-12-01
dc.date.accessioned2026-07-07T08:16:50Z
dc.date.available2026-07-07T08:16:50Z
dc.descriptionThis paper will focus on three different aspects in improving the current practice of stable random projections. Firstly, we propose {\em very sparse stable random projections} to significantly reduce the processing and storage cost, by replacing the $α$-stable distribution with a mixture of a symmetric $α$-Pareto distribution (with probability $β$, $0<β\leq1$) and a point mass at the origin (with a probability $1-β$). This leads to a significant $\frac{1}β$-fold speedup for small $β$. Secondly, we provide an improved estimator for recovering the original $l_α$ norms from the projected data. The standard estimator is based on the (absolute) sample median, while we suggest using the geometric mean. The geometric mean estimator we propose is strictly unbiased and is easier to study. Moreover, the geometric mean estimator is more accurate, especially non-asymptotically. Thirdly, we provide an adequate answer to the basic question of how many projections (samples) are needed for achieving some pre-specified level of accuracy. \cite{Proc:Indyk_FOCS00,Article:Indyk_TKDE03} did not provide a criterion that can be used in practice. The geometric mean estimator we propose allows us to derive sharp tail bounds which can be expressed in exponential forms with constants explicitly given.
dc.identifierhttps://arxiv.org/abs/cs/0611114
dc.identifierhttp://arxiv.org/abs/cs/0611114
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133921
dc.subjectData Structures and Algorithms
dc.subjectInformation Theory
dc.subjectMachine Learning
dc.titleVery Sparse Stable Random Projections, Estimators and Tail Bounds for Stable Random Projections
dc.typetext

Files

Collections

arXiv