High-Dimensional Vector Semantics
classification
💻 cs.CL
cs.AIcs.LGstat.ML
keywords
vectorhigh-dimensionalproblempropertyrandomsemanticsvectorsadding
read the original abstract
In this paper we explore the "vector semantics" problem from the perspective of "almost orthogonal" property of high-dimensional random vectors. We show that this intriguing property can be used to "memorize" random vectors by simply adding them, and we provide an efficient probabilistic solution to the set membership problem. Also, we discuss several applications to word context vector embeddings, document sentences similarity, and spam filtering.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.