Recursive Binding for Similarity-Preserving Hypervector Representations of Sequences
원문 초록
Hyperdimensional computing (HDC), also known as vector symbolic architectures (VSA), is a computing framework used within artificial intelligence and cognitive computing that operates with distributed vector representations of large fixed dimensionality. A critical step for designing the HDC/VSA solutions is to obtain such representations from the input data. Here, we focus on sequences and propose their transformation to distributed representations that both preserve the similarity of identical sequence elements at nearby positions and are equivariant to the sequence shift. These properties are enabled by forming representations of sequence positions using recursive binding and superposition operations. The proposed transformation was experimentally investigated with symbolic strings used for modeling human perception of word similarity. The obtained results are on a par with more sophisticated approaches from the literature. The proposed transformation was designed for the HDC/VSA model known as Fourier Holographic Reduced Representations. However, it can be adapted to some other HDC/VSA models.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Analyzing Continuous Semantic Shifts with Diachronic Word Similarity Matrices
LGDE: Local Graph-based Dictionary Expansion
A Likelihood Ratio Test of Genetic Relationship among Languages
Are ELECTRA's Sentence Embeddings Beyond Repair? The Case of Semantic Textual Similarity
Visual Grounding Helps Learn Word Meanings in Low-Data Regimes
Improving Heterogeneous Graph Learning with Weighted Mixed-Curvature Product Manifold
토론
이 논문과 연결된 포럼 글이 아직 없습니다.