FlyHash, a fruit-fly-inspired locality-sensitive hashing method, improves neighbor-structure preservation over SimHash for large language model agent memory retrieval under matched-bit protocols and genuine relevance labels, but it does not provide practical memory or latency advantages over…
Large language model (LLM) agents increasingly rely on external memory stores to retain information across conversations, typically via dense vector embeddings searched with approximate nearest-neighbor methods. The fruit fly's olfactory circuit computes a locality-sensitive hash of sensory input using a strikingly different mechanism - sparse random projection followed by winner-take-all competition - and prior work (Dasgupta et al., 2017) showed this scheme, dubbed FlyHash, preserves neighbor structure better per bit than conventional random-hyperplane hashing (SimHash) on several benchmarks. We apply FlyHash, to our knowledge for the first time, to LLM agent memory retrieval, and ask…
large language model agentsexternal memory storesdense vector embeddingsapproximate nearest-neighborlocality-sensitive hashingsparse random projectionwinner-take-all competitionFlyHashSimHashrandom-hyperplane hashing
- Upvotes
- 4
- Authors
- 2
- Published
- Nov 4, 2026
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.