Research map / Learning theory and algorithms / Prediction and decision losses
Partitioned Learned Bloom Filters
Kapil Vaidya, Eric Knorr, Michael Mitzenmacher, Tim Kraska
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use optimized score partitions and region-specific backup-filter rates instead of sandwiching | Learned Bloom filter · Synthetic | space used at FPR 0.001: 8.8x | Improved |
| Use optimized score partitions and region-specific backup-filter rates instead of sandwiching | Learned Bloom filter · URLs | space used at FPR 0.001: 3.3x | Improved |
| Use optimized score partitions and region-specific backup-filter rates instead of sandwiching | Learned Bloom filter · EMBER | space used at FPR 0.001: 1.2x | Improved |
| Use optimized score partitions and region-specific backup-filter rates instead of AdaBF | Learned Bloom filter · Synthetic | space used at FPR 0.001: 6x | Improved |
| Use optimized score partitions and region-specific backup-filter rates instead of AdaBF | Learned Bloom filter · URLs | space used at FPR 0.001: 2.5x | Improved |
| Use optimized score partitions and region-specific backup-filter rates instead of AdaBF | Learned Bloom filter · EMBER | space used at FPR 0.001: 1.1x | Improved |
| Increase the number of score partitions (ablation) | PLBF · Synthetic, URLs, and EMBER | space saved versus optimal Bloom filter | Improved |
| Increase model quality (ablation) | Learned Bloom filter methods · Synthetic | space used at FPR 0.001 | Improved |
| Use KL divergence as the model-training loss instead of MSE (ablation) | PLBF model · Model quality experiment | space used | No clear effect |
Closest papers by meaning
- Ensemble Learned Bloom Filters: Two Oracles are Better than One (ICML 2025 · similarity 0.93)
- Optimal Algorithms for Learning Partitions with Faulty Oracles (NeurIPS 2024 · similarity 0.83)
- Theoretical Analysis of Learned Database Operations under Distribution Shift through Distribution Learnability (ICML 2024 · similarity 0.82)
- Accelerating data-driven algorithm selection for combinatorial partitioning problems (NeurIPS 2025 · similarity 0.82)
- Learning-Augmented Search Data Structures (ICLR 2025 · similarity 0.82)
- Mitigating Premature Exploitation in Particle-based Monte Carlo for Inference-Time Scaling (ICML 2026 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
