Skip to content
AI News HubLIVE
Source content · Analysis pending2 min read

Memory That Looks Forward: A Zero-Inference Prospective Term for Personal Memory Retrieval

Summary

arXiv:2609.22091v1 Announce Type: new Abstract: Retrieval over a personal memory store is retrospective: it surfaces what resembles the query, and it is blind to what the user has committed to do. We describe a prospective term for memory retrieval that costs no inference at query time. Commitments are held in an explicit ledger as dated or trigger-conditioned entries; memory items linked to a firing entry receive a salience boost, blended multiplicatively into embedding-based retrieval so that relevance remains sovereign. On a synthetic prospective-memory task set modeled on TriggerBench's published structure (48 blind-authored dialogues, 175 tasks), the term raised recall@5 on the hard stratum from 0.000 to 0.955 at the default blend weight and to 1.000 under a floor variant, with zero…

SourcearXiv Computational LinguisticsAuthor: Jonathan Groff
Memory That Looks Forward: A Zero-Inference Prospective Term for Personal Memory Retrieval
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 24 Jul 2026]

Title:Memory That Looks Forward: A Zero-Inference Prospective Term for Personal Memory Retrieval

View a PDF of the paper titled Memory That Looks Forward: A Zero-Inference Prospective Term for Personal Memory Retrieval, by Jonathan Groff

View PDF HTML (experimental)

Abstract:Retrieval over a personal memory store is retrospective: it surfaces what resembles the query, and it is blind to what the user has committed to do. We describe a prospective term for memory retrieval that costs no inference at query time. Commitments are held in an explicit ledger as dated or trigger-conditioned entries; memory items linked to a firing entry receive a salience boost, blended multiplicatively into embedding-based retrieval so that relevance remains sovereign. On a synthetic prospective-memory task set modeled on TriggerBench's published structure (48 blind-authored dialogues, 175 tasks), the term raised recall@5 on the hard stratum from 0.000 to 0.955 at the default blend weight and to 1.000 under a floor variant, with zero false boosts across 53 resolved-commitment tasks. Blind authorship also produced a scope finding: only 17-29% of naturally phrased commitment-trigger pairs defeat embedding similarity, so the term matters on a real minority of cases and must do no harm on the rest, which it does not. We position precomputed commitment linkage as the always-on floor of a layered design whose expansion layer is query-time prospection. Results are preliminary: the evaluation set is author-constructed, and evaluation on TriggerBench proper is committed follow-up work once its data is released.

Comments: 7 pages. Code and data: this https URL

Subjects:

Computation and Language (cs.CL)

Cite as: arXiv:2609.22091 [cs.CL]

(or arXiv:2609.22091v1 [cs.CL] for this version)

https://doi.org/10.48550/arXiv.2609.22091

arXiv-issued DOI via DataCite

Submission history

From: Jonathan Groff [view email] [v1] Fri, 24 Jul 2026 10:14:01 UTC (10 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Memory That Looks Forward: A Zero-Inference Prospective Term for Personal Memory Retrieval, by Jonathan Groff

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.CL

new | recent | 2026-09

Change to browse by:

cs

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

InvestorsAdvanced

Key points

  • AI generation is temporarily unavailable; this entry was preserved with deterministic fallback metadata.
  • arXiv:2609.22091v1 Announce Type: new Abstract: Retrieval over a personal memory store is retrospective: it surfaces what resembles the query, and it is blind to what the user has…

Highlights and analysis are generated automatically and may contain errors. Check the original source.