[FEA]Bitwise Hamming for Brute Force
Nobody has claimed this yet.
- Dominant language
- Cuda
- Stars
- 854
- Forks
- 236
- Avg merge
- 3d 3h
- Merged PRs (30d)
- 62
Description
Is your feature request related to a problem? Please describe.
I wish there was bitwise hamming for brute force so that we can see recall drop of binary quantization. With this feature, we can also compare between how CAGRA performs on binary quantization and how bfknn performs.
Describe the solution you'd like
Bitwise hamming for brute force for binary quantization
Describe alternatives you've considered
Additional context
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
No files or tests are named. Start by locating the brute-force (bfknn) and binary-quantization entry points, then compare their existing distance options with CAGRA; done means bitwise Hamming is available for brute-force binary quantization and supports the requested recall comparison.
Written by the indexing model from the issue text.
Assessment
- Domain
- machine-learning, search
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100