Low-density Parity Constraints for Hashing-Based Discrete Integration
Authors: Stefano Ermon, Carla Gomes, Ashish Sabharwal, Bart Selman
ICML 2014 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We evaluate SPARSE-WISH using the Integer Linear Programming (ILP) formulation from Ermon et al. (2013a) to solve the MAP inference instances in the inner loop of the algorithm. We use the Integer Programming solver CPLEX with a timeout of 10 minutes on Intel Xeon 5670 3GHz machines with 48GB RAM, obtaining at the end a lower bound and, by solving a sequence of LP relaxations, an upper bound on the optimization instances. |
| Researcher Affiliation | Collaboration | Stefano Ermon ERMONSTE@CS.CORNELL.EDU Carla P. Gomes GOMES@CS.CORNELL.EDU Dept. of Computer Science, Cornell University, Ithaca NY 14853, U.S.A. Ashish Sabharwal ASHISH.SABHARWAL@US.IBM.COM IBM Watson Research Center, Yorktown Heights, NY 10598, U.S.A. Bart Selman SELMAN@CS.CORNELL.EDU Dept. of Computer Science, Cornell University, Ithaca NY 14853, U.S.A. |
| Pseudocode | Yes | Algorithm 1 SPARSE-WISH (w, n = log2 |X|, , α) |
| Open Source Code | No | The paper does not provide any explicit statements or links indicating that the source code for the methodology is available. |
| Open Datasets | No | The paper refers to 'M M grid Ising models' and uses 'Lib DAI library (Mooij, 2010)' and 'Junction Trees (Lauritzen & Spiegelhalter, 1988)' for ground truth, but does not provide concrete access information (link, DOI, specific repository, or formal citation with author/year for the dataset itself) for a publicly available dataset. |
| Dataset Splits | No | The paper does not provide specific dataset split information (exact percentages, sample counts, citations to predefined splits, or detailed splitting methodology) needed to reproduce the data partitioning. |
| Hardware Specification | Yes | We use the Integer Programming solver CPLEX with a timeout of 10 minutes on Intel Xeon 5670 3GHz machines with 48GB RAM |
| Software Dependencies | No | The paper mentions using 'CPLEX' and 'Lib DAI library (Mooij, 2010)' but does not provide specific version numbers for these software dependencies. |
| Experiment Setup | Yes | We use the Integer Programming solver CPLEX with a timeout of 10 minutes on Intel Xeon 5670 3GHz machines with 48GB RAM, obtaining at the end a lower bound and, by solving a sequence of LP relaxations, an upper bound on the optimization instances. We evaluate these bounds on M M grid Ising models for M {10, 15}. The external field is f {0.1, 1.0}. We use the implementations in the Lib DAI library (Mooij, 2010), allowing 1000 random restarts for Mean Field. |