AI Paper Atlas

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

ICML 2016 · Probabilistic and scientific modeling › Variational and generative sampling · approach: Exact inference for probabilistic programs · 8 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
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · LS10 model countingavg time per instance (s): 209 -> 1Improved
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · LS11 model countingavg time per instance (s): 623 -> 28Improved
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · LS15 model countingavg time per instance (s): 829 -> 51Improved
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · 23RDR45 model countingavg time per instance (s): 800 -> 7Improved
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · VDAGRRCSW9 model countingavg time per instance (s): 151 -> 32Improved
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · 23RDR45 model countinglog10 lower bound: 10 -> 27Improved
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · LS9 model countinglog10 lower bound: 16 -> 13Hurt
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · APEX75 model countinglog10 lower bound: 59 -> 40Hurt
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · VDAGRRCSW9 model countinglog10 lower bound: 99 -> 70Hurt
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · LS11 model countinglog10 lower bound: 24 -> 25No clear effect
Replace sparse parity constraints with TRIBES hash functionsTHF-WISH-LB · LANG23 model countingavg time per instance (s): 1 -> 1No clear effect
Replace sparse-XOR hashing with MAJORITY hashing in WISHMAJORITY-WISH · Grid Ising partition functionavg MAP query time (s): 30 -> 1.2Improved

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