Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

2575157721,029 · Jun 202019922001200920172026
48 results for Bayesian network

Bayesian networks with latent variables are characterized and their likelihoods compared.

problem Characterizing and comparing likelihoods of Bayesian networks with latent variables.
method Characterized likelihood function and empirical Bayesian network. Proved dominance of global maximum likelihood from empirical model.
result The global maximum likelihood of the original Bayesian network is attained if and only if parameters are consistent with empirical model.

Bayesian networks are typically faithful, with implications for causal inference.

problem Determining the typicality of faithfulness in Bayesian networks.
method Analysis of Bayesian networks over a given DAG, parametrized by conditional exponential families, and nonparametric conditional densities.
result The faithful Bayesian networks are dense and open with respect to the total variation metric, extending existing results for specific classes of Bayesian networks.

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.

The paper introduces new Bayesian network classifiers for better classification accuracy.

problem Improving supervised classification accuracy using Bayesian network classifiers.
method Developed novel classes of generative classifiers based on staged tree models, extending Bayesian networks.
result Data-driven learning routines enhance the accuracy of the new classifiers.

We study the problem of learning Bayesian network structures from data. We develop an algorithm for finding the k-best Bayesian network structures. We propose to compute the posterior probabilities of hypotheses of interest by Bayesian model averaging over the k-best Bayesian networks. We present empirical results on s…

2012-03-15abs ↗pdf ↗

SOLBP extends efficient inference to uncertain Bayesian networks.

problem Inference in uncertain Bayesian networks with second-order probabilities.
method Extends Loopy Belief Propagation to second-order Bayesian networks.
result Generates inferences consistent with sum-product networks, more efficient and scalable.

This paper considers the computational power of constant size, dynamic Bayesian networks. Although discrete dynamic Bayesian networks are no more powerful than hidden Markov models, dynamic Bayesian networks with continuous random variables and discrete children of continuous parents are capable of performing Turing-co…

2016-03-19abs ↗pdf ↗

Bayesian neural networks benefit from fully marginalizing over all modes to improve generalization.

problem Bayesian neural networks suffer from multimodal posterior distributions that can lead to suboptimal generalization.
method Use appropriate Bayesian sampling tools to fully marginalize over all posterior modes.
result Training with full marginalization improves the ability of the network to reason between multiple candidate solutions.

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…

2013-02-06abs ↗pdf ↗

Bayesian approach improves network lasso for multi-task learning.

problem Improving the determination of relational coefficients in network lasso.
method Proposes a Bayesian approach to solve multi-task learning problems using network lasso.
result Objective determination of relational coefficients through Bayesian estimation.

Study how depth affects inference in deep Bayesian neural networks.

problem Understanding how depth impacts inference in overparameterized linear Bayesian neural networks.
method Interpreting finite deep linear Bayesian neural networks as scale mixtures of Gaussian process predictors.
result Advances analytical understanding of how depth affects inference in a simple class of Bayesian neural networks.

Paper improves Bayesian network learning from related data sets.

problem Learning from heterogeneous data sets with different probabilistic structures.
method Mixed-effects models to pool information across related data sets.
result Mixed-effects models outperform traditional methods in accuracy.

Researchers derive exact priors for finite Bayesian neural networks.

problem Understanding non-Gaussian priors in finite Bayesian neural networks.
method Analytical derivation of function space priors for finite fully-connected feedforward networks.
result Exact solutions for priors of finite networks, including Meijer G-function for linear networks and mixtures for ReLU networks.

Paper analyzes the free energy of CNNs with skip connections in Bayesian learning.

problem Dependency of CNNs with skip connections on the number of parameters.
method Examines the Bayesian free energy of CNNs with and without skip connections.
result The upper bound of free energy of Bayesian CNN with skip connections does not depend on overparametrization.

Paper proposes an efficient algorithm for learning sparse Bayesian networks from discrete high-dimensional data.

problem Learning sparse structure Bayesian networks from high-dimensional discrete data.
method Score function for sparse DAG, block-wise stochastic coordinate descent with variance reduction.
result The proposed algorithm outperforms existing methods in synthetic data benchmarks.

We study how finite Bayesian neural networks adapt their hidden representations.

problem Understanding how finite Bayesian neural networks differ from infinite ones.
method We analyze the asymptotics of learned feature kernels for various network architectures.
result The leading finite-width corrections to feature kernels have a universal form.

Bayesian methods enhance deep learning models by improving reliability and uncertainty.

problem Improving reliability and uncertainty awareness in deep learning models.
method Approximate Bayesian inference techniques, including SG-MCMC and VI, applied to deep learning models.
result Enhanced posterior inference for deep learning models, particularly in neural networks and generative models.

Bayesian approach learns linear networks from high-dimensional data.

problem Learning high-dimensional linear Bayesian networks.
method Iterative estimation of topological ordering and parents using inverse partial covariance matrix with Bayesian regularization.
result The method successfully recovers network structure under certain conditions.

Bayesian neural network models improve uncertainty quantification in multivariate regression.

problem Uncertainty quantification in multivariate regression models with heteroscedastic noise.
method Proposes Bayesian Last Layer neural network models and EM algorithms for parameter learning.
result Capable of disentangling aleatoric and epistemic uncertainty.

We present a new method to approximate posterior probabilities of Bayesian Network using Deep Neural Network. Experiment results on several public Bayesian Network datasets shows that Deep Neural Network is capable of learning joint probability distri- bution of Bayesian Network by learning from a few observation and p…

2017-12-31abs ↗pdf ↗

Study on hidden units in finite Bayesian neural networks and their tail properties.

problem Understanding the behavior of hidden units in finite Bayesian neural networks.
method Introduced a generalized Weibull-tail property to describe hidden units tails.
result Unit priors become heavier-tailed going deeper, providing insights into finite Bayesian neural networks.

A Bayesian network is a graphical model that encodes probabilistic relationships among variables of interest. When used in conjunction with statistical techniques, the graphical model has several advantages for data analysis. One, because the model encodes dependencies among all variables, it readily handles situations…

2020-02-01abs ↗pdf ↗

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.

In this paper we introduce ZhuSuan, a python probabilistic programming library for Bayesian deep learning, which conjoins the complimentary advantages of Bayesian methods and deep learning. ZhuSuan is built upon Tensorflow. Unlike existing deep learning libraries, which are mainly designed for deterministic neural netw…

2017-09-18abs ↗pdf ↗

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.

The paper uses Gaussian mixture models for Bayesian networks and proposes an optimization algorithm.

problem Modeling nodes in Bayesian networks with complex distributions.
method Gaussian mixture models combined with double iteration algorithm.
result The double iteration algorithm optimizes Gaussian mixture models effectively.

A novel Laplace-approximated Bayesian Tensor Network Kernel Machine (LA-TNKM) provides principled uncertainty estimates.

problem How to provide principled uncertainty estimates for tensor network kernel machines.
method Employing a linearized Laplace approximation for Bayesian inference.
result Consistently matches or surpasses Gaussian Processes and BNNs across diverse UCI regression benchmarks.

Deep neural networks (DNN) are versatile parametric models utilised successfully in a diverse number of tasks and domains. However, they have limitations---particularly from their lack of robustness and over-sensitivity to out of distribution samples. Bayesian Neural Networks, due to their formulation under the Bayesia…

2019-12-03abs ↗pdf ↗

Hybrid Bayesian neural networks use function uncertainty for probabilistic inference.

problem Uncertainty in neural network weights is hard to specify and interpret.
method Integrates probabilistic layers with standard deterministic layers for function uncertainty.
result Improves probabilistic inference by encoding function uncertainty.

Bayesian neural networks show good correlation between out-of-sample performance and Bayesian evidence.

problem Improving the out-of-sample performance of Bayesian neural networks.
method Numerical sampling of Bayesian posterior, ensembling over architectures, analysis of evidence vs. model size.
result Good correlation between out-of-sample performance and Bayesian evidence; ensembling improves performance.

Review of integrating Bayesian methods with neural network-based MPC.

problem Lack of standardized benchmarks and reliable analyses in Bayesian MPC.
method Systematic analysis of Bayesian methods in neural-network-based MPC.
result Need for standardized benchmarks, ablation studies, and transparent reporting.

NOTMAD estimates context-specific Bayesian networks without breaking datasets.

problem Non-convexity of acyclic graphs limits sharing information between context-specific estimators.
method NOTMAD models context-specific Bayesian networks as mixtures of archetypal DAGs, estimating structures and parameters jointly.
result NOTMAD shares information between context-specific acyclic graphs, enabling single-sample resolution.