Efficient event-driven retrieval in high-capacity kernel Hopfield networks

• URL: http://arxiv.org/abs/2605.05978v2
• Date: Mon, 11 May 2026 03:19:14 GMT
• Title: Efficient event-driven retrieval in high-capacity kernel Hopfield networks
• Abstract summary: High-capacity associative memory models, such as Kernel Logistic Regression (KLR) Hopfield networks, have demonstrated strong storage capabilities but typically rely on computationally expensive synchronous updates.<n>We show that, under appropriately tuned kernel parameters, sequential updates exhibit trajectories that are statistically indistinguishable from those of synchronous dynamics.<n>We find that the asynchronous network achieves empirical storage capacities approaching $P/N approx 30$ in static random pattern regimes, exceeding classical limits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High-capacity associative memory models, such as Kernel Logistic Regression (KLR) Hopfield networks, have demonstrated strong storage capabilities but typically rely on computationally expensive synchronous updates. This reliance poses a bottleneck for deployment on energy-efficient, event-driven neuromorphic hardware. In this paper, we investigate the asynchronous retrieval dynamics of KLR Hopfield networks. We show empirically that, under appropriately tuned kernel parameters, asynchronous sequential updates exhibit trajectories that are statistically indistinguishable from those of synchronous dynamics, while maintaining high recall accuracy within the tested regime for random patterns. Furthermore, we find that the asynchronous network achieves empirical storage capacities approaching $P/N \approx 30$ in static random pattern regimes, exceeding classical limits. To evaluate computational efficiency, we analyze the total number of state transitions (bit flips) required for error correction. The results show that the network converges using a number of events close to the initial Hamming distance from the target pattern, without observable spurious oscillations. These findings suggest that the large-margin attractors induced by KLR learning create a smooth energy landscape suited for sparse, event-driven computation, providing a basis for scalable and low-power associative memory on neuromorphic architectures.

Related papers

• Frequency Domain Reservoir Computing [10.316233181797408]
  Echo State Networks (ESNs) offer a compelling approach by utilizing fixed recurrent weights to circumvent backpropagation through time.<n>We introduce Frequency Domain Reservoir Computing (FRESCO), an ESN architecture operating entirely in the frequency domain.<n> FRESCO drastically reduces computational costs and energy consumption of training and inference.
  arXiv  Detail & Related papers  (2026-06-23T10:14:46Z)
• Robust Auto-associative Memory via Convolutional Restricted Hopfield Networks [0.22940141855172036]
  Associative memory models play a fundamental role in pattern retrieval.<n>Existing approaches, including Modern Hopfield Networks (MHNs), and Predictive Coding Networks (PCNs) exhibit limitations in balancing storage capacity, computational efficiency, and robustness.<n>We propose a Convolutional Restricted Hopfield Networks (CRHNs), which integrates convolutional feature extraction with attractor-based memory retrieval in a structured latent space.
  arXiv  Detail & Related papers  (2026-06-11T21:25:54Z)
• Geometric analysis of attractor boundaries and storage capacity limits in kernel Hopfield networks [0.0]
  This paper investigates the global geometry of attractor basins and the physical determinants of the storage limit in KLR-trained Hopfield networks.<n>Experiments reveal that the network achieves a storage capacity for random sequences up to $P/N approx 16$.
  arXiv  Detail & Related papers  (2026-05-01T03:04:44Z)
• Unveiling the Mechanism of Continuous Representation Full-Waveform Inversion: A Wave Based Neural Tangent Kernel Framework [52.632217600064344]
  Full-waveform inversion (FWI) estimates physical parameters in the wave equation from limited measurements.<n>FWI methods are limited by their notorious sensitivity to the accuracy of the initial models.<n>Recent progress in continuous representation FWI (CR-FWI) demonstrates that representing parameter models with a coordinate-based neural network, such as implicit neural representation (INR), can mitigate the dependence on initial models.
  arXiv  Detail & Related papers  (2026-03-23T03:22:33Z)
• Neural Dynamics Self-Attention for Spiking Transformers [59.57278823240336]
  Spiking Neural Networks (SNNs) with Transformer architectures offer a promising pathway to balance energy efficiency and performance.<n>Existing Spiking Transformers face two critical challenges: (i) a substantial performance gap compared to their Artificial Neural Networks (ANNs) counterparts and (ii) high memory overhead during inference.<n>We propose LRF-Dyn, which uses spiking neurons with localized receptive fields to compute attention while reducing memory requirements.
  arXiv  Detail & Related papers  (2026-03-09T12:23:37Z)
• ANCRe: Adaptive Neural Connection Reassignment for Efficient Depth Scaling [57.91760520589592]
  Scaling network depth has been a central driver behind the success of modern foundation models.<n>This paper revisits the default mechanism for deepening neural networks, namely residual connections.<n>We introduce adaptive neural connection reassignment (ANCRe), a principled and lightweight framework that parameterizes and learns residual connectivities from the data.
  arXiv  Detail & Related papers  (2026-02-09T18:54:18Z)
• Multivariate time series prediction using clustered echo state network [4.4778341776682735]
  Echo state networks (ESNs) offer an efficient alternative to conventional recurrent neural networks.<n>We show that CESNs consistently outperform conventional ESNs in terms of predictive accuracy and robustness to noise.<n>Our algorithm works well across diverse real-world datasets such as the stock market, solar wind, and chaotic Rssler system.
  arXiv  Detail & Related papers  (2025-11-28T17:14:15Z)
• Learning with Spike Synchrony in Spiking Neural Networks [3.8506283985103447]
  Spiking neural networks (SNNs) promise energy-efficient computation by mimicking biological neural dynamics.<n>We introduce spike-synchrony-dependent plasticity (SSDP), a training approach that adjusts synaptic weights based on the degree of neural firing rather than spike timing.
  arXiv  Detail & Related papers  (2025-04-14T04:01:40Z)
• MF-NeRF: Memory Efficient NeRF with Mixed-Feature Hash Table [62.164549651134465]
  We propose MF-NeRF, a memory-efficient NeRF framework that employs a Mixed-Feature hash table to improve memory efficiency and reduce training time while maintaining reconstruction quality. Our experiments with state-of-the-art Instant-NGP, TensoRF, and DVGO, indicate our MF-NeRF could achieve the fastest training time on the same GPU hardware with similar or even higher reconstruction quality.
  arXiv  Detail & Related papers  (2023-04-25T05:44:50Z)
• AEGNN: Asynchronous Event-based Graph Neural Networks [54.528926463775946]
  Event-based Graph Neural Networks generalize standard GNNs to process events as "evolving"-temporal graphs. AEGNNs are easily trained on synchronous inputs and can be converted to efficient, "asynchronous" networks at test time.
  arXiv  Detail & Related papers  (2022-03-31T16:21:12Z)
• Euler State Networks: Non-dissipative Reservoir Computing [3.55810827129032]
  We propose a novel Reservoir Computing (RC) model, called the Euler State Network (EuSN) Our mathematical analysis shows that the resulting model is biased towards a unitary effective spectral radius and zero local Lyapunov exponents, intrinsically operating near to the edge of stability. Results on time-series classification benchmarks indicate that EuSN is able to match (or even exceed) the accuracy of trainable Recurrent Neural Networks.
  arXiv  Detail & Related papers  (2022-03-17T15:18:34Z)
• Event-based Asynchronous Sparse Convolutional Networks [54.094244806123235]
  Event cameras are bio-inspired sensors that respond to per-pixel brightness changes in the form of asynchronous and sparse "events" We present a general framework for converting models trained on synchronous image-like event representations into asynchronous models with identical output. We show both theoretically and experimentally that this drastically reduces the computational complexity and latency of high-capacity, synchronous neural networks.
  arXiv  Detail & Related papers  (2020-03-20T08:39:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.