Entropy-Punctured Bloom Filters for Memory-Efficient Machine Learning

arXiv:2609.14187 · cs.LG, cs.AI · Submitted 2026-09-12 · Read on arXiv

cs.LG, cs.AI

Submitted: 2026-09-12

Updated: 2026-09-12

Comments: Accepted for publication in the Proceedings of the 38th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2026). 9 pages, 7 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Bloom Filter — 6× in this paper
• Fidelity — 1× in this paper · explained in 2 episodes
• Principal Component Analysis (PCA) — 1× in this paper · explained in 4 episodes

Related papers

• Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
• AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
• Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
• Convergence issues in Relational Concept Analysis based on AOC-posets
• Beliefs Beyond Posteriors: Local-Consistency Optimisation for Bayesian Neural Networks
• Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks