paper-with-me

Papers

Sign Stable Projections, Sign Cauchy Projections and Chi-Square Kernels

2013-08-05 · Ping Li, Gennady Samorodnitsky, John Hopcroft

The method of stable random projections is popular for efficiently computing the Lp distances in high dimension (where 0<p<=2), using small space. Because it adopts nonadaptive linear projections, this method is naturally suitable when the data are collected in a dynamic streaming fashion (i.e., turnstile data streams). In this paper, we propose to use only the signs of the projected data and analyze the probability of collision (i.e., when the two signs differ). We derive a bound of the collision probability which is exact when p=2 and becomes less sharp when p moves away from 2. Interestingly, when p=1 (i.e., Cauchy random projections), we show that the probability of collision can be accurately approximated as functions of the chi-square similarity. For example, when the (un-normalized) data are binary, the maximum approximation error of the collision probability is smaller than 0.0192. In text and vision applications, the chi-square similarity is a popular measure for nonnegative data when the features are generated from histograms. Our experiments confirm that the proposed method is promising for large-scale learning applications.

📄 PDF Abstract BibTeX arXiv:1308.1009

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sign Cauchy Projections and Chi-Square Kernel

2013-12-01 · NeurIPS 2013 12 · Ping Li, Gennady Samorodnitsk, John Hopcroft

The method of Cauchy random projections is popular for computing the $l_1$ distance in high dimension. In this paper, we propose to use only the signs of the projected data and show that the probability of collision (i…

Sign Stable Random Projections for Large-Scale Learning

2015-04-27 · Ping Li

We study the use of "sign $\alpha$-stable random projections" (where $0<\alpha\leq 2$) for building basic data processing tools in the context of large-scale machine learning applications (e.g., classification, regressio…

ARCClusteringGeneral Classification

Deep Learning Multidimensional Projections

2019-02-21 · Mateus Espadoto, Nina S. T. Hirata, Alexandru C. Telea

Dimensionality reduction methods, also known as projections, are frequently used for exploring multidimensional data in machine learning, data science, and information visualization. Among these, t-SNE and its variants h…

BIG-bench Machine LearningDeep LearningDimensionality Reduction

Practice with Graph-based ANN Algorithms on Sparse Data: Chi-square Two-tower model, HNSW, Sign Cauchy Projections

2023-06-13 · Ping Li, Weijie Zhao, Chao Wang, Qi Xia 외

Sparse data are common. The traditional ``handcrafted'' features are often sparse. Embedding vectors from trained models can also be very sparse, for example, embeddings trained via the ``ReLu'' activation function. In t…

GPU

Local Neighborhood Instability in Parametric Projections: Quantitative and Visual Analysis

2026-04-23 · Frederik L. Dennig, Daniel A. Keim arxiv

Parametric projections let analysts embed new points in real time, but input variations from measurement noise or data drift can produce unpredictable shifts in the 2D layout. Whether and where a projection is locally st…