AI Paper Atlas

Research map / Learning theory and algorithms / Sample complexity

Closing the Gap Between Short and Long XORs for Model Counting

Shengjia Zhao, Sorathan Chaturapruek, Ashish Sabharwal, Stefano Ermon

AAAI 2016 · Learning theory and algorithms › Sample complexity · approach: Computational thresholds in graphs and structure · 21 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
use short parity constraints (small f) for upper bounds instead of provable minimum f*Sparse XOR bounds · Darwin's Fincheslower bound log2: f=0.03 vs f*=0.18; LB 53 vs true 55.90Improved
compute new sparse-XOR upper bound instead of trivial boundcontingency tables · Darwin's Finchesupper bound log2: 204 -> 150Improved
compute new sparse-XOR upper bound instead of trivial boundcontingency tables · iqdupper bound log2: 76 -> 17Improved
compute new sparse-XOR upper bound instead of trivial boundcontingency tables · synth_20upper bound log2: 400 -> 14Improved
use sparse XOR bounds (one solution per iteration) instead of ApproxMC long XORsmodel counting · ANOR2011 runtimeruntime (s): 3800 -> 43571 (UB f=0.5 vs ApproxMC) on wff.3.150.525Improved
reduce constraint density f from 0.5 to small values (ablation)Sparse XOR bounds · Langford12upper bound tightnessHurt
reduce constraint density f (ablation)Sparse XOR lower bound · Langford12lower boundNo clear effect
use long XORs (f=0.5) via ApproxMC on hard instancesApproxMC · lang15, ls8, wff.3.100.150, wff.4.100.500, 2bitmax-6completionHurt

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