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,695 papers · 148 categories

Trend · papers per month

58116174232 · Jun 202019922001200920172026
48 results for Bayesian analytics

Proposes TAGI for efficient Gaussian inference in Bayesian neural networks.

problem Efficient inference in Bayesian neural networks with complex architectures.
method Analytical method for tractable approximate Gaussian inference (TAGI).
result Matches performance of gradient-based methods with O(n)\mathcal{O}(n) computational complexity.

Proposes efficient Bayesian logistic regression for large sparse datasets.

problem Infeasibility of theoretical Bayesian methods for large sparse feature sets.
method Low complexity analytical approximations for sparse online logistic and probit regressions.
result Empirical results show superior performance compared to more complex methods.

Dropout has recently emerged as a powerful and simple method for training neural networks preventing co-adaptation by stochastically omitting neurons. Dropout is currently not grounded in explicit modelling assumptions which so far has precluded its adoption in Bayesian modelling. Using Bayesian entropic reasoning we s…

2015-08-12abs ↗pdf ↗

Stochastic VB improves nonlinear model inference speed and accuracy.

problem Bayesian inference of nonlinear models from noisy data.
method Stochastic Variational Bayesian (VB) inference for nonlinear models.
result Stochastic VB achieves comparable parameter recovery to analytical solution but is faster.

Paper presents a new method for Bayesian deep learning that scales to Atari games.

problem Training neural networks on complex environments like Atari games is challenging.
method Adapted temporal difference Q-learning to work with Bayesian inference.
result TAGI allows for analytical inference of neural network parameters, achieving performance comparable to gradient-based methods.

Paper shows how to infer hidden states in neural networks analytically.

problem Intractability of Bayesian inference for neural networks.
method Leverage tractable approximate Gaussian inference (TAGI) for hidden states inference.
result Demonstrates inference of hidden states through constraints for various applications.

Bayesian graph contrastive learning improves uncertainty quantification for graph analytics.

problem Uncertainty quantification for node representations in graph contrastive learning.
method Proposes a Bayesian framework to learn stochastic encoders representing nodes as distributions, providing uncertainty estimates.
result Significant improvement in performance on benchmark datasets compared to existing methods.

SmallML predicts customer churn for SMEs with small data, improving accuracy by 24.2 points.

problem AI exclusion of SMEs due to data scale mismatch.
method Bayesian transfer learning with hierarchical pooling and conformal prediction.
result 96.7% AUC on 100 obs SMEs, 24.2 point improvement over logistic regression.

QB-Vine extends Quasi-Bayesian methods to high dimensions using vine copulas.

problem Efficiently predicting high-dimensional distributions without sampling.
method Recursive Quasi-Bayesian construction for marginals and vine copulas for dependence modeling.
result QB-Vine is a fully non-parametric density estimator with analytical form and convergence rate independent of dimension.

Unified framework for DRO and DTA using Bayesian nonparametrics.

problem Combining DRO and DTA under ambiguity.
method Unified framework using DP and HDPs, with outlier robustness.
result Favorable performance in prediction accuracy and stability.

Paper proposes a surrogate model for efficient experience rating in large insurance portfolios.

problem Inexpensive and transparent computation of Bayesian premiums for large insurance portfolios.
method Surrogate modeling approach using likelihood-based summary statistics.
result Reduced computational burden and provided a transparent way of computing Bayesian premiums.

The paper analyzes methods for sparse Bayesian regression in nonlinear system identification.

problem Learning sparse models in Bayesian regression with nonlinear applications.
method Two classes of methods: regularization and thresholding based, built on automatic relevance determination (ARD).
result Analytical demonstration of favorable performance with sparse solutions in linear problems.

Bayesian Perceptron offers fully Bayesian neural networks without complex computations.

problem Lack of uncertainty quantification in neural networks.
method Bayesian inference framework for perceptron training and predictions in closed-form.
result Analytical expressions for perceptron's output and weight learning provided.

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.

Wide stochastic networks show Gaussian behavior and improve training with PAC-Bayesian methods.

problem Analyzing and training over-parameterised neural networks with large width.
method Establishing Gaussian behavior for a stochastic architecture, applying PAC-Bayesian training.
result PAC-Bayesian training on large but finite-width networks outperforms standard methods.

Bayesian framework improves financial risk management and compliance.

problem Uncertainty in financial risk forecasting and compliance.
method Integrated Bayesian analytics framework for precise uncertainty quantification.
result Proposed DLM model produces more accurate VaR estimates compared to baseline models.

Paper presents a method to accurately quantify neural network uncertainty without sampling.

problem Uncertainty quantification in neural networks for reliability and robustness.
method Sample-free moment propagation technique for mean vectors and covariance matrices.
result Analytic solution for covariance of nonlinear activation functions.

metabeta uses neural networks to speed up Bayesian mixed-effects regression.

problem Bayesian mixed-effects regression is computationally expensive.
method metabeta is a neural network model that pre-trains to estimate posterior distributions.
result metabeta achieves comparable performance to MCMC at a fraction of the time.

A new method combines ANN and Laplace for fast Bayesian inference in ODE models.

problem Bayesian inference for ODE systems with non-analytical solutions is computationally expensive.
method Hybrid approach using ANN for tractable likelihood and Laplace approximation.
result Effective posterior inference with improved computational cost compared to traditional methods.

Unified Bayesian-AI framework improves epidemiological risk prediction and uncertainty quantification.

problem Lack of calibrated uncertainty in machine learning models for epidemiology.
method Combines Bayesian prediction with Bayesian hyperparameter optimization using logistic regression and Gaussian-process Bayesian optimization.
result Unified Bayesian-AI framework provides reliable coverage and improved calibration, enhancing epidemiological decision making.

We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We…

2012-02-14abs ↗pdf ↗

Many scientifically well-motivated statistical models in natural, engineering and environmental sciences are specified through a generative process, but in some cases it may not be possible to write down a likelihood for these models analytically. Approximate Bayesian computation (ABC) methods, which allow Bayesian inf…

2018-10-03abs ↗pdf ↗

DABS uses a policy network to select experiments in high-dimensional design spaces.

problem Adaptive factorial screening in high-dimensional discrete design spaces.
method DABS learns a policy network offline to sequentially select experiments, incorporating sparsity and interactions via a spike-and-slab prior.
result DABS achieves superior accuracy and scalability over classical and Bayesian baselines under tight experimental budgets.

Bayesian algorithms improve crowdsourcing with label and instance constraints.

problem Efficiently labeling large datasets with additional human annotator information.
method Developed Bayesian algorithms for semi-supervised crowdsourced classification under label and instance constraints.
result Improved performance compared to unsupervised crowdsourcing on various datasets.

A conjugate Bayesian method detects change points in Hawkes processes efficiently.

problem Non-conjugacy between Hawkes process likelihood and prior causes inefficiency in change point detection.
method Data augmentation to propose a conjugate Bayesian two-step change point detection method.
result The conjugate method is more accurate and efficient than non-conjugate methods.

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.

Gaussian multiplicative noise is commonly used as a stochastic regularisation technique in training of deterministic neural networks. A recent paper reinterpreted the technique as a specific algorithm for approximate inference in Bayesian neural networks; several extensions ensued. We show that the log-uniform prior us…

2017-11-08abs ↗pdf ↗