Smoothing Structured Decomposable Circuits

Abstract : We study the task of smoothing a circuit, i.e., ensuring that all children of a plus-gate mention the same variables. Circuits serve as the building blocks of state-of-the-art inference algorithms on discrete probabilistic graphical models and probabilistic programs. They are also important for discrete density estimation algorithms. Many of these tasks require the input circuit to be smooth. However, smoothing has not been studied in its own right yet, and only a trivial quadratic algorithm is known. This paper studies efficient smoothing for structured decomposable circuits. We propose a near-linear time algorithm for this task and explore lower bounds for smoothing decomposable circuits, using existing results on range-sum queries. Further, for the important case of All-Marginals, we show a more efficient linear-time algorithm. We validate experimentally the performance of our methods.
Complete list of metadatas

https://hal.telecom-paristech.fr/hal-02338336
Contributor : Antoine Amarilli <>
Submitted on : Tuesday, October 29, 2019 - 10:41:38 PM
Last modification on : Wednesday, October 30, 2019 - 1:37:32 AM

Links full text

Identifiers

  • HAL Id : hal-02338336, version 1
  • ARXIV : 1906.00311

Citation

Andy Shih, Guy van Den Broeck, Paul Beame, Antoine Amarilli. Smoothing Structured Decomposable Circuits. NeurIPS 2019, Dec 2019, Vancouver, Canada. ⟨hal-02338336⟩

Share

Metrics

Record views

11