mlsanityData to 14 Oct 2026

On Relaxing Determinism in Arithmetic Circuits

arXiv 1708.06846 ↗First posted 22 Aug 2017cs.AI cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

The past decade has seen a significant interest in learning tractable probabilistic representations. Arithmetic circuits (ACs) were among the first proposed tractable representations, with some subsequent representations being instances of ACs with weaker or stronger properties. 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).

Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). First posted on arXiv 22 Aug 2017.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 3; 2022: 4; 2023: 1; 2024: 4; 2025: 2.

14 papers.

Sort:

By area: