stat.MLMar 12, 2026

Hypercomplex Widely Linear Processing: Fundamentals for Quaternion Machine Learning

Authors: Sayed Pouria Talebi, Clive Cheong Took

Organizations: Computer Science Department, University of Roehampton, London WC2R-2LS, U.K. · Electronic Engineering Department, Royal Holloway University of London, TW20 0EX, U.K.

Abstract

Numerous attempts have been made to replicate the success of complex-valued algebra in engineering and science to other hypercomplex domains such as quaternions, tessarines, biquaternions, and octonions. Perhaps, none have matched the success of quaternions. The most useful feature of quaternions lies in their ability to model three-dimensional rotations which, in turn, have found various industrial applications such as in aeronautics and computergraphics. Recently, we have witnessed a renaissance of quaternions due to the rise of machine learning. To equip the reader to contribute to this emerging research area, this chapter lays down the foundation for: - augmented statistics for modelling quaternion-valued random processes, - widely linear models to exploit such advanced statistics, - quaternion calculus and algebra for algorithmic derivations, - mean square estimation for practical considerations. For ease of exposure, several examples are offered to facilitate the learning, understanding, and(hopefully) the adoption of this multidimensional domain.

Figures & tables

Explore similar work

Aug 7, 2026

Classical SU(2)\mathrm{SU}(2) Models Match or Exceed Shallow Variational Quantum Circuits on Vision Benchmarks

Quaternion-valued neural networks and variational quantum circuits (VQCs) both derive local transformations from SU(2)\mathrm{SU}(2) geometry, yet their performance on classical supervised learning remains poorly understood. We compare real-valued, quaternion-valued, and quantum classification heads on identical frozen features across MNIST, FashionMNIST, and CIFAR-10. CIFAR-10 uses a learned 16-dimensional bottleneck and frozen ImageNet-pretrained ResNet18 features to separate architecture from representation quality. Quaternion classifiers match or approach real-valued baselines while outperforming shallow VQCs. On MNIST and FashionMNIST, quaternion networks nearly equal real-valued MLPs, whereas product-state VQCs show lower accuracy and higher cost. On CIFAR-10, quaternion networks retain 94--97% of real-valued performance and remain stable under a 32-fold increase in dimensionality. Product-state circuits underperform quaternion classifiers, while entanglement gives modest grayscale gains but reverses under pretrained CNN features (9.25 pp degradation vs.\ product-state). Fubini--Study/QFI natural gradients improve geometric alignment but not short-horizon loss reduction vs.\ Adam. A Friedman test on five-seed MNIST detects model differences (χ2=12.796χ^2=12.796, p=0.0051p=0.0051, n=5n=5), with Wilcoxon tests yielding large effect sizes (d>5d>5) for QuatNet vs.\ quantum comparisons. For FashionMNIST and CIFAR-10, large effects (d>2.0d>2.0) are the primary statistic given n=3n=3. These results indicate that quaternion networks provide efficient, stable SU(2)\mathrm{SU}(2) alternatives to shallow VQCs on tasks lacking intrinsic quantum structure. Shared local SU(2)\mathrm{SU}(2) geometry and shallow entanglement are insufficient, within the regime studied, to confer practical quantum advantage. Conclusions are limited to shallow, measurement-limited circuits on such tasks.
May 12, 2026

A Family of Quaternion-Valued Differential Evolution Algorithms for Numerical Function Optimization

The numerical optimization of continuous functions is a fundamental task in many scientific and engineering domains, ranging from mechanical design to training of artificial intelligence models. Among the most effective and widely used algorithms for this purpose is Differential Evolution (DE), known for its simplicity and strong performance. Recent research has shown that adapting AI models to operate over alternative number systems-such as complex numbers, quaternions, and geometric algebras-can improve model compactness and accuracy. However, such extensions remain underexplored in bio-inspired optimization algorithms. In particular, the use of quaternion algebra represents an emerging area in computational intelligence. This paper introduces a family of novel Quaternion-Valued Differential Evolution (QDE) algorithms that operate directly in the quaternion space. We propose several mutation strategies specifically designed to exploit the algebraic and geometric properties of quaternions. Results show that our QDE variants achieve faster convergence and superior performance on several function classes in the BBOB benchmark compared to the traditional real-valued DE algorithm.