atlas

Research map / Large language models / Agents, code and math

MemSim: A Bayesian Simulator for Evaluating Memory of LLM-based Personal Assistants

NeurIPS 2025 · Large language models › Agents, code and math · approach: Long-horizon LLM agents · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes MemSim, a Bayesian-network-based simulator that generates user profiles, messages and verified QAs for evaluating memory of LLM personal assistants, releasing the MemDaily dataset and a memory-mechanism benchmark.

Problem

Objective, automatic evaluation of how well LLM-based personal assistants memorize and use factual information from user messages is lacking, because LLM-generated QAs are unreliable (hallucination), lack diversity, and do not scale.

Approach

A Bayesian Relation Network (causal DAG over entity attributes) is sampled via ancestral sampling to produce diverse hierarchical user profiles; shared structured hints then causally drive both user messages and QAs, so the LLM only rewrites facts rather than inventing them, keeping ground truths reliable.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use BRNet to generate hierarchical user profilesMemSim user-profile generation · User profilesR-Human: 3.02±1.14 -> 4.91±0.30Helped
Use BRNet-based profiles rather than profile-generation baselinesMemSim user-profile generation · User profilesSWI-A: 0.943 -> 3.050Helped
Apply MemSim's constrained, hint-grounded message generationUser-message generation · User messagesSWIP: 5.868 -> 6.125Helped
Generate messages and QAs causally from shared factual hintsMemSim QA construction · MemDaily averageTextual answer accuracy: nullHelped
Use shared-hint QA construction instead of direct LLM answer generationMemDaily QA construction · Constructed questions and answersGround-truth reliabilityHelped
Add full profile-attribute constraints without forcing their generationUser-message generation · User messagesInformativeness: 4.01±1.18 -> 4.37±0.98Helped
Use FullMem rather than Retrieved MemoryGLM-4-9B memory benchmark · MemDaily-vanilla Simp.Accuracy: 0.898±0.048 -> 0.976±0.022Helped
Use FullMem rather than Retrieved MemoryGLM-4-9B memory benchmark · MemDaily-100 Simp.Accuracy: 0.892±0.034 -> 0.962±0.017Helped
Use embedding retrieval rather than LLM retrievalTarget-message retrieval · MemDaily-100 Comp.Recall@5: 0.683±0.036 -> 0.778±0.048Helped
Use LLM retrieval rather than embedding retrievalTarget-message retrieval · MemDaily-vanilla Comp.Recall@5: 0.845±0.022 -> 0.947±0.018Helped
Use FullMem rather than NonMemGLM-4-9B memory benchmark · MemDaily-100 Simp.Response time: 0.119±0.001 -> 1.632±0.097Hurt
Use Retrieved Memory with FAISS indexing rather than memory methods that do not build indexesGLM-4-9B memory benchmark · MemDaily-vanilla Simp.Adaptation time: < 0.001 -> 0.222±0.009Hurt

Surprising findings

Limitations

Experimental setup

Datasets: MemDaily

Benchmarks: MemDaily-vanilla MemDaily-10 MemDaily-50 MemDaily-100 MemDaily-200

Metrics: accuracy Recall@5 response time adaptation time R-Human R-GPT SWI F-Human N-Human I-Human

Baselines: FullMem RetrMem ReceMem NonMem NoisyMem OracleMem JointPL SeqPL IndePL ZeroCons PartCons SoftCons

Builds on: MemoryBank Kahn's algorithm FAISS

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy