Implement SimHash LSH and measure recall
CodingAdvanced⏱ 3 hoursRAGlshimplementationrecalltradeoff
Problem
Implement SimHash with AND/OR amplification and measure the recall–speed trade-off.
- Verify empirically that the bit-disagreement rate estimates .
- Sweep and plot recall against candidates examined.
- Compare with brute force and with a simple IVF baseline.
- Demonstrate the effect of anisotropic data on the achieved recall.
Implement it, then check the implementation against something you can verify independently.
Write it
Solve it here5 tests · Python runs in your browser
⌘/Ctrl + ↵ to run · limit 45s · draft saved in this browser
5 tests will run against your code. The first run downloads the Python runtime — several megabytes, once per browser.
Solution
Opening this before you have a real attempt on paper is the fastest way to feel like you understand something you cannot reproduce.
Related problems
All problems| Solved | Problem | Field | Type | Difficulty | Time |
|---|---|---|---|---|---|
| End-to-end recall arithmetic for a RAG system | RAG | Numerical | 15 min | ||
| Product quantisation budget arithmetic | RAG | Numerical | 30 min | ||
| Recall composes multiplicatively | RAG | Numerical | 15 min | ||
| Implement backpropagation from scratch run | Deep Learning | Coding | 3 hours | ||
| Implement kernel ridge regression run | Classical ML | Coding | 1 hour |