How does SPTAG solve the false-negative issue?
Open
Nobody has claimed this yet.
question
- Dominant language
- C++
- Stars
- 5k
- Forks
- 622
- Avg merge
- 8h 37m
- Merged PRs (30d)
- 5
Description
A well-documented drawback of LSH, in general, is the 'false-negative' issue, whereby you do not know truly whether all nearest neighbors were actually considered at query time.
Approaches to solving this in other libraries have made good headway - how does SPTAG handle this specific issue?
Contributor guide
No contributing guide indexed for this repository
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
The issue names no files, tests, or entry points. Start by locating SPTAG's documentation and approximate-nearest-neighbor search implementation, then trace how query-time candidate selection is described; the work is done when the repository explains how SPTAG handles possible false negatives.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- search
- Issue type
- Documentation
- Difficulty
- 4/5
- Estimated time
- 3-5 days
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100