arXiv:2311.06518
공식 코드 · Papers with Code
Minimum Description Length Hopfield Networks
원문 초록
Associative memory architectures are designed for memorization but also offer, through their retrieval method, a form of generalization to unseen inputs: stored memories can be seen as prototypes from this point of view. Focusing on Modern Hopfield Networks (MHN), we show that a large memorization capacity undermines the generalization opportunity. We offer a solution to better optimize this tradeoff. It relies on Minimum Description Length (MDL) to determine during training which memories to store, as well as how many of them.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
From Roots to Rewards: Dynamic Tree Reasoning with RL
Developing Visual Augmented Q&A System using Scalable Vision Embedding Retrieval & Late Interaction Re-ranker
Seq vs Seq: An Open Suite of Paired Encoders and Decoders
Reasoning or Memorization? Unreliable Results of Reinforcement Learning Due to Data Contamination
Kodezi Chronos: A Debugging-First Language Model for Repository-Scale, Memory-Driven Code Understanding
RadiomicsRetrieval: A Customizable Framework for Medical Image Retrieval Using Radiomics Features
토론
이 논문과 연결된 포럼 글이 아직 없습니다.