paper-with-me

Papers

DiBS: Differentiable Bayesian Structure Learning

2021-05-25 · NeurIPS 2021 12 · Lars Lorch, Jonas Rothfuss, Bernhard Schölkopf, Andreas Krause

Bayesian structure learning allows inferring Bayesian network structure from data while reasoning about the epistemic uncertainty -- a key element towards enabling active causal discovery and designing interventions in real world systems. In this work, we propose a general, fully differentiable framework for Bayesian structure learning (DiBS) that operates in the continuous space of a latent probabilistic graph representation. Contrary to existing work, DiBS is agnostic to the form of the local conditional distributions and allows for joint posterior inference of both the graph structure and the conditional distribution parameters. This makes our formulation directly applicable to posterior inference of complex Bayesian network models, e.g., with nonlinear dependencies encoded by neural networks. Using DiBS, we devise an efficient, general purpose variational inference method for approximating distributions over structural models. In evaluations on simulated and real-world data, our method significantly outperforms related approaches to joint posterior inference.

📄 PDF Abstract BibTeX arXiv:2105.11839

Code (2)

larslorch/dibs 공식 구현 jax
yannadani/cbed jax

Tasks

Causal DiscoveryVariational Inference

Methods 이 논문이 사용한 방법론

Variational Inference 설명 없음

Similar Papers 제목 키워드 기반

Incorporating Expert Knowledge into Bayesian Causal Discovery of Mixtures of Directed Acyclic Graphs

2025-10-08 · Zachris Björkman, Jorge Loría, Sophie Wharrie, Samuel Kaski arxiv

Bayesian causal discovery benefits from prior information elicited from domain experts, and in heterogeneous domains any prior knowledge would be badly needed. However, so far prior elicitation approaches have assumed a …

Monotonic Transformation Invariant Multi-task Learning

2025-09-28 · Surya Murthy, Kushagra Gupta, Mustafa O. Karabag, David Fridovich-Keil 외 arxiv

Multi-task learning (MTL) algorithms typically rely on schemes that combine different task losses or their gradients through weighted averaging. These methods aim to find Pareto stationary points by using heuristics that…

Multi-Task Learning

DiBS: Diffusion-Informed Branch Selection

2026-06-02 · Bo Liu, Yuan Xie, Yuan Gao, Xiaolong Luo 외 arxiv

Sudoku is a representative constraint satisfaction problem that requires global structural reasoning under strict discrete constraints. The existing works of solving Sudoku mainly focus on two dominant approaches, i.e., …

Dual Diffusion Implicit Bridges for Image-to-Image Translation

2022-03-16 · Xuan Su, Jiaming Song, Chenlin Meng, Stefano Ermon

Common image-to-image translation methods rely on joint training over data from both source and target domains. The training process requires concurrent access to both datasets, which hinders data separation and privacy …

Image-to-Image TranslationTranslation

Decoupled Behavioral Cloning for Scalable Inductive Generalization in RL from Specifications

2026-05-30 · Vignesh Subramanian, Subhajit Roy, Suguman Bansal arxiv

Inductive generalization is a framework for reinforcement learning (RL) generalization in which inductively related task instances admit inductively related policies. Prior work captures this structure via a higher-order…

Zero-shot GeneralizationReinforcement Learning