AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

A Model for Learned Bloom Filters and Optimizing by Sandwiching

Michael Mitzenmacher

NeurIPS 2018 · Learning theory and algorithms › Prediction and decision losses · approach: Active learning and subset selection · 58 citations (OpenAlex)

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 changedWhereMeasuredEffect
Add an initial Bloom filter before the learned function and backup filter (ablation)Learned Bloom filter · Sandwiched example, b = 8 bits per keyfalse positive rate: approximately 0.010045 -> 0.005012Improved
Add an initial Bloom filter before the learned function and backup filter (ablation)Learned Bloom filter · Sandwiched example, b = 10 bits per keyfalse positive rate: 0.010066 -> 0.001917Improved
Use queries uniform over [0,100000) rather than [0,1000000)Learned Bloom filter · Illustrative query-distribution examplefalse positive rate: 0.0004 -> 0.0022Hurt
Use a learned function with 3 bits per item and a backup filter holding the false negativesStandard Bloom filter · Modeled example, 1 byte per itemfalse positive rate: approximately 0.0214 -> approximately 0.0181Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy