arXiv:2503. 10496v2 Announce Type: replace-cross Abstract: Modeling natural phenomena with artificial neural networks (ANNs) often provides highly accurate predictions.
By Eirik H{\o}yheim, Lars Skaaret-Lund, Solve S{\ae}b{\o}, Aliaksandr Hubin
The paper introduces Dirichlet Process Mixtures (DPMs) as a new non‑parametric conditional probability distribution (CPD) model for Semiparametric Bayesian Networks (SPBNs). By replacing kernel density estimators with DPMs, the authors achieve a more compact representation that reduces inference costs and improves density estimation accuracy. Experiments on synthetic and real‑world data show that DPM‑based SPBNs outperform existing SPBNs and other continuous‑variable Bayesian network models in both density estimation and structure learning tasks.
By Victor Alejandre, Pedro Larra\~naga, Concha Bielza
arXiv:2610.16902v1 Announce Type: new
Abstract: Bayesian Networks (BNs) are established tools for letting agents reason under uncertainty in sequential decision-making. They split a joint distributio...
By Giovanni Briglia, Marco Lippi, Stefano Mariani, Franco Zambonelli
arXiv:2609.13655v1 Announce Type: new
Abstract: On evolving graphs, node classifiers must satisfy two key requirements: inductive generalization to newly arriving nodes under distribution shift and c...
By Jinwen Xu, Gonzalo Mateos Buckstein, Qin Lu
The paper introduces JSP-GFN, a Generative Flow Network that jointly infers the structure and parameters of a Bayesian Network. It sequentially generates a directed acyclic graph edge by edge and then samples the corresponding conditional probability parameters once the full structure is known. Experiments on simulated and real data show that JSP‑GFN accurately approximates the joint posterior and outperforms existing methods.
By Tristan Deleu, Mizu Nishikawa-Toomey, Jithendaraa Subramanian, Esmeralda S. Whitammer, Laurent Charlin, Yoshua Bengio
arXiv:2607. 25376v1 Announce Type: cross Abstract: In Bayesian neural networks (BNNs), variational inference is a widely adopted framework for modeling uncertainty in a distributional way, with the evidence lower bound (ELBO) serving as the standard objective function.
By Pei-Hsuan Hsia, Lars H. Heyen, Arvid Weyrauch, Markus Goetz, Achim Streit, Sebastian Krumscheid, Charlotte Debus
arXiv:2404.17763v3 Announce Type: replace-cross
Abstract: Probabilistic graphical models that encode an underlying Markov random field are fundamental building blocks of generative modeling to learn...
By Yujie Chen, Anindya Bhadra, Antik Chakraborty
arXiv:2609.21673v1 Announce Type: new
Abstract: Probabilistic Graphical Models (PGMs), especially Bayesian Networks (BNs), expose directed structure and probabilistic parameters, making them natural...
By Amartya Bhattacharya, Nikhil Singh, Neeti Pokhriyal, Soroush Vosoughi
arXiv:2601. 07944v2 Announce Type: replace-cross Abstract: Since the turn of the century, approximate Bayesian inference has steadily evolved as new computational techniques have been incorporated to handle increasingly complex, large-scale predictive problems.
By Roy Shivam Ram Shreshtth, Arnab Hazra, Gourab Mukherjee
arXiv:2610.19074v1 Announce Type: new
Abstract: Reliable uncertainty quantification remains an important challenge in AI. Hierarchical Bayesian methods provide a principled framework for this by repr...
By Neil K. Chada, Simon Cotter, Kody J. H. Law, Xinzhu Liang
arXiv:2509.13267v3 Announce Type: replace-cross
Abstract: A discrete Bayesian network is a directed acyclic graph (DAG) consisting of categorical variables. Two popular approaches for DBN modeling in...
By Alexander Dombowsky, David B. Dunson
arXiv:2606. 19366v1 Announce Type: cross Abstract: Information lattice learning (ILL) learns interpretable rules of a signal by alternately projecting the signal onto a partition lattice that encodes a hierarchy of abstractions and lifting selected rules back to the signal domain.
By Haizi Yu, Lav R. Varshney