Kernel Logistic Regression Learning for High-Capacity Hopfield Networks

Akira Tamamori
4/10/2025
cs.LGcs.NE

No confident code implementation found for this paper.

Abstract

Hebbian learning limits Hopfield network storage capacity (pattern-to-neuron ratio around 0.14). We propose Kernel Logistic Regression (KLR) learning. Unlike linear methods, KLR uses kernels to implicitly map patterns to high-dimensional feature space, enhancing separability. By learning dual variables, KLR dramatically improves storage capacity, achieving perfect recall even when pattern numbers exceed neuron numbers (up to ratio 1.5 shown), and enhances noise robustness. KLR demonstrably outperforms Hebbian and linear logistic regression approaches.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{tamamori2025kernel,
  title  = {Kernel Logistic Regression Learning for High-Capacity Hopfield Networks},
  author = {Akira Tamamori},
  year   = {2025},
  eprint = {2504.07633},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2504.07633v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2504.07633.svg)](https://codeofpaper.com/paper/2504.07633)

Discussion