Skip to content

Real-Valued Hyperdimensional Sequence Representations with Hadamard Product Binding and Shift Equivariance

Aug 2026 · 0 citations · 28 references
Computer Science

TL;DR

Three real-valued position-encoding variants are proposed: a real-valued baseline based on the inverse Fourier transform, a real-valued baseline based on the inverse Fourier transform, and Sinusoid and Cosine-only representations derived from Random Fourier Features.

Abstract

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.

View source

Similar papers

Book Open access Aug 2026

Vector-Space Projection and Unified Complex-Valued Acceleration for Scaling Matrix-Based Brain-Inspired Representations

This work proposes a flattening methodology that preserves GHRR's matrix-based encoding while executing training and inference directly in vector space, functionally equivalent to FHRR inference yet free of permutation logic.

William Youngwoo Chung, Hyunwoo Oh, Calvin Yeung et al. · 0 citations
#natural language process... Preprint Aug 2026

All You Need Is Non-Commutative Words

It is shown that the noncommutativity of matrix product captures word order without positional encodings (PEs) and yields several capabilities, including antisymmetric self-attention with no query, key, or value projections, and parallel composition of variable-length text chunks at a reduced attention cost.

Carla Quispe Flores, Stanley Salvatierra, Renan Cabrera · 0 citations
Preprint Aug 2026

Iterative Erasure Count Is Not an Affine-Invariant Concept Dimension

How many directions does a neural representation use to encode a concept? A common answer repeatedly erases probe directions and reports the stopping count or cumulative removed rank. We show that both quantities can change under an information-preserving invertible reparameterization, so neither is intrinsically a con...

Tingan Jin, Shu-Hang Dong, Hao-Song Li et al. · 1 citation
Preprint Aug 2026

Representation Measurements Under Function-Preserving Reparameterizations

This study shows that column-permutation parallel analysis violates function-preserving reparameterization invariance because its reference distribution and selected component count can change while the model function and observed covariance spectrum remain fixed.

Abdullah Karasan · 0 citations
Preprint Aug 2026

Residual Algebra for Representation-Preserving Learning

R residual algebra is proposed, in which each representation retains its coordinate system and owns its unresolved residual until an explicit aggregation boundary until an explicit aggregation boundary, with population variance reduction and first-order coupled-path mean orthogonality.

Yao Wu · 0 citations
Preprint Sep 2026

Exact Factorisation and Fast Computation of Invertible Constant-Q Transforms

The proposed implementation of Flash-CQT reduces analysis-synthesis round-trip time by factors of two to eight relative to a baseline computing the same CQT, and uses over 30% less peak temporary workspace and reaches a negligible reconstruction error.

Facundo Franchino, Eloi Moliner, V. Välimäki · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.