Pith. sign in

REVIEW 5 major objections 5 minor 47 references

Novel Complex-Valued Hopfield Neural Networks with Phase and Magnitude Quantization

T0 review · 5 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read By quantizing both phase and magnitude at each neuron, two new complex-valued Hopfield networks obtain state spaces of $(Q+1)^{2N}$ and $(QK)^N$, and experiments confirm that they converge to stable states under Hermitian weights.

desk verdict New phase-and-magnitude quantized Hopfield activations with honest conjectures, but no convergence proof and an energy function that isn't real-valued; worth refereeing but not citable yet. read the letter →

arxiv 2507.00461 v1 pith:TY64QNBG submitted 2025-07-01 cs.NE cs.AI

Garimella Ramamurthy , Marcos Eduardo Valle , Tata Jagannadha Swamy This is my paper · ORCID
classification cs.NEcs.AI
keywords complex-valuedHopfieldneuralnetworksphasequantizationmagnitudeceilingactivationfunctionassociativememorycomplexsignumstatespaceconvergenceconjecture
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Two new complex-valued Hopfield neural networks are proposed, differing only in their activation functions: one applies a ceiling quantizer separately to the real and imaginary parts of the net input (CoCeil-CvHNN), and the other quantizes magnitude and phase in polar coordinates (CoSign-CvHNN). The paper's central claim is that this phase-and-magnitude quantization multiplies the number of states a Hopfield network can in principle store, from $4^N$ to $(Q+1)^{2N}$ in the Cartesian model and from $K^N$ to $(QK)^N$ in the polar model. Since a Hopfield network is only useful as associative memory if it settles, the paper further conjectures that both networks converge under the same weight conditions used for earlier models, namely $W_{ij}=\overline{W_{ji}}$ with real nonnegative diagonal entries. The experiments with random weights and initial states show the energy $E(S)=-\frac{1}{2}\sum_{i,j} S_i W_{ij} S_j$ decreasing to a stationary value, which the authors read as empirical confirmation of the conjecture. A sympathetic reader cares because, if the conjecture holds, these networks provide a straightforward way to enlarge the memory capacity of complex-valued associative memories without changing the number of neurons.

What carries the argument

The load-bearing objects are the two quantizing activation functions. $\operatorname{ceil}_{Q,R}$ is a ceiling-type step quantizer that maps a real number to one of $Q+1$ integer levels; applied coordinate-wise it gives $\operatorname{coceil}_{Q,R}$, whose image has $(Q+1)^2$ complex states, and applied to the magnitude before the phase quantizer $\operatorname{csign}_K$ it gives $\operatorname{CoSign}_{Q,R,K}$, whose image has $QK$ states. The convergence argument is carried, by conjecture, by the same quadratic Lyapunov energy $E(S)=-\frac{1}{2}\sum_{i,j}S_i W_{ij}S_j$ used in the convergence proofs of the earlier sign-based networks, together with the weight condition $W_{ij}=\overline{W_{ji}}$, $W_{ii}\ge 0$ real. The paper's experiments are designed to show this energy strictly decreasing in serial update mode from several initial states.

What would settle it

Simulate a small CoCeil- or CoSign-CvHNN, say $N=2$ or $3$ with $Q=2$, $R=1$, $K=4$, using a weight matrix with $W_{ij}=\overline{W_{ji}}$ and positive real diagonal entries such as $W_{11}=1$; if the value of $E(S)$ in (16) is ever non-real or increases between consecutive serial updates, or if the network enters a cycle of length greater than one from some initial state, the conjecture is false.

Watch

Extended reading notes

Core claim

On the paper's own terms, the discovery is that replacing the sign-type activations of previous complex-valued Hopfield networks with ceiling-type quantizers yields two new networks with dramatically larger discrete state spaces, and that these networks appear to inherit the stability of their predecessors. The CoCeil activation $\operatorname{coceil}_{Q,R}(a+bi)=\operatorname{ceil}_{Q,R}(a)+\operatorname{ceil}_{Q,R}(b)i$ partitions the complex plane into $(Q+1)^2$ rectangular bins, while the CoSign activation $\operatorname{CoSign}_{Q,R,K}(z)=\operatorname{ceil}_{Q,R}(|z|)\operatorname{csign}_K(z)$ partitions it into $QK$ annular phase sectors. The paper does not prove convergence theorems for either network; instead it states the conjecture that, for weights with $W_{ij}=\overline{W_{ji}}$ and $W_{ii}\ge 0$, serial updates converge to a fixed point, and it reports computational experiments, using five random initial states per network, in which the energy (16) reaches a stationary value. The authors conclude that both networks can serve as associative memories storing more distinct patterns than earlier complex-valued models.

Load-bearing premise

The load-bearing assumption is that the energy $E(S)=-\frac{1}{2}\sum_{i,j} S_i W_{ij} S_j$ is a real-valued, bounded-below Lyapunov function that strictly decreases for the two new ceiling activations whenever the weight matrix satisfies $W_{ij}=\overline{W_{ji}}$ and $W_{ii}\ge 0$; if this fails, the conjectured convergence has no proof and the experiments only cover a few random cases.

Editorial extensions

If this is right

  • If the conjecture holds, a CoCeil-CvHNN with $N$ neurons offers $(Q+1)^{2N}$ distinct states, compared with $4^N$ for the split-sign network, without any increase in neuron count.
  • If the conjecture holds, a CoSign-CvHNN offers $(QK)^N$ states, compared with $K^N$ for the complex-signum network, and reduces exactly to the complex-signum model when $Q=1$.
  • Convergence in serial mode under Hermitian weights with real nonnegative diagonal would make both networks usable as associative memories whose stored pattern count can be tuned by choosing $Q$, $R$, and $K$.
  • The reported energy plots show monotone decay to a stationary value from all tested initial states, the behavior an associative memory needs.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The conjecture is only as solid as the energy function: because the $i=j$ terms contribute $W_{ii} S_i^2$, and $S_i^2$ is complex for general states in the image sets, the expression in (16) need not be real-valued when $W_{ii}>0$; a rigorous proof would need to show the imaginary part cancels or introduce a different Lyapunov function.
  • A larger state space does not by itself guarantee more stored patterns; the next natural measurement is how many of the $(Q+1)^{2N}$ or $(QK)^N$ states are actual fixed points for a random Hermitian weight matrix, and how large their basins of attraction are.
  • Because $\operatorname{ceil}_{Q,R}$ is a superposition of step functions, each CoCeil neuron is equivalent to $Q$ threshold neurons sharing weights with different biases, so the known dynamics of real-valued ceiling Hopfield networks could supply a convergence proof for the complex Cartesian model.
  • The same magnitude-and-phase quantization recipe can be transplanted to hypercomplex Hopfield networks (quaternionic, Clifford, or vector-valued), since it only requires a coordinate split or a polar decomposition of the activation.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

5 major / 5 minor

Summary. The paper proposes two complex-valued Hopfield neural networks, CoCeil-CvHNN and CoSign-CvHNN, which quantize both magnitude and phase through ceiling-type activation functions in Cartesian and polar coordinates, respectively. The authors claim that these networks increase the number of possible states compared to existing CvHNNs and conjecture that, under Hermitian synaptic weights with nonnegative real diagonal, they converge to stable states. Section IV presents an energy function in Eq. (16) and computational experiments with five random initial states and a single parameter setting to support the conjecture. The paper also proposes that the increased state space enables these networks to memorize more stable states than previous models.

Significance. The proposed activation functions are well-defined and the state-space counts, (Q+1)^(2N) for CoCeil-CvHNN and (QK)^N for CoSign-CvHNN, are correct and represent a genuine enlargement of the discrete state spaces relative to the complex-signum and split-sign models. If the convergence conjecture were established, these models could be useful extensions for complex-valued associative memory. The paper is clearly written and honestly states that no convergence theorems are proved. However, the theoretical bridge offered, the energy function in Eq. (16), is not generally real-valued for complex states, and the empirical evidence is far too limited to confirm the conjecture. Thus the central claim remains unsupported.

major comments (5)
  1. [Section IV, Eq. (16)] The energy function E(S) = -1/2 Σ_i Σ_j S_i W_ij S_j is not real-valued for Hermitian W and complex states. For example, with N=2, W_11=W_22=0, W_12=1+i, W_21=1-i, and S=(1+i,1+i), one obtains E = -2i. Since a Lyapunov function must be real-valued and bounded below, Eq. (16) cannot serve as an energy function for the new activation functions, and the statement that 'this energy is also used to prove Theorems 1 and 2' is incorrect in this setting.
  2. [Section IV, Eq. (13) and experiments] The experiments set W_ii=0 for all i, so they do not test the conjectured condition W_ii ≥ 0 with nonzero diagonal entries. Moreover, the experiments use only N=10, five random initial states, and one parameter setting (Q=3, R=2, K=4). This sample is too small to rule out cycles or non-convergent trajectories, and it cannot 'confirm' a conjecture about the dynamics for general Hermitian weights with nonnegative real diagonal.
  3. [Section IV] The claim that the new networks 'can memorize more stable states' is not supported by any storage or retrieval experiment. The paper does not store patterns, measure the number of stable states, or evaluate retrieval success; the energy curves in Figure 5 only show that the particular random initial states reach a stationary point. Associative memory capacity requires a demonstration that stored patterns are stable and recoverable from noisy inputs.
  4. [Section IV, conjecture paragraph] The conjecture is based on Theorems 1 and 2, but those theorems apply to activation functions with unit-magnitude states (complex signum) or split-sign states on the hypercube {±1±i}. The new activation functions produce different state spaces: CoCeil outputs nonnegative integer coordinates and CoSign outputs states with variable magnitude. The analogy to the cited theorems is therefore not automatic, and no proof or sufficient numerical study is provided to bridge this gap.
  5. [Section IV and Figure 5] The text states that both networks 'reached a stationary state when employing synchronous update mode,' but the caption of Figure 5 says 'serial update mode.' This discrepancy should be resolved, as the convergence behavior can differ between serial and parallel update modes.
minor comments (5)
  1. [Section II-B] The phrase 'θK = π/K is know as phase quanta' contains a grammatical error; it should read 'is known as the phase quantum.'
  2. [Section II-A, Eq. (2)] The domain notation 'D ∈ C' should be 'D ⊂ C' to indicate that the activation function's domain is a subset of the complex plane.
  3. [Section III-B, Figure 4 caption] The parameter ordering in the caption, 'CoSignQ,K,R', is inconsistent with the definition CoSignQ,R,K used in Eq. (11) and the surrounding text; this should be unified.
  4. [Section IV] The initial states for CoCeil are obtained by applying coceilQ,R to samples from U(-3,7), but the activation function maps to {0,...,Q}; clarify whether the initial states are always elements of the image set (they are, by construction), and avoid the impression that states outside the image set are used.
  5. [References] Reference [47] is cited as 'submitted for publication'; if the dynamics discussion relies on this work, a preprint or a published version should be made available to the reader.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation found; the convergence claim is explicitly an unproved conjecture, not a fitted prediction or a self-validating argument.

full rationale

The paper's central novelty is the introduction of two quantization-based activation functions, and the claimed increase in state-space size follows directly from the definitions in Eqs. (10) and (11), not from fitted parameters or from circular normalization choices. The load-bearing stability claim is explicitly framed as a conjecture: Section IV states 'Although we do not have proven convergence theorems for the two novel CoCeil- and CoSign-CvHNNs... we conjecture that the synaptic weight matrix must satisfy the conditions...' and the experiments are then used only to support that conjecture. The weights in Eq. (13) are randomly generated with the conjectured Hermitian symmetry, but convergence is observed, not imposed by construction, so no fitted input is renamed as a prediction. Theorems 1 and 2 are cited as external convergence results and are used only by analogy to motivate the conjecture; since no theorem for the new networks is claimed, the argument cannot reduce to a self-citation chain. The paper does include self-citations, notably [40] for the split-sign convergence theorem and [46], [47] for the ceiling neuron background, but these results are not used to define the new networks' convergence in a way that assumes the target conclusion. The possible non-reality of the energy in Eq. (16) for complex states is a correctness risk in the experimental validation, not a circularity: the energy values are measured, not tuned to force the plotted decrease. Overall, no specific circular step can be exhibited from the paper's equations or citations.

Assumptions & free parameters 3 free parameters · 3 assumptions · 0 invented entities

The model definitions and state-count formulas are self-contained. The proof burden sits entirely in the convergence axioms. Q, R, and K are hand-chosen experiment constants, not fitted parameters. No new physical or mathematical entities are postulated beyond two composed activation functions.

free parameters (3)
  • Q (quantization levels per component or magnitude) = 3 in experiments
    Hand-chosen hyperparameter; controls the state-space size (Q+1)^(2N) for CoCeil and QK magnitude-phase levels for CoSign.
  • R (quantization interval width) = 2 in experiments
    Hand-chosen hyperparameter; sets the interval width of the ceiling function and the magnitude level widths.
  • K (phase sectors) = 4 in experiments
    Hand-chosen hyperparameter; sets the number of phase sectors for the complex signum and CoSign functions.
assumptions (3)
  • ad hoc to paper The update rule (2) converges for coceilQ,R and CoSignQ,R,K when Wij = conj(Wji) and Wii >= 0 is real.
    Stated as a conjecture in Section IV with no proof; the associative-memory claim depends on it.
  • domain assumption E(S) = -1/2 sum_i sum_j S_i W_ij S_j is a real-valued, bounded, decreasing energy for both new activations.
    Needed to transfer stability arguments from Theorems 1 and 2 to the new networks; not proved, and diagonal terms W_ii S_i^2 can be complex when W_ii > 0.
  • ad hoc to paper Five random initial states with one parameter setting are representative of the networks' behavior generally.
    Section IV uses five starts with N=10, Q=3, R=2, K=4 and treats the observed convergence as confirmation of the general conjecture.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Novel Complex-Valued Hopfield Neural Networks with Phase and Magnitude Quantization." pith.science (2026). https://pith.science/paper/TY64QNBG

@misc{pith2026250700461,
  author       = {Pith},
  title        = {Pith review of: Novel Complex-Valued Hopfield Neural Networks with Phase and Magnitude Quantization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TY64QNBG}},
  note         = {Machine review of arXiv:2507.00461}
}
read the original abstract

This research paper introduces two novel complex-valued Hopfield neural networks (CvHNNs) that incorporate phase and magnitude quantization. The first CvHNN employs a ceiling-type activation function that operates on the rectangular coordinate representation of the complex net contribution. The second CvHNN similarly incorporates phase and magnitude quantization but utilizes a ceiling-type activation function based on the polar coordinate representation of the complex net contribution. The proposed CvHNNs, with their phase and magnitude quantization, significantly increase the number of states compared to existing models in the literature, thereby expanding the range of potential applications for CvHNNs.

Figures

Figures reproduced from arXiv: 2507.00461 by the authors.

Figure 1
Figure 1. Sections of C yielded by the csign function with K = 4. where θK = π/K is know as phase quanta, εℓ = e 2ℓθKi is the ℓth root of the unity, for ℓ = 0, . . . , K − 1, and θ denotes the phase of z [4], [45]. Note that the csignK produces K discrete complex numbers that are uniformly distributed on the unit circle in the complex plane [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Plot of the ceilQ,R function with Q = 3 and R = 2. ceilQ,R function can be written as a superposition of step functions ceilQ,R(x) = X Q q=1 step x − (q − 1)R  , ∀x ∈ R (8) where step : R → {0, 1} is given by step(x) = ( 1, x ≥ 0, 0, x < 0. (9) As a result, a neuron model incorporating the ceilQ,R function can be interpreted as the superposition of Q linear threshold neurons. These neurons share the same weights bu… view at source ↗
Figure 4
Figure 4. Sections of the complex plane yielded by the [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figures from the paper (1 more)
Figure 5
Figure 5. Figure 5: Energy values generated by a) the CoCeil-CvHNN and b) CoSign-CvHNN, starting from five different initial states. [PITH_FULL_IMAGE:figures/full_fig_p006_5.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

47 extracted references · 44 canonical work pages

  1. [1]

    A Logical Calculus of the Ideas Immanent in Nervous Activity,

    W. S. McCulloch and W. Pitts, “A Logical Calculus of the Ideas Immanent in Nervous Activity,” Bulletin of Mathematical Biophysics , vol. 5, pp. 115–133, 1943

    work page 1943

  2. [2]

    Haykin, Neural Networks and Learning Machines , 3rd ed

    S. Haykin, Neural Networks and Learning Machines , 3rd ed. Upper Saddle River, NJ: Prentice-Hall, 2009

    work page 2009

  3. [3]

    A certain generalization of threshold functions,

    N. N. Aizenberg, Y . L. Ivaskiv, and D. A. Pospelov, “A certain generalization of threshold functions,” Dokrady Akademii Nauk SSSR , vol. 196, pp. 1287–1290, 1971

    work page 1971

  4. [4]

    Aizenberg, Complex-Valued Neural Networks with Multi-Valued Neu- rons, ser

    I. Aizenberg, Complex-Valued Neural Networks with Multi-Valued Neu- rons, ser. Studies in Computational Intelligence. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011, vol. 353

    work page 2011

  5. [5]

    Complex-valued neural networks: The merits and their origins,

    A. Hirose, “Complex-valued neural networks: The merits and their origins,” Proceedings of the International Joint Conference on Neural Networks, pp. 1237–1244, 2009

    work page 2009

  6. [6]

    Complex-valued neural networks,

    ——, “Complex-valued neural networks,” Studies in Computational Intelligence, vol. 400, pp. 1–214, 2012

    work page 2012

  7. [7]

    Deep complex networks,

    C. Trabelsi, O. Bilaniuk, Y . Zhang, D. Serdyuk, S. Subramanian, J. F. Santos, S. Mehri, N. Rostamzadeh, Y . Bengio, and C. J. Pal, “Deep complex networks,” 5 2017

    work page 2017

  8. [8]

    The universal approximation theorem for complex- valued neural networks,

    F. V oigtlaender, “The universal approximation theorem for complex- valued neural networks,” Applied and Computational Harmonic Analy- sis, vol. 64, pp. 33–61, 5 2023

    work page 2023

Show all 47 references
  1. [9]

    Complex-Valued Neural Networks with Nonparametric Activation Functions,

    S. Scardapane, S. Van Vaerenbergh, A. Hussain, and A. Uncini, “Complex-Valued Neural Networks with Nonparametric Activation Functions,” IEEE Transactions on Emerging Topics in Computational Intelligence, vol. 4, no. 2, pp. 140–150, 4 2020

    2020

  2. [10]

    Complex-Valued Neural Networks: A Comprehensive Survey,

    C. Lee, H. Hasegawa, and S. Gao, “Complex-Valued Neural Networks: A Comprehensive Survey,” IEEE/CAA Journal of Automatica Sinica , vol. 9, no. 8, pp. 1406–1426, 8 2022

    2022

  3. [11]

    CVKAN: Complex-Valued Kolmogorov-Arnold Networks,

    M. Wolff, F. Eilers, and X. Jiang, “CVKAN: Complex-Valued Kolmogorov-Arnold Networks,” 2025. [Online]. Available: https: //arxiv.org/abs/2502.02417

    2025

  4. [12]

    Neural networks and physical systems with emergent collective computational abilities,

    J. J. Hopfield, “Neural networks and physical systems with emergent collective computational abilities,” Proceedings of the National Academy of Sciences of the United States of America , vol. 79, no. 8, pp. 2554– 2558, 1982

    1982

  5. [13]

    The capacity of the Hopfield associative memory,

    R. J. McEliece, E. C. Posner, E. R. Rodemich, and S. S. Venkatesh, “The capacity of the Hopfield associative memory,” IEEE Transactions on Information Theory , vol. 1, pp. 33–45, 1987

    1987

  6. [14]

    M. H. Hassoun, Fundamentals of Artificial Neural Networks . Cam- bridge, MA: MIT Press, 1995

    1995

  7. [15]

    Associative Memory Networks,

    M. H. Hassoun and P. B. Watta, “Associative Memory Networks,” in Handbook of Neural Computation, E. Fiesler and R. Beale, Eds. Oxford University Press, 1997, pp. C1.3:1–C1.3:14

    1997

  8. [16]

    Decreasing energy functions as a tool for studying threshold networks,

    E. Goles-Chacc, F. Fogelman-Soulie, and D. Pellegrin, “Decreasing energy functions as a tool for studying threshold networks,” Discrete Applied Mathematics, vol. 12, no. 3, pp. 261–277, 11 1985

    1985

  9. [17]

    A Hopfield neural network for adaptive image segmentation: An active surface paradigm,

    D. Shen and H. H. S. Ip, “A Hopfield neural network for adaptive image segmentation: An active surface paradigm,” Pattern Recognition Letters, vol. 18, no. 1, pp. 37–48, 1997

    1997

  10. [18]

    Neural Techniques for Combinatorial Optimization with Applications,

    K. Smith, M. Palaniswami, and M. Krishnamoorthy, “Neural Techniques for Combinatorial Optimization with Applications,” IEEE Transactions on Neural Networks , vol. 9, no. 6, pp. 1301–1318, 1998

    1998

  11. [19]

    A Hopfield Neural Network for Image Change Detection,

    G. Pajares, “A Hopfield Neural Network for Image Change Detection,” IEEE Transaction on Neural Networks , vol. 17, no. 5, pp. 1250–1264, 2006

    2006

  12. [20]

    A Hopfield Neural Network for Combining Classifiers Applied to Textured Images,

    G. Pajares, M. Guijarro, and A. Ribeiro, “A Hopfield Neural Network for Combining Classifiers Applied to Textured Images,” Neural Networks, vol. 23, no. 1, pp. 144–153, 2010

    2010

  13. [21]

    New Insights on Learning Rules for Hopfield Networks: Memory and Objective Function Minimisation,

    P. Tolmachev and J. H. Manton, “New Insights on Learning Rules for Hopfield Networks: Memory and Objective Function Minimisation,” in Proceedings of the International Joint Conference on Neural Networks . Institute of Electrical and Electronics Engineers Inc., 7 2020

    2020

  14. [22]

    Large Associative Memory Problem in Neurobiology and Machine Learning,

    D. Krotov and J. Hopfield, “Large Associative Memory Problem in Neurobiology and Machine Learning,” 8 2020. [Online]. Available: http://arxiv.org/abs/2008.06996

    2020 arXiv

  15. [23]

    Hopfield Networks is All You Need,

    H. Ramsauer, B. Sch ¨afl, J. Lehner, P. Seidl, M. Widrich, L. Gruber, M. Holzleitner, M. Pavlovi ´c, G. K. Sandve, V . Greiff, D. Kreil, M. Kopp, G. Klambauer, J. Brandstetter, and S. Hochreiter, “Hopfield Networks is All You Need,” 7 2020. [Online]. Available: http://arxiv.or...

    2020 arXiv

  16. [24]

    Hierarchical Associative Memory, Parallelized MLP-Mixer, and Symmetry Breaking,

    R. Karakida, T. Ota, and M. Taki, “Hierarchical Associative Memory, Parallelized MLP-Mixer, and Symmetry Breaking,” 6 2024

    2024

  17. [25]

    Associative Memory in Sparse Phasor Neural Networks,

    A. J. Noest, “Associative Memory in Sparse Phasor Neural Networks,” EPL (Europhysics Letters) , vol. 6, no. 5, p. 469, 1988

    1988

  18. [26]

    Discrete-state phasor neural networks,

    ——, “Discrete-state phasor neural networks,” Physical Review A , vol. 38, no. 4, pp. 2196–2199, 8 1988

    1988

  19. [27]

    Phasor Neural Networks,

    ——, “Phasor Neural Networks,” in Neural Information Processing Systems, D. Z. Anderson, Ed. American Institute of Physics, 1988, pp. 584–591

    1988

  20. [28]

    Complex-valued mul- tistate neural associative memory,

    S. Jankowski, A. Lozowski, and J. M. Zurada, “Complex-valued mul- tistate neural associative memory,” IEEE Transactions on Neural Net- works, vol. 7, no. 6, pp. 1491–1496, 1996

    1996

  21. [29]

    A new design method for the complex-valued multistate hopfield associative memory,

    M. K. M ¨uezzinoˇglu, C. G ¨uzelis ¸, and J. M. Zurada, “A new design method for the complex-valued multistate hopfield associative memory,” IEEE Transactions on Neural Networks , vol. 14, no. 4, pp. 891–899, 7 2003

    2003

  22. [30]

    Improvements of complex-valued Hopfield associative mem- ory by using generalized projection rules,

    D.-L. Lee, “Improvements of complex-valued Hopfield associative mem- ory by using generalized projection rules,” IEEE Transactions on Neural Networks, vol. 17, no. 5, pp. 1341–1347, 2006

    2006

  23. [31]

    Complex-Valued Multistate Associative Memory With Nonlinear Multilevel Functions for Gray-Level Image Reconstruction,

    G. Tanaka and K. Aihara, “Complex-Valued Multistate Associative Memory With Nonlinear Multilevel Functions for Gray-Level Image Reconstruction,” IEEE Transactions on Neural Networks, vol. 20, no. 9, pp. 1463–1473, 9 2009

    2009

  24. [32]

    Enhancing computational efficiency of gradient descent in complex-valued Hopfield neural network through GPU parallelization,

    T. Hashimoto, T. Isokawa, M. Kobayashi, and N. Kamiura, “Enhancing computational efficiency of gradient descent in complex-valued Hopfield neural network through GPU parallelization,” Nonlinear Theory and Its Applications, IEICE, vol. 16, no. 1, pp. 197–207, 2025

    2025

  25. [33]

    Complex-valued Hopfield associative memories with hybrid connections,

    M. Kobayashi, “Complex-valued Hopfield associative memories with hybrid connections,” Nonlinear Theory and Its Applications, IEICE , vol. 16, no. 1, pp. 13–29, 2025

    2025

  26. [34]

    Quaternionic Neural Net- works for Associative Memories,

    T. Isokawa, H. Nishimura, and N. Matsui, “Quaternionic Neural Net- works for Associative Memories,” in Complex-Valued Neural Networks: Advances and Applications. John Wiley and Sons, 5 2013, pp. 103–131

    2013

  27. [35]

    Split Quaternion-Valued Twin-Multistate Hopfield Neu- ral Networks,

    M. Kobayashi, “Split Quaternion-Valued Twin-Multistate Hopfield Neu- ral Networks,” Advances in Applied Clifford Algebras , vol. 30, no. 3, pp. 1–9, 7 2020

    2020

  28. [36]

    Hopfield neural networks using Klein four-group,

    ——, “Hopfield neural networks using Klein four-group,” Neurocom- puting, vol. 387, pp. 123–128, 4 2020

    2020

  29. [37]

    Clifford Hopfield Neural Networks,

    J. R. Vallejo and E. Bayro-Corrochano, “Clifford Hopfield Neural Networks,” in 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence) , 2008, pp. 3609–3612

    2008

  30. [38]

    A broad class of discrete-time hypercomplex-valued Hopfield neural networks,

    F. Z. de Castro and M. E. Valle, “A broad class of discrete-time hypercomplex-valued Hopfield neural networks,” Neural Networks, vol. 122, pp. 54–67, 2020

    2020

  31. [39]

    Vector-Valued Hopfield Neural Networks and Distributed Synapse Based Convolutional and Linear Time-Variant Associative Memories,

    R. M. Garimella, M. E. Valle, G. Vieira, A. Rayala, and D. Munugoti, “Vector-Valued Hopfield Neural Networks and Distributed Synapse Based Convolutional and Linear Time-Variant Associative Memories,” Neural Processing Letters , vol. 55, no. 4, pp. 4163–4182, 8 2023

    2023

  32. [40]

    Complex-valued neural associative memory on the complex hypercube,

    G. R. Murthy and D. Praveen, “Complex-valued neural associative memory on the complex hypercube,” in 2004 IEEE Conference on Cybernetics and Intelligent Systems , 2004, pp. 648–652

    2004

  33. [41]

    Infinite Population, Complex Valued State Neural Network on the Complex Hypercube,

    G. Rama Murthy, “Infinite Population, Complex Valued State Neural Network on the Complex Hypercube,” in International Conference on Cognitive Science (ICCS 2004) , 2004

    2004

  34. [42]

    CNN based on multivalued neuron as a model of associative memory for gray-scale images,

    N. N. Aizenberg and I. N. Aizenberg, “CNN based on multivalued neuron as a model of associative memory for gray-scale images,” in Proceedings of the 2nd International Workshop on Cellular Neural Networks and Their Applications , 1992, pp. 36–42

    1992

  35. [43]

    Some Remarks on the Stability of Discrete-Time Complex-Valued Multistate Hopfield Neural Networks,

    F. Z. d. Castro and M. E. Valle, “Some Remarks on the Stability of Discrete-Time Complex-Valued Multistate Hopfield Neural Networks,” in Proceeding Series of the Brazilian Society of Computational and Applied Mathematics, vol. 6, no. 2. SBMAC, 12 2018

    2018

  36. [44]

    A generalized convergence theorem for neural networks,

    J. Bruck and J. Goodman, “A generalized convergence theorem for neural networks,” IEEE Transactions on Information Theory , vol. 34, no. 5, pp. 1089–1092, 9 1988

    1988

  37. [45]

    Symmetric Complex-Valued Hopfield Neural Net- works,

    M. Kobayashi, “Symmetric Complex-Valued Hopfield Neural Net- works,” IEEE Transactions on Neural Networks and Learning Systems , vol. 28, no. 4, pp. 1011–1015, 2017

    2017

  38. [46]

    Novel Ceiling Neuron Model and its Applications,

    R. M. Garimella, S. D. Munugoti, and A. Rayala, “Novel Ceiling Neuron Model and its Applications,” in 2019 International Joint Conference on Neural Networks (IJCNN) , vol. 2019-July. IEEE, 7 2019, pp. 1–8

    2019

  39. [47]

    On the dynamics of Real Valued Hopfield-Type Neural Networks based on Ceiling Neurons,

    R. M. Garimella and F. Z. Castro, “On the dynamics of Real Valued Hopfield-Type Neural Networks based on Ceiling Neurons,” 2025, submitted for publication

    2025

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.