Update MemAudit code card
Browse files- README.md +90 -80
- scripts/prepare_submission_artifacts.py +28 -0
README.md
CHANGED
|
@@ -1,80 +1,90 @@
|
|
| 1 |
-
|
| 2 |
-
|
| 3 |
-
MemAudit
|
| 4 |
-
|
| 5 |
-
|
| 6 |
-
|
| 7 |
-
|
| 8 |
-
|
| 9 |
-
|
| 10 |
-
|
| 11 |
-
|
| 12 |
-
|
| 13 |
-
MemAudit is
|
| 14 |
-
memory
|
| 15 |
-
|
| 16 |
-
|
| 17 |
-
|
| 18 |
-
|
| 19 |
-
|
| 20 |
-
|
| 21 |
-
|
| 22 |
-
|
| 23 |
-
|
| 24 |
-
|
| 25 |
-
|
| 26 |
-
|
| 27 |
-
|
| 28 |
-
|
| 29 |
-
|
| 30 |
-
|
| 31 |
-
|
| 32 |
-
|
| 33 |
-
|
| 34 |
-
|
| 35 |
-
-
|
| 36 |
-
|
| 37 |
-
|
| 38 |
-
|
| 39 |
-
|
| 40 |
-
|
| 41 |
-
|
| 42 |
-
|
| 43 |
-
- `oraclemem_runs/
|
| 44 |
-
- `oraclemem_runs/
|
| 45 |
-
- `
|
| 46 |
-
|
| 47 |
-
|
| 48 |
-
|
| 49 |
-
- `
|
| 50 |
-
- `
|
| 51 |
-
- `
|
| 52 |
-
- `
|
| 53 |
-
- `
|
| 54 |
-
- `
|
| 55 |
-
- `llm_memory_validation/
|
| 56 |
-
- `llm_memory_validation/natural_adjudicated_100_gemini_flash
|
| 57 |
-
- `llm_memory_validation/
|
| 58 |
-
|
| 59 |
-
|
| 60 |
-
|
| 61 |
-
|
| 62 |
-
|
| 63 |
-
|
| 64 |
-
|
| 65 |
-
-
|
| 66 |
-
-
|
| 67 |
-
-
|
| 68 |
-
|
| 69 |
-
|
| 70 |
-
|
| 71 |
-
|
| 72 |
-
|
| 73 |
-
|
| 74 |
-
|
| 75 |
-
|
| 76 |
-
|
| 77 |
-
|
| 78 |
-
|
| 79 |
-
|
| 80 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: mit
|
| 3 |
+
pretty_name: MemAudit Code Artifact
|
| 4 |
+
tags:
|
| 5 |
+
- llm-memory
|
| 6 |
+
- benchmark
|
| 7 |
+
- evaluation
|
| 8 |
+
- reproducibility
|
| 9 |
+
---
|
| 10 |
+
|
| 11 |
+
# MemAudit
|
| 12 |
+
|
| 13 |
+
MemAudit is an exact-oracle evaluation protocol for budgeted long-term LLM
|
| 14 |
+
memory writing. The core question is finite and package-conditional:
|
| 15 |
+
|
| 16 |
+
> Given a fixed storage budget and a finite semantic evidence package, how close
|
| 17 |
+
> is a written memory store to the best package-feasible store?
|
| 18 |
+
|
| 19 |
+
This repository contains the manuscript, exact-small synthetic benchmarks,
|
| 20 |
+
validity-heavy stress benchmarks, natural support-sliced coverage packages,
|
| 21 |
+
Mem0 diagnostic rescoring artifacts, and reproducibility scripts.
|
| 22 |
+
|
| 23 |
+
MemAudit is not a runtime memory product. It is an evaluation layer for
|
| 24 |
+
memory writers: it scores finite candidate packages, budgeted representation
|
| 25 |
+
choices, and external written stores against explicit denominators.
|
| 26 |
+
|
| 27 |
+
## Quickcheck
|
| 28 |
+
|
| 29 |
+
Run the deterministic tests:
|
| 30 |
+
|
| 31 |
+
```powershell
|
| 32 |
+
python -m unittest test_oraclemem.py
|
| 33 |
+
```
|
| 34 |
+
|
| 35 |
+
Run a tiny exact-oracle smoke benchmark:
|
| 36 |
+
|
| 37 |
+
```powershell
|
| 38 |
+
python run_oraclemem_mvp.py --n-seeds 3 --budgets 4 --distribution base --methods opt,oracle_gvt,density_only --out-dir oraclemem_runs/quickcheck
|
| 39 |
+
```
|
| 40 |
+
|
| 41 |
+
Expected smoke outputs:
|
| 42 |
+
|
| 43 |
+
- `oraclemem_runs/quickcheck/raw_results.jsonl`
|
| 44 |
+
- `oraclemem_runs/quickcheck/summary.json`
|
| 45 |
+
- `oraclemem_runs/quickcheck/summary.md`
|
| 46 |
+
|
| 47 |
+
## Main Artifacts
|
| 48 |
+
|
| 49 |
+
- `main.tex`: active manuscript.
|
| 50 |
+
- `references.bib`: bibliography.
|
| 51 |
+
- `figures/`: paper figure assets generated from cached experiment summaries.
|
| 52 |
+
- `oraclemem_runs/exact_500`: exact-small 500-instance sweep.
|
| 53 |
+
- `oraclemem_runs/stress_exact_500`: validity-heavy stress sweep.
|
| 54 |
+
- `oraclemem_runs/representative_writers_500`: non-oracle writer diagnostic sweep with Estimated-GVT and A-MAC-like admission.
|
| 55 |
+
- `llm_memory_validation/oraclemem_natural_200_gemini_v2`: Natural-200 support-sliced coverage package.
|
| 56 |
+
- `llm_memory_validation/natural_adjudicated_100_gemini_flash`: stricter adjudicated natural subset.
|
| 57 |
+
- `llm_memory_validation/natural_spotcheck_30_gemini31_flash_lite`: independent Gemini Flash-Lite adjudication spot-check.
|
| 58 |
+
- `llm_memory_validation/human_style_examples`: 100 fictional human-edited/audited natural examples, exported coverage package, exact package evaluation, and actual A-Mem run.
|
| 59 |
+
- `llm_memory_validation/human_style_examples/learned_writer_transfer`: coverage-blind learned writer transfer diagnostic trained on synthetic plus Natural-200 labels and tested on the human-edited package.
|
| 60 |
+
- `llm_memory_validation/human_style_examples/learned_writer_transfer_synth_only` and `llm_memory_validation/human_style_examples/learned_writer_transfer_natural_only`: training-source ablations for the learned writer transfer diagnostic.
|
| 61 |
+
- `llm_memory_validation/human_style_examples/writer_adapters`: denominator-matched Letta/MemGPT-style, A-Mem-style, Mem0-style, and A-MAC-style adapter diagnostics on the exported human-edited coverage package.
|
| 62 |
+
- `llm_memory_validation/natural_adjudicated_100_gemini_flash/writer_adapters`: denominator-matched Letta/MemGPT-style and A-Mem-style adapter diagnostics on the adjudicated natural package.
|
| 63 |
+
- `llm_memory_validation/natural_adjudicated_100_gemini_flash/faithful_memgpt_letta_union`: no-API faithful MemGPT/Letta core/archival baseline scored with a package-plus-written-store union denominator.
|
| 64 |
+
- `llm_memory_validation/natural_adjudicated_100_gemini_flash/actual_letta_openrouter_gemini_passage_87`: executable Letta server run on 87 adjudicated examples with OpenRouter Gemini, authenticated OpenRouter passage embeddings, archival-memory tools, and the union denominator.
|
| 65 |
+
- `llm_memory_validation/mem0_rescore_adjudicated100_gemini_flash`: Mem0 diagnostic rescoring on the adjudicated subset.
|
| 66 |
+
- `llm_memory_validation/natural_adjudicated_100_gemini_flash/actual_amem_gemini_flash_87`: executable public A-Mem run on 87 adjudicated examples using Gemini Flash and the union denominator.
|
| 67 |
+
- `llm_memory_validation/human_style_examples/actual_amem_gemini_flash_100`: executable public A-Mem run on the human-edited package using Gemini Flash and the union denominator.
|
| 68 |
+
|
| 69 |
+
See `artifact_manifest.md` for table-to-artifact mapping and full rerun
|
| 70 |
+
commands. See `REPRODUCIBILITY.md` for setup, exact-oracle runs, API runs, and
|
| 71 |
+
known local build limitations.
|
| 72 |
+
|
| 73 |
+
## Denominator Types
|
| 74 |
+
|
| 75 |
+
- Package ratio: exact ratio to `OPT_P(B)` for a finite MemAudit candidate package.
|
| 76 |
+
- Union ratio: exact ratio to `OPT_{P^+(Y)}(B)` after adding an external written store to the candidate package.
|
| 77 |
+
- Upper-pruned bound: best budget-feasible subset of an external store, used only to separate extraction quality from budget-aware selection.
|
| 78 |
+
- Retrieval/reader metrics: downstream diagnostics, not MemAudit optimum ratios.
|
| 79 |
+
|
| 80 |
+
## Caveats
|
| 81 |
+
|
| 82 |
+
The strongest exact claims are finite-package claims. LongMemEval-derived
|
| 83 |
+
natural coverage packages are model-adjudicated; the separate
|
| 84 |
+
`human_style_examples` package is human-edited/audited but does not include an
|
| 85 |
+
inter-annotator agreement file. LongMemEval reader/retrieval results
|
| 86 |
+
are downstream diagnostics and do not have exact OPT denominators. Mem0 and
|
| 87 |
+
A-Mem rescoring use union-denominator and upper-pruned-bound diagnostics rather
|
| 88 |
+
than claiming deployable optimal pruning policies.
|
| 89 |
+
|
| 90 |
+
Do not commit API keys. `api.env` is local-only and should stay ignored.
|
scripts/prepare_submission_artifacts.py
CHANGED
|
@@ -152,7 +152,35 @@ def write_readmes() -> None:
|
|
| 152 |
"SOFTWARE.\n",
|
| 153 |
encoding="utf-8",
|
| 154 |
)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 155 |
(DATASET / "README.md").write_text(
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 156 |
"# MemAudit Dataset Artifact\n\n"
|
| 157 |
"This dataset contains finite memory-writing packages, exact/verified solver outputs, "
|
| 158 |
"model-adjudicated natural support-slice packages, human-edited fictional seed packages, "
|
|
|
|
| 152 |
"SOFTWARE.\n",
|
| 153 |
encoding="utf-8",
|
| 154 |
)
|
| 155 |
+
code_readme = (CODE / "README.md").read_text(encoding="utf-8")
|
| 156 |
+
if code_readme.startswith("---"):
|
| 157 |
+
code_readme = code_readme.split("---", 2)[2].lstrip()
|
| 158 |
+
(CODE / "README.md").write_text(
|
| 159 |
+
"---\n"
|
| 160 |
+
"license: mit\n"
|
| 161 |
+
"pretty_name: MemAudit Code Artifact\n"
|
| 162 |
+
"tags:\n"
|
| 163 |
+
"- llm-memory\n"
|
| 164 |
+
"- benchmark\n"
|
| 165 |
+
"- evaluation\n"
|
| 166 |
+
"- reproducibility\n"
|
| 167 |
+
"---\n\n"
|
| 168 |
+
+ code_readme,
|
| 169 |
+
encoding="utf-8",
|
| 170 |
+
)
|
| 171 |
(DATASET / "README.md").write_text(
|
| 172 |
+
"---\n"
|
| 173 |
+
"license: cc-by-4.0\n"
|
| 174 |
+
"pretty_name: MemAudit Benchmark Artifacts\n"
|
| 175 |
+
"task_categories:\n"
|
| 176 |
+
"- question-answering\n"
|
| 177 |
+
"- text-retrieval\n"
|
| 178 |
+
"tags:\n"
|
| 179 |
+
"- llm-memory\n"
|
| 180 |
+
"- benchmark\n"
|
| 181 |
+
"- evaluation\n"
|
| 182 |
+
"- croissant\n"
|
| 183 |
+
"---\n\n"
|
| 184 |
"# MemAudit Dataset Artifact\n\n"
|
| 185 |
"This dataset contains finite memory-writing packages, exact/verified solver outputs, "
|
| 186 |
"model-adjudicated natural support-slice packages, human-edited fictional seed packages, "
|