Memory decay retrieval scoring
Open
Nobody has claimed this yet.
memory
- Dominant language
- TypeScript
- Stars
- 7
- Forks
- 3
- PR merge metrics
- No merged PRs in 30d
Description
Implement
$$S = R \times I \times e^{-\lambda t}$$
on top of the existing vector archive.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start by reading the existing vector archive and tracing how retrieval scores are currently calculated. Clarify what R, I, λ, and t represent in this project, then implement the decay-adjusted scoring so archived results are ranked by the stated formula. Done means retrieval consistently applies the formula on top of the existing archive.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- typescript
- Domain
- ai
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 45/100