On Relaxing Determinism in Arithmetic Circuits
Authors: Arthur Choi, Adnan Darwiche
ICML 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | In this paper, we provide a formal basis under which variants on ACs can be compared, and where the precise roles and semantics of their various properties can be made more transparent. This allows us to place some recent developments on ACs in a clearer perspective and to also derive new results for ACs. This includes an exponential separation between ACs with and without determinism; completeness and incompleteness results; and tractability results (or lack thereof) when computing most probable explanations (MPEs). |
| Researcher Affiliation | Academia | 1University of California, Los Angeles, California, USA. Correspondence to: Arthur Choi <aychoi@cs.ucla.edu>, Adnan Darwiche <darwiche@cs.ucla.edu>. |
| Pseudocode | No | The paper does not contain structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide concrete access to source code for the methodology described in this paper. |
| Open Datasets | No | The paper focuses on theoretical contributions and does not use or provide information on publicly available or open datasets for training. |
| Dataset Splits | No | The paper is theoretical and does not report on experimental validation, thus no specific dataset split information is provided. |
| Hardware Specification | No | The paper is theoretical and does not report on computational experiments that would require specific hardware details. |
| Software Dependencies | No | The paper is theoretical and does not describe computational experiments or implementations that would require specific ancillary software details. |
| Experiment Setup | No | The paper focuses on theoretical contributions and does not provide specific experimental setup details. |