Papers › Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models

Uniform Memory Retrieval with Larger Capacity for Modern Hopfield Models

4 Apr 2024arXiv:2404.03827archive 2025-07-28

Dennis Wu, Jerry Yao-Chieh Hu, Teng-Yun Hsiao, Han Liu

We propose a two-stage memory retrieval dynamics for modern Hopfield models, termed U-Hop, with enhanced memory capacity. Our key contribution is a learnable feature map Φ which transforms the Hopfield energy function into kernel space. This transformation ensures convergence between the local minima of energy and the fixed points of retrieval dynamics within the kernel space. Consequently, the kernel norm induced by Φ serves as a novel similarity measure. It utilizes the stored memory patterns as learning data to enhance memory capacity across all modern Hopfield models. Specifically, we accomplish this by constructing a separation loss ℒ_Φ that separates the local minima of kernelized energy by separating stored memory patterns in kernel space. Methodologically, U-Hop memory retrieval process consists of: (Stage I) minimizing separation loss for a more uniform memory (local minimum) distribution, followed by (Stage II) standard Hopfield energy minimization for memory retrieval. This results in a significant reduction of possible metastable states in the Hopfield energy function, thus enhancing memory capacity by preventing memory confusion. Empirically, with real-world datasets, we demonstrate that U-Hop outperforms all existing modern Hopfield models and state-of-the-art similarity measures, achieving substantial improvements in both associative memory retrieval and deep learning tasks. Code is available at https://github.com/MAGICS-LAB/UHop ; future updates are on arXiv:2404.03827

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2404.03827")

Code

Syntology Ran 6 of 7 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 2 ran · our draft was wrong; 4 ran with no contract checked.

By repository: official repository: 7 samples from 1 repository, 6 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

magics-lab/uhop officialmentioned in papermentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 6 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

2ran · our draft was wrong
4ran
1unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from magics-lab/uhop. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

Association magics-lab/uhop/layers.py official repository ran Apache-2.0 (permissive) · 7b1cf2534617049b · report
LearnableHopfield magics-lab/uhop/layers.py official repository ran Apache-2.0 (permissive) · 5664657431b7e7a4 · report
Sparsemax magics-lab/uhop/layers.py official repository ran fingerprinted Apache-2.0 (permissive) · 8c413a2b668b9234 · report
SparsemaxFunction magics-lab/uhop/layers.py official repository ran Apache-2.0 (permissive) · 31d60d234cc0692f · report
flatten_all_but_nth_dim magics-lab/uhop/layers.py official repository ran · our draft was wrong Apache-2.0 (permissive) · 32ac3d67805b2251 · report
unflatten_all_but_nth_dim magics-lab/uhop/layers.py official repository ran · our draft was wrong Apache-2.0 (permissive) · bdec64ff3f52a1cc · report
sqdiff magics-lab/uhop/memory_retrieval_max_loss.py official repository unverified Apache-2.0 (permissive) · 827fc074dd33abc1 · report

Tasks

Retrieval

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections