Sign Stable Random Projections for Large-Scale Learning
Ping Li

TL;DR
This paper investigates sign alpha-stable random projections as a scalable method for approximating nonlinear kernels in large-scale machine learning, providing empirical evidence of their effectiveness across various datasets.
Contribution
It offers an extensive empirical evaluation of sign alpha-stable random projections for different alpha values, comparing them with existing methods like CWS.
Findings
Effective approximation of nonlinear kernels at scale
Comparable or superior performance to existing methods
Versatility across classification datasets
Abstract
We study the use of "sign -stable random projections" (where ) for building basic data processing tools in the context of large-scale machine learning applications (e.g., classification, regression, clustering, and near-neighbor search). After the processing by sign stable random projections, the inner products of the processed data approximate various types of nonlinear kernels depending on the value of . Thus, this approach provides an effective strategy for approximating nonlinear learning algorithms essentially at the cost of linear learning. When , it is known that the corresponding nonlinear kernel is the arc-cosine kernel. When , the procedure approximates the arc-cos- kernel (under certain condition). When , it corresponds to the resemblance kernel. From practitioners' perspective, the method of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Sparse and Compressive Sensing Techniques · Topological and Geometric Data Analysis
