Research map / Probabilistic and scientific modeling / Variational and generative sampling
Beyond Parity Constraints: Fourier Analysis of Hash Functions for Inference
Tudor Achim, Ashish Sabharwal, Stefano Ermon
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 |
|---|---|---|---|
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · LS10 model counting | avg time per instance (s): 209 -> 1 | Improved |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · LS11 model counting | avg time per instance (s): 623 -> 28 | Improved |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · LS15 model counting | avg time per instance (s): 829 -> 51 | Improved |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · 23RDR45 model counting | avg time per instance (s): 800 -> 7 | Improved |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · VDAGRRCSW9 model counting | avg time per instance (s): 151 -> 32 | Improved |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · 23RDR45 model counting | log10 lower bound: 10 -> 27 | Improved |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · LS9 model counting | log10 lower bound: 16 -> 13 | Hurt |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · APEX75 model counting | log10 lower bound: 59 -> 40 | Hurt |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · VDAGRRCSW9 model counting | log10 lower bound: 99 -> 70 | Hurt |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · LS11 model counting | log10 lower bound: 24 -> 25 | No clear effect |
| Replace sparse parity constraints with TRIBES hash functions | THF-WISH-LB · LANG23 model counting | avg time per instance (s): 1 -> 1 | No clear effect |
| Replace sparse-XOR hashing with MAJORITY hashing in WISH | MAJORITY-WISH · Grid Ising partition function | avg MAP query time (s): 30 -> 1.2 | Improved |
Closest papers by meaning
- Approximate Probabilistic Inference via Word-Level Counting (AAAI 2016 · similarity 0.88)
- Fully Understanding The Hashing Trick (NeurIPS 2018 · similarity 0.85)
- Variable Elimination in the Fourier Domain (ICML 2016 · similarity 0.85)
- An Approximate Skolem Function Counter (AAAI 2024 · similarity 0.84)
- Locality Sensitive Hashing for p-Exponential Kernels with Applications to Density Estimation (NeurIPS 2026 · similarity 0.84)
- MaxSketch: Robust Distinct Counting in Streams via Random Projections (NeurIPS 2026 · similarity 0.83)
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.
