arXiv Machine Learning

Memoization Without Keys: Compact, Out-of-Core Tables for Functions of Sorted Arguments

arXiv Machine Learning
Sep 18

A Table-Free Index for Tapered Memoization Grids: Compact Out-of-Core Evaluation of Functions of Sorted Arguments

The paper presents a table‑free index for tapered memoization grids, enabling compact out‑of‑core evaluation of functions that depend on sorted arguments. By showing that the grid’s key set corresponds to multiset combinations, the authors derive a closed‑form O(d) ranking and unranking scheme that removes the need for large preprocessing tables and allows order‑free parallel construction. The resulting values‑only flat array uses significantly less memory than hash‑map memoization, offers faster query times once cache limits are exceeded, and remains operable with memory‑mapped storage beyond RAM.

By Tamal Maharaj
arXiv Machine Learning
Aug 26

A Feature-Major Codebook for Memory-Efficient Sparse-Binary Self-Organizing Maps: Scaling a MEDLINE Atlas to 1.05 Million Neurons on a Single Consumer GPU

The paper presents a memory‑efficient sparse‑binary self‑organising map (SOM) that scales a MEDLINE atlas to over a million neurons on a single consumer GPU. By re‑ordering the codebook into a feature‑major layout, the authors accelerate the best‑matching‑unit search by 4.5–8.5× without increasing quantisation error, enabling training of a 1,048,576‑neuron SOM in 72 s on a 24 GB GPU. The approach outperforms existing cuSPARSE and CPU‑based SOM implementations, achieving the largest SOM reported to date and demonstrating that resolution limits are computational rather than data‑driven.

By Andrew James Amos
arXiv AI
Sep 30

Mnemon: Raw Records, Fast Judgments, Slow Thoughts

Mnemon is a memory agent that stores conversations as raw, dated records and uses a fast System 1 decision model (Jev) to quickly judge the relevance of records, while a slow System 2 LLM plans searches and composes answers. The agent consolidates records into topic timelines and value histories in the background, enabling efficient retrieval without rewriting conversations into structured formats. Experiments show Mnemon achieving high scores on LoCoMo and LongMemEval‑S with low context length and cost, and Jev outperforming LLMs in evidence separation and speed.

By Guangren Wang
arXiv AI
Aug 18

Static Pruning Across Sparse Retrieval Regimes: What Transfers, What Breaks, and What Still Helps

arXiv:2608. 16309v1 Announce Type: cross Abstract: Static pruning is widely used to accelerate sparse neural retrieval, yet existing studies each validate their conclusions within a single custom pipeline, leaving it unclear which findings transfer to modern engines with different index organizations and dynamic pruning mechanisms.

By Zirui Song, Yuye Zhu, Yang Yang
arXiv Machine Learning
Aug 27

Trust the Mass: Forced Weights in KV-Cache Eviction

The paper investigates KV‑cache eviction strategies for sparse‑attention models, showing that selecting the largest attention weights is nearly optimal—closing only a median 2–5 % of the gap to full attention. It further demonstrates that differences in performance between eviction methods largely stem from memory usage, with the new training‑free ContourKV allocator outperforming state‑of‑the‑art methods in most pairwise comparisons while matching their byte‑efficiency.

By Jack Shi, Jerry Gu
arXiv AI
Nov 5

FlyHash for LLM Agent Memory: An Empirical Validation and a New Application

The paper evaluates FlyHash, a locality‑sensitive hashing scheme inspired by the fruit fly’s olfactory circuit, for use in large language model (LLM) agent memory retrieval. It demonstrates that FlyHash maintains a quality advantage over SimHash when bits are matched, and that this advantage persists with real agent‑memory relevance labels. However, FlyHash’s larger, slower codes and the dominance of dense‑vector indexing (HNSW) limit its practical benefits in terms of memory and latency savings.

By Mohan Bheemadolu, Chrisogonas O. Odhiambo
arXiv AI
Nov 6

Enhancing Local and Global Structure in Compressed AI Agent Memory

The paper introduces locality‑aware quantization (LAQ), a new compression technique for AI agent memory that preserves both local and global structure of embedded text. LAQ improves local fidelity (L) and, more importantly, raises global fidelity (G) across all tested runs, outperforming seven other quantizers while maintaining search efficiency and evidence recall. The method is validated on large‑scale datasets, including a million passages and external FinDER memory.

By Henry Han