Skip to main content
Search

# Memory Retrieval

6 related articles

Subscribe to updates
  1. arXiv

    Word-recall pauses now carry their place in the semantic hierarchy: TrajLift reaches 80.38% accuracy on 30-minute delayed recall

    In verbal memory tests, the order of recalled words and the pauses between them carry diagnostic information, but a pause means different things inside a semantic category and at a switch between categories. TrajLift treats a recall episode as a timed trajectory on a semantic hierarchy, uses heat diffusion to lift each word onto several hierarchical scales, and lets the inter-item latency modulate the diffusion time so structure and timing enter one operator. On Hong Kong List Learning Test data from 387 participants after excluding 15 with annotation issues, accuracy on the 30-minute delayed-recall trial was 80.38%, 4.5 percentage points above a handcrafted baseline using recall count alone; the paired difference on the 10-minute trial was not significant.

  2. arXiv

    Memory retrieval stops reading only whole-sentence vectors: reusing a frozen encoder's token states lifts Qwen3-4B average Recall@10 from 62.5 to 75.7

    Memory retrieval no longer compares only whole-memory vectors: sparse matching over token states a frozen encoder already computes, fused with whole-memory similarity, raises average Recall@10 on Qwen3-Embedding-4B from 62.5 to 75.7 without additional training.

  3. arXiv

    BRACE gives LSR dense associative memory differentially private retrieval, cutting MNIST prediction error from 0.061 to 0.011

    The authors propose BRACE, the first differentially private retrieval mechanism for log-sum-ReLU dense associative memory (LSR-DAM): it identifies memory points whose membership changes under privacy noise and applies an adaptive boundary correction before injecting calibrated noise, controlling error accumulation from boundary switching in compact-support retrieval. They prove minimax-optimal terminal and full-trajectory retrieval error rates and establish trajectory central limit theorems characterizing privacy-induced variability; synthetic experiments show a tiny perturbation changes 11 gate memberships, and MNIST retrieval reduces prediction MSE from 0.061 for the corrupted input to 0.011, nearly matching noiseless retrieval.

  4. arXiv

    Long-conversation memory stops searching everything: an agent drills down on demand and reasons over just 8% of dialogues

    Personalized assistants must recover sparse evidence from long conversation histories, while queries vary widely in complexity. APDMem organizes history into four layers, from thematic summaries and personalized key facts down to turn-level evidence notes and raw messages, and a controller reads high-level summaries first, drilling into finer evidence only when needed. On LongMemEval it achieves strong long-context memory reasoning while accessing only 8% of the total conversations.

  5. arXiv

    Memorizon trains world models on arbitrarily long spans at fixed sequence length, leading five of eight memory columns

    Memorizon proposes a training recipe in which each scored chunk retrieves its own top-k latents by camera co-visibility and their union forms a bounded shared memory bank, so a training sample can cover a span of any length while the attention sequence stays bounded; revisit consistency improves on every split over a sliding-window baseline, and a span long enough to reach the first visit adds further gains at some cost in image quality.

  6. arXiv

    Jev-Mem puts a System-One control plane over agentic memory, lifting LoCoMo overall score to 0.777 while cutting memory build time to 158 seconds

    Jev-Mem introduces an agentic memory architecture inspired by System-One/System-Two cognition, in which a dedicated System-One control plane handles memory typing, relation construction, query routing, retrieval-budget allocation, graph traversal, candidate scoring, and adaptive stopping, while System Two is reserved for complex reasoning and answer synthesis; on LoCoMo it reaches an overall LLM-as-a-Judge score of 0.777 (an 11.0% relative gain over the strongest baseline), a memory construction time of 158 seconds (a 6.6 speedup over the fastest competing memory system), and an average query latency of 0.93 seconds (a 36.7% reduction).

You’re all caught up