Bayesian Additive Regression Networks use neural networks for regression tasks.
problem Regression tasks with small neural networks and ensemble learning.
method Bayesian Additive Regression Tree principles applied to small neural networks, Gibbs sampling for ensemble learning.
result BARN provides more consistent and often more accurate results than shallow neural networks, BART, and ordinary least squares.
Bayesian principles improve neural additive models for better feature selection and uncertainty.
problem Lack of calibrated uncertainties and feature selection in neural additive models.
method Augmenting NAMs with Bayesian principles to provide credible intervals, feature selection, and interaction ranking.
result Improved performance on tabular datasets and real-world medical tasks.
R package abn fits Bayesian models to observational data.
problem Analyzing complex observational datasets with Bayesian networks.
method Bayesian and information theoretic scoring, exact and greedy search algorithms.
result Effective modeling of mixed data types and prior knowledge integration.
We consider the problem of learning Bayesian network classifiers that maximize the marginover a set of classification variables. We find that this problem is harder for Bayesian networks than for undirected graphical models like maximum margin Markov networks. The main difficulty is that the parameters in a Bayesian ne…
BARMPy offers a Python package for Bayesian Additive Regression Models.
problem Making complex Bayesian models accessible to machine learning practitioners.
method Object-oriented design compatible with SciKit-Learn, documentation and tutorial provided.
result Ease of use and compatibility with existing machine learning tools.
Semiparametric Bayesian networks combine parametric and nonparametric models for flexible data analysis.
problem Combining the advantages of parametric and nonparametric models for flexible data analysis.
method Semiparametric Bayesian networks combining parametric and nonparametric conditional probability distributions. Modifications of two algorithms for structure learning from data.
result Accurately learns the combination of parametric and nonparametric components, comparable to state-of-the-art methods.
Proposes DAK model for improved GP computations.
problem Challenges in high-dimensional GP layers in DKL.
method Additive structure and induced prior approximation for GP units.
result Outperforms state-of-the-art DKL methods in regression and classification.
Study compares priors for ABNs to improve model accuracy.
problem Inadequate priors lead to model selection issues in ABNs.
method Simulation study with three priors: Gaussian, Student's t, and strongly informative Gaussian.
result Informative Student's t-prior performs best, mitigating Lindley's paradox.
Study examines dependence properties of Bayesian neural network units in finite-width networks.
problem Understanding dependence properties of hidden units in practical finite-width Bayesian neural networks.
method Theoretical analysis and empirical evaluation of depth and width impacts.
result Hidden units in finite-width Bayesian neural networks are dependent, contrary to the infinite-width limit assumption.
Improved Bayesian optimization for conditional parameter spaces.
problem Efficient global optimization of expensive-to-evaluate functions in conditional parameter spaces.
method Additive tree-structured covariance function for conditional parameter optimization.
result Significantly improved sample-efficiency and wider applicability compared to existing methods.
Bayesian deep learning reduces overfitting and uncertainty measurement.
problem Overfitting and lack of model uncertainty in deep neural networks.
method Variational inference to approximate posterior distribution with normal prior.
result Test error reduced by 15% compared to classical deep learning.
Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distributions (CPDs) stored at each node. The majority of this work has concentrated on using decision-tree representations for the CPDs. In addition, re…
Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian structure learning under graph theoretic restrictions on the super-structure. The super-structure …
Bayesian framework for federated learning of neural networks without data pooling.
problem Scattered data across servers in federated learning problems.
method Bayesian nonparametric framework for neural networks, inference approach.
result Synthesize a more expressive global network with a single communication round.
New Bayesian neural network model improves performance and compresses networks.
problem Improving predictive performance and compressing neural networks.
method Proposes a new variational family with radial and directional components.
result Improves predictive performance and yields compressed networks.
Bayesian method sparsifies gated RNNs, improving speed and interpretability.
problem Sparsifying neural networks to reduce complexity and improve performance.
method Bayesian approach to sparsify weights, neurons, and gates in LSTM architectures.
result Sparsified gated RNNs speed up forward pass and improve compression.
Bayesian regularizations are explicitly implemented in CNNs, improving deep learning generalization.
problem Improving generalization in deep learning models.
method Introduced a novel probabilistic representation for CNN hidden layers and demonstrated their Bayesian nature.
result CNNs have explicitly Bayesian regularizations based on Bayesian regularization theory.
Bayesian approach to selecting data for machine learning.
problem Iterative data selection in machine learning algorithms.
method Embedding data selection into decision theory and deriving Bayes-optimal criteria.
result Mitigates confirmation bias in data selection.
This dissertation uses ILP to learn Bayesian network structures efficiently.
problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.
New PCstar algorithm discovers causal structure of max-linear Bayesian networks.
problem Discovering causal structure in max-linear Bayesian networks due to non-faithfulness.
method PC algorithm modified with C∗-separation assumptions. result PCstar algorithm can orient additional edges not possible with standard PC algorithm.
In many fields observations are performed irregularly along time, due to either measurement limitations or lack of a constant immanent rate. While discrete-time Markov models (as Dynamic Bayesian Networks) introduce either inefficient computation or an information loss to reasoning about such processes, continuous-time…
Bayesian networks combine prior knowledge with data to learn causal relationships.
problem Learning causal relationships from data.
method Constructing Bayesian networks from prior knowledge and using statistical methods to improve models.
result Bayesian networks can handle missing data and learn causal relationships.
A scalable Bayesian additive model for stellar flare detection using Gaussian process inference and hidden Markov models.
problem Bayesian time-series modeling for astronomical datasets
method Generative surrogate framework with Variational Autoencoder and neural network forward pass
result Significant reduction in computational time for stellar flare detection
JANA trains networks to approximate Bayesian models efficiently.
problem Intractable likelihood functions and posterior densities in Bayesian models.
method End-to-end training of three networks: summary, posterior, and likelihood networks.
result JANA provides accurate amortized marginal likelihood and posterior predictive estimation.
Bayesian inference for wide neural networks using Edgeworth expansion.
problem Analyzing the non-Gaussian behavior of wide neural networks in Bayesian inference.
method Proposed a non-Gaussian distribution using multivariate Edgeworth expansion for finite-width neural networks.
result Derived non-Gaussian posterior distribution in Bayesian regression tasks.
BLISS detects and separates astronomical sources quickly and accurately.
problem Detecting and separating overlapping astronomical sources in large images.
method Bayesian Light Source Separator (BLISS) using deep generative models and variational inference.
result BLISS can process megapixel images in seconds and produce highly accurate catalogs.
Bayesian optimization on networks using Gaussian process models.
problem Optimizing expensive black-box functions on network structures.
method Developed Bayesian optimization algorithms with Gaussian process surrogates tailored to network geometry.
result Established regret bounds for smooth objective functions and analyzed practical cases.
A new framework for lightweight BNNs learns heteroscedastic uncertainties efficiently.
problem Learning heteroscedastic uncertainties from BNNs for lightweight networks.
method Embedding heteroscedastic variances into BNN parameters and using moment propagation for inference.
result Improves predictive performance for lightweight BNNs without increasing parameter count.
The paper presents an R package for learning Bayesian networks from epidemiological data.
problem Learning Bayesian networks from messy, highly correlated datasets in epidemiology.
method The paper introduces an R package abn that implements multiple frequentist scoring rules for learning Bayesian networks from observational data, addressing data separation and adjustment issues.
result The package abn is robust and efficient for learning Bayesian networks from epidemiological data.
Bayesian explanations are more resilient to adversarial attacks than deterministic ones.
problem Stability of saliency-based explanations under adversarial attacks in Neural Networks.
method Empirical and theoretical analysis of Bayesian vs deterministic Neural Networks.
result Bayesian explanations are more stable under adversarial perturbations and direct attacks.
Estimates marginal independence structure of Bayesian networks from data.
problem Learning the marginal independence structure of Bayesian networks from observational data.
method Using Gröbner basis and MCMC method (GrUES) to connect and recover the true structure.
result GrUES recovers the true marginal independence structure at a higher rate than simple independence tests.
Closed-form variational objectives for Bayesian neural networks with ReLU layers.
problem Efficient computation of Bayesian neural networks with closed-form variational objectives.
method Single-layer networks with piecewise polynomial activations (ReLU). Structured Normal variational distributions for Normal likelihoods. Approximate lower bounds for other likelihoods.
result Closed-form computation of variational lower bounds, predictive mean, and variance for Bayesian neural networks.
Bayesian neural networks achieve optimal posterior contraction rates in Besov spaces with intrinsic dimensionality.
problem High-dimensional structured estimation problems with unknown smoothness levels.
method Sparse Bayesian neural networks with either sparse or continuous shrinkage priors.
result Optimal posterior contraction rates are achieved, adapting to the unknown smoothness level of the true function.
Novel covariance function improves Bayesian optimization efficiency.
problem Efficient global optimization of expensive black-box functions.
method Additive tree-structured covariance function and parallel optimization algorithm.
result Significantly outperforms state-of-the-art methods in conditional parameter optimization.
Graph Neural Network improves causal inference in dynamic systems.
problem Identifying causal relations among multi-variate time series.
method Graph Neural Network approach with score-based method.
result Graph Neural Network significantly outperformed other methods in dynamic Bayesian network inference.
New bounds improve pruning for BDeu score in BNSL.
problem Improving pruning for BDeu score in BNSL.
method Deriving new upper bounds for BDeu score.
result New bounds are tighter and computationally efficient.
Paper assesses adversarial robustness of MCMC and BDK methods for deep Bayesian networks.
problem Assessing adversarial robustness of deep neural networks under MCMC and BDK approximations.
method Characterizes robustness of MCMC and BDK methods to FGSM and PGD attacks.
result Full MCMC-based inference shows excellent robustness, outperforming standard point estimation.
Bayesian model detects altered neural circuits in MCI patients.
problem Detecting altered neural circuits in Mild Cognitive Impairment patients.
method Hierarchical Bayesian recurrent state space model.
result Model discovers latent states predominantly observed in MCI patients.
BFTS uses Bayesian Additive Regression Trees for improved personalized mobile health interventions.
problem Adapting to complex, non-linear user behaviors in personalized mobile health interventions.
method Bayesian Forest Thompson Sampling (BFTS) integrates Bayesian Additive Regression Trees (BART) into the exploration loop of contextual bandits.
result BFTS achieves state-of-the-art regret on tabular benchmarks and improves engagement rates by over 30% in a behavioral intervention study.
Bayesian deep learning method improves model uncertainty and robustness.
problem Overfitting and model uncertainty in deep neural networks.
method Variational inference with multivariate normal distributions and correlated parameters.
result The method successfully reduces overfitting and improves model uncertainty on MNIST and CIFAR-10 datasets.
Improved neural network predicts tropical storm trajectories and Bayesian intervals.
problem Accurately predicting the trajectories of tropical storms to prevent damage.
method Developed an improved RNN model with dropout to predict Bayesian intervals.
result Neural network dropout values significantly affect prediction accuracy and intervals.
The paper explores efficient sampling for Bayesian wide neural networks.
problem Sampling from posterior distributions of wide neural networks.
method Preconditioned Crank-Nicolson and Langevin algorithms for reparametrised posterior distributions.
result The preconditioned Crank-Nicolson algorithm improves sampling efficiency in wide networks.
BayesFlow learns complex models using neural networks.
problem Estimating parameters in complex, non-likelihood models.
method Invertible neural networks for global Bayesian inference.
result Global probabilistic mapping from data to parameters.
Bayesian method predicts future network configurations from past snapshots.
problem Reconstructing evolving networks from partial observations.
method Bayesian approach using past network snapshots to inform future predictions.
result Method accurately predicts link probabilities and network structure.
This paper improves dependency networks using information geometry.
problem Technical disadvantage in dependency networks' learned distribution.
method Interpret pseudo-Gibbs sampling as iterative m-projections onto manifolds.
result Dependency networks can learn faster and have similar performance to Bayesian networks.
Unsupervised estimation of latent variable models is a fundamental problem central to numerous applications of machine learning and statistics. This work presents a principled approach for estimating broad classes of such models, including probabilistic topic models and latent linear Bayesian networks, using only secon…
Variational inference provides approximations to the computationally intractable posterior distribution in Bayesian networks. A prominent medical application of noisy-or Bayesian network is to infer potential diseases given observed symptoms. Previous studies focus on approximating a handful of complicated pathological…
Library learns Bayesian networks from mixed data without discretization.
problem Learning Bayesian networks from mixed data (discrete and continuous variables).
method Proposes an algorithm for structural and parameter learning of Bayesian networks from mixed data using a mixed MI score function and Gaussian approximation. Offers two graph structure enumeration algorithms.
result Advantages in solving approximation and gap recovery problems on synthetic and real datasets.