<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Meta-Learning Neural Bloom Filters · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1906.04304/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1906.04304/feed.xml" rel="self" type="application/rss+xml" /><item><title>Meta-Learning Neural Bloom Filters — mentioned by ganzuul</title><link>https://news.ycombinator.com/item?id=21841915</link><guid isPermaLink="false">urn:hackerpapers:mention:1906.04304:21841915</guid><pubDate>Fri, 20 Dec 2019 05:26:52 GMT</pubDate><description>&lt;p&gt;Also of academic interest; Neural Bloom filter: https://arxiv.org/abs/1906.04304 Achives optimally 36% space saving compared to BL but needs an fp accelerator to achieve the same throughput. Compares to perfect hasing, which also does not suppprt insertions.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1906.04304/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LG</category></item></channel></rss>
