Real-Valued Hyperdimensional Sequence Representations with Hadamard Product Binding and Shift Equivariance
Not on the map. Why?
Abstract (arXiv)
Encoding temporal order is a fundamental requirement for sequence representations in Hyperdimensional Computing. Fractional Power Encoding provides similarity-preserving position vectors whose inner products approximate shift-invariant kernels, and it supports shift-equivariant transformations of encoded sequence representations. However, standard formulations of Fractional Power Encoding are primarily designed for binding operations such as circular convolution or complex-valued multiplication, which limits their compatibility with Hadamard product binding of real-valued vectors. This paper develops real-valued position encodings motivated by Random Fourier Features, aiming to retain the desirable properties of Fractional Power Encoding while supporting Hadamard-based operations. We propose three real-valued position-encoding variants: a real-valued baseline based on the inverse Fourier transform, and Sinusoid and Cosine-only representations derived from Random Fourier Features. Among them, the Sinusoid variant provides an explicit algebraic shift operator, allowing temporal shifts to be applied directly to the vector-encoded sequence representation without re-encoding the shifted sequence. Experiments on time-series classification datasets show that the proposed real-valued representations achieve performance comparable to standard Fractional Power Encoding while enabling computationally efficient Hadamard product binding. The Sinusoid variant offers the most favorable trade-off, combining efficient real-valued implementation with exact shift-equivariant transformations.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 28 references that are in the map. First posted on arXiv 28 Aug 2026.
Builds on
14 of 28 references.
References · 14
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2018The UCR Time Series Archivecited by 421
- 2020MINIROCKET: A Very Fast (Almost) Deterministic Transform for Time Series Classificationcited by 186
- 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part I: Models and Data Transformationscited by 98
- 2021MultiRocket: Multiple pooling operators and transformations for fast and effective time series classificationcited by 89
- 2021A Survey on Hyperdimensional Computing aka Vector Symbolic Architectures, Part II: Applications, Cognitive Models, and Challengescited by 68
- 2022HYDRA: Competing convolutional kernels for fast and accurate time series classificationcited by 53
- 2021Computing on Functions Using Randomized Vector Representationscited by 41
- 2020Variable Binding for Sparse Distributed Representations: Theory and Applicationscited by 27
- 2022HDC-MiniROCKET: Explicit Time Encoding in Time Series Classification with Hyperdimensional Computingcited by 13
- 2023Computing with Residue Numbers in High-Dimensional Representationcited by 7
- 2021Shift-Equivariant Similarity-Preserving Hypervector Representations of Sequencescited by 4
Built on by
Not cited yet.