A note on the complex and bicomplex valued neural networks
In this paper we first write a proof of the perceptron convergence algorithm for the complex multivalued neural networks (CMVNNs). Our primary goal is to formulate and prove the perceptron convergence algorithm for the bicomplex multivalued neural networks (BMVNNs) and other important results in the theory of neural networks based on a bicomplex algebra.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Two Bicomplex and One Multicomplex Least Mean Square algorithms
We study and introduce new gradient operators in the complex and bicomplex settings, inspired from the well-known Least Mean Square (LMS) algorithm invented in 1960 by Widrow and Hoff for Adaptive Linear Neuron (ADALINE)…
Vocal Bursts Valence PredictionPolar $n$-Complex and $n$-Bicomplex Singular Value Decomposition and Principal Component Pursuit
Informed by recent work on tensor singular value decomposition and circulant algebra matrices, this paper presents a new theoretical bridge that unifies the hypercomplex and tensor-based approaches to singular value deco…
On a heuristic approach to the description of consciousness as a hypercomplex system state and the possibility of machine consciousness (German edition)
This article presents a heuristic view that shows that the inner states of consciousness experienced by every human being have a physical but imaginary hypercomplex basis. The hypercomplex description is necessary becaus…
ArticlesAutomatic Differentiation for Complex Valued SVD
In this note, we report the back propagation formula for complex valued singular value decompositions (SVD). This formula is an important ingredient for a complete automatic differentiation(AD) infrastructure in terms of…
Tensor NetworksComplex-Valued Kernel Methods for Regression
Usually, complex-valued RKHS are presented as an straightforward application of the real-valued case. In this paper we prove that this procedure yields a limited solution for regression. We show that another kernel, here…
regression