English
Related papers

Related papers: Algorithms and Complexity Results for Exact Bayesi…

200 papers

Structured sparsity has recently emerged in statistics, machine learning and signal processing as a promising paradigm for learning in high-dimensional settings. All existing methods for learning under the assumption of structured sparsity…

Machine Learning · Statistics 2015-09-16 Nino Shervashidze , Francis Bach

In this paper, we study the information-theoretic limits of learning the structure of Bayesian networks (BNs), on discrete as well as continuous random variables, from a finite number of samples. We show that the minimum number of samples…

Machine Learning · Computer Science 2019-05-28 Asish Ghoshal , Jean Honorio

A Bayesian Network (BN) is a probabilistic model that represents a set of variables using a directed acyclic graph (DAG). Current algorithms for learning BN structures from data focus on estimating the edges of a specific DAG, and often…

Combinatorics · Mathematics 2022-10-17 Luke Duttweiler , Sally W. Thurston , Anthony Almudevar

The continuous-time Bayesian networks (CTBNs) represent a class of stochastic processes, which can be used to model complex phenomena, for instance, they can describe interactions occurring in living processes, in social science models or…

Machine Learning · Statistics 2020-06-16 Maryia Shpak , Błażej Miasojedow , Wojciech Rejchel

We consider a Bayesian method for learning the Bayesian network structure from complete data. Recently, Koivisto and Sood (2004) presented an algorithm that for any single edge computes its marginal posterior probability in O(n 2^n) time,…

Machine Learning · Computer Science 2012-07-02 Mikko Koivisto

This paper studies the problem of learning Bayesian networks from continuous observational data, generated according to a linear Gaussian structural equation model. We consider an $\ell_0$-penalized maximum likelihood estimator for this…

Machine Learning · Statistics 2025-10-14 Tong Xu , Simge Küçükyavuz , Ali Shojaie , Armeen Taeb

We study the densest subgraph problem and its NP-hard densest at-most-$k$ subgraph variant through the lens of learning-augmented algorithms. We show that, given a reasonably accurate predictor that estimates whether a node belongs to the…

Data Structures and Algorithms · Computer Science 2026-04-16 Thai Bui , Luan Nguyen , Hoa T. Vu

The problem of learning Markov equivalence classes of Bayesian network structures may be solved by searching for the maximum of a scoring metric in a space of these classes. This paper deals with the definition and analysis of one such…

Artificial Intelligence · Computer Science 2013-01-07 Vincent Auvray , Louis Wehenkel

We propose an efficient family of algorithms to learn the parameters of a Bayesian network from incomplete data. In contrast to textbook approaches such as EM and the gradient method, our approach is non-iterative, yields closed form…

Machine Learning · Computer Science 2014-11-26 Guy Van den Broeck , Karthika Mohan , Arthur Choi , Judea Pearl

Bayesian networks (BNs) are a widely used class of probabilistic graphical models employed in numerous application domains. However, inferring the network's graphical structure from data remains challenging. Bayesian structure learners…

Machine Learning · Computer Science 2025-11-19 William Zhao , Guy Van den Broeck , Benjie Wang

The diagnosis of cyber-physical systems aims to detect faulty behaviour, its root cause and a mitigation or even prevention policy. Therefore, diagnosis relies on a representation of the system's functional and faulty behaviour combined…

Machine Learning · Computer Science 2021-10-13 Nicolas Olivain , Philipp Tiefenbacher , Jens Kohl

In this paper we propose a Bayesian method for estimating architectural parameters of neural networks, namely layer size and network depth. We do this by learning concrete distributions over these parameters. Our results show that regular…

Machine Learning · Statistics 2019-01-29 Georgi Dikov , Patrick van der Smagt , Justin Bayer

Established methods for structural elicitation typically rely on code modelling standard graphical models classes, most often Bayesian networks. However, more appropriate models may arise from asking the expert questions in common language…

Methodology · Statistics 2018-07-11 Rachel L. Wilkerson , Jim Q. Smith

We introduce a method for the problem of learning the structure of a Bayesian network using the quantum adiabatic algorithm. We do so by introducing an efficient reformulation of a standard posterior-probability scoring function on graphs…

In this paper we extend the work of Smith and Papamichail (1999) and present fast approximate Bayesian algorithms for learning in complex scenarios where at any time frame, the relationships between explanatory state space variables can be…

Machine Learning · Computer Science 2013-01-30 Raffaella Settimi , Jim Q. Smith , A. S. Gargoum

In this work, we focus on variational Bayesian inference on the sparse Deep Neural Network (DNN) modeled under a class of spike-and-slab priors. Given a pre-specified sparse DNN structure, the corresponding variational posterior contraction…

Statistics Theory · Mathematics 2020-08-04 Jincheng Bai , Qifan Song , Guang Cheng

This work initiates a systematic investigation of testing high-dimensional structured distributions by focusing on testing Bayesian networks -- the prototypical family of directed graphical models. A Bayesian network is defined by a…

Data Structures and Algorithms · Computer Science 2020-01-28 Clement Canonne , Ilias Diakonikolas , Daniel Kane , Alistair Stewart

Traditionally, learning the structure of a Dynamic Bayesian Network has been centralized, requiring all data to be pooled in one location. However, in real-world scenarios, data are often distributed across multiple entities (e.g.,…

Machine Learning · Computer Science 2025-02-07 Jianhong Chen , Ying Ma , Xubo Yue

Numerous Bayesian Network (BN) structure learning algorithms have been proposed in the literature over the past few decades. Each publication makes an empirical or theoretical case for the algorithm proposed in that publication and results…

Machine Learning · Computer Science 2020-09-14 Anthony C. Constantinou , Yang Liu , Kiattikun Chobtham , Zhigao Guo , Neville K. Kitson

We consider a set of agents who are attempting to iteratively learn the 'state of the world' from their neighbors in a social network. Each agent initially receives a noisy observation of the true state of the world. The agents then…

Social and Information Networks · Computer Science 2011-02-08 Yashodhan Kanoria , Omer Tamuz
‹ Prev 1 8 9 10 Next ›