Post-process Bayesian inference speeds up posterior approximation.
problem Leveraging pre-existing model evaluations for quick posterior approximation.
method Variational Sparse Bayesian Quadrature (VSBQ) using sparse Gaussian process (GP) surrogate model.
result VSBQ builds high-quality posterior approximations from existing optimization traces.
SSVI efficiently trains sparse Bayesian neural networks with minimal compression and performance loss.
problem Efficiently training Bayesian neural networks with uncertainty quantification.
method SSVI optimizes a sparse subspace basis selection and its parameters alternately, guided by weight distribution statistics.
result SSVI achieves significant compression (10-20x model size reduction) with minimal performance drop (under 3%) and FLOPs reduction (up to 20x) compared to dense Variational Inference.
Bayesian model infers factor dimensionality and sparse loading matrix adaptively.
problem Inference of high-dimensional sparse factor model with varying sparsity and factor dimensions.
method Adaptive Bayesian sparse factor model with posterior concentration.
result Posterior distribution asymptotically concentrates on true factor dimensionality and sparsity.
New Bayesian method for joint sparse parameter inference.
problem Inference of jointly sparse parameter vectors from multiple measurements.
method Hierarchical Bayesian learning with joint sparsity-promoting priors.
result New algorithms consistently outperform existing methods in numerical experiments.
Paper develops efficient variational inference for sparse deep learning with theoretical guarantees.
problem Sparse deep learning's challenge of huge storage consumption and sparse structure recovery.
method Bayesian treatment with spike-and-slab priors and continuous relaxation of Bernoulli distribution for computationally efficient variational inferences.
result Provides variational posterior contraction rate, justifying consistency of the proposed method.
New BNN model proves optimal posterior concentration and enables practical inference.
problem Improving generalization and uncertainty quantification in deep neural networks.
method Proposes a new node-sparse BNN model with theoretical guarantees and a novel MCMC algorithm for inference.
result Proves near minimax optimal posterior concentration rate and adaptiveness to true model smoothness.
We present a hybrid algorithm for Bayesian topic models that combines the efficiency of sparse Gibbs sampling with the scalability of online stochastic inference. We used our algorithm to analyze a corpus of 1.2 million books (33 billion words) with thousands of topics. Our approach reduces the bias of variational infe…
A fast MCMC sampler for sparse Bayesian inference.
problem Sparse Bayesian inference problems with high computational cost.
method Asynchronous Gibbs sampler extended with data sub-sampling.
result The Markov chain admits an invariant distribution that recovers the main signal with high probability.
New method reduces Bayesian inference time by optimizing Hamiltonian flows.
problem Efficiently constructing a Bayesian coreset with low inferential error.
method Sparse Hamiltonian flows, involving uniform subsampling and momentum quasi-refreshment steps.
result Exponential compression of the dataset and reduced KL divergence to the target.
Paper proposes new Bayesian neural network models for efficient learning.
problem Efficient learning and model compression in deep neural networks.
method Proposes Spike-and-Slab Group Lasso (SS-GL) and Spike-and-Slab Group Horseshoe (SS-GHS) priors for structured sparsity in Bayesian neural networks.
result Establishes competitive performance in prediction accuracy, model compression, and inference latency compared to baseline models.
Bayesian methods improve drug discovery experiment design.
problem Optimizing drug screening experiments in high-dimensional data.
method Bayesian inference and optimisation with upper confidence bound algorithms, Thompson sampling, and sparse tree search.
result Sparse tree search techniques outperform other methods in drug toxicity screening.
In this paper, we present a Bayesian channel estimation algorithm for multicarrier receivers based on pilot symbol observations. The inherent sparse nature of wireless multipath channels is exploited by modeling the prior distribution of multipath components' gains with a hierarchical representation of the Bessel K pro…
Structural damage due to excessive loading or environmental degradation typically occurs in localized areas in the absence of collapse. This prior information about the spatial sparseness of structural damage is exploited here by a hierarchical sparse Bayesian learning framework with the goal of reducing the source of …
Undirected graphical models are applied in genomics, protein structure prediction, and neuroscience to identify sparse interactions that underlie discrete data. Although Bayesian methods for inference would be favorable in these contexts, they are rarely used because they require doubly intractable Monte Carlo sampling…
Paper introduces variational inference for Bayesian inverse problems with gamma hyperpriors.
problem Bayesian inverse problems with sparse solutions.
method Variational iterative alternating scheme for hierarchical models with gamma hyperpriors.
result Accurate reconstruction and meaningful uncertainty quantification.
New method tackles high-dimensional SBL without covariance matrices.
problem Sparse coding problem in high-dimensional settings.
method Parallel solution of multiple linear systems using conjugate gradient algorithm.
result Our method scales better in computation time and memory.
Sparse Markovian Gaussian processes improve probabilistic model inference for large datasets.
problem Efficient inference for large-scale time series data.
method Combining inducing variables with Kalman filter-like recursions for linear scaling.
result General site-based approach for approximating non-Gaussian likelihoods.
BO method identifies sparse subspaces for efficient high-dimensional optimization.
problem Efficient optimization of high-dimensional black-box functions.
method Sparse Gaussian process surrogate models on axis-aligned subspaces with Hamiltonian Monte Carlo inference.
result SAASBO achieves excellent performance on synthetic and real-world problems.
Adaptive sparseness enhances robust regression using MCC and ARD.
problem Developing a robust regression method with adaptive sparseness.
method Integrating MCC with ARD in a Bayesian framework using variational Bayesian inference.
result MCC-ARD regression outperforms existing methods in prediction and feature selection.
This paper begins with considering the identification of sparse linear time-invariant networks described by multivariable ARX models. Such models possess relatively simple structure thus used as a benchmark to promote further research. With identifiability of the network guaranteed, this paper presents an identificatio…
New method uses generative priors for compressive sensing with sparse solutions.
problem Fundamental linear inverse problem in compressive sensing.
method Sparse Bayesian learning with conditional Gaussianity.
result Ability to learn from few compressed and noisy samples without optimization.
Bayesian framework for encoding uncertainty and inducing sparsity.
problem Handling uncertainty and inducing sparsity in statistical models.
method General Bayesian framework with explicit encoding of uncertainty and sparsity-inducing approach.
result Effective in linear and logistic regression, and Bayesian neural networks.
New method speeds up sparse Bayesian learning without covariance matrix.
problem Sparse coding problem with uncertainty quantification.
method Covariance-free expectation maximization (CoFEM) that avoids explicit covariance matrix computation.
result Up to thousands of times faster than existing methods without sacrificing accuracy.
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.
One of the fundamental tasks of science is to find explainable relationships between observed phenomena. One approach to this task that has received attention in recent years is based on probabilistic graphical modelling with sparsity constraints on model structures. In this paper, we describe two new approaches to Bay…
Delta-AI speeds up inference in sparse PGMs by local credit assignment.
problem Efficient inference in sparse probabilistic graphical models.
method Local credit assignment in agent's policy learning objective.
result Trained sampler recovers marginals and conditional distributions.
Flexible Bayesian approach for generalized linear models, especially for sparse logistic regression.
problem Sparse logistic regression challenges in machine learning.
method Empirical Bayes approach with mean-field variational inference, tuning-free and scalable.
result Superior predictive performance in sparse logistic regression compared to existing methods.
The paper develops a scalable method to infer GRNs from sparse data.
problem Inferring complex gene regulatory networks from limited and temporally sparse data.
method Bayesian optimization and kernel-based methods to construct a Gaussian Process (GP) model.
result The method efficiently searches for the topology with the highest likelihood value.
Bayesian framework for robust model discovery from noisy data.
problem Robust model discovery from noisy, sparse and irregular observations of nonlinear systems.
method Bayesian differential programming using Hamiltonian Monte Carlo and sparsity-promoting priors.
result Efficient inference of posterior distributions over plausible models with quantified uncertainty.
This paper introduces a new sparse spatio-temporal structured Gaussian process regression framework for online and offline Bayesian inference. This is the first framework that gives a time-evolving representation of the interdependencies between the components of the sparse signal of interest. A hierarchical Gaussian p…
Bayesian method infers network topology and dynamics from noisy, sparse measurements.
problem Learning network topology and dynamics from partial, noisy data.
method Developed method uses dynamical structure functions derived from linear stochastic differential equations.
result Method outperforms state-of-the-art methods in various network types.
Bayesian ODEs with Gaussian processes infer unknown dynamics from data.
problem Estimating unknown continuous-time system dynamics from data.
method Bayesian nonparametric model using Gaussian processes, sparse variational inference, probabilistic shooting.
result Posterior predictive uncertainty scores outperform alternative methods on multiple ODE learning tasks.
Bayesian method identifies dynamical models with uncertainty quantification.
problem Uncertainty in selecting governing equations for dynamical systems.
method Bayesian sparse identification with model averaging.
result Accurately recovers sparse interaction structures with uncertainty quantification.
Sparse Gaussian Processes simplify GP inference for large datasets.
problem Efficiently handling large datasets in Gaussian Process models.
method Sparse Gaussian Processes combined with variational inference.
result Sparse GPs enable approximate inference with reduced memory and computational requirements.
Proposes a non-parametric method for deep discrete latent variable models.
problem Learning sparse discrete latent representations in deep models.
method Iterative algorithm with Beta-Bernoulli process prior and local data scaling.
result Improves sparsity and scalability of deep discrete latent variable models.
Variational inference is becoming more and more popular for approximating intractable posterior distributions in Bayesian statistics and machine learning. Meanwhile, a few recent works have provided theoretical justification and new insights on deep neural networks for estimating smooth functions in usual settings such…
Bayesian approach improves performance in Gaussian process models.
problem Scalable posterior estimation in Gaussian process models.
method Revisiting variational inference techniques with Bayesian treatment of inducing variables and hyper-parameters.
result State-of-the-art performance demonstrated across various regression and classification problems.
SVGP KAN integrates uncertainty quantification into Kolmogorov-Arnold networks.
problem Uncertainty quantification in scientific machine learning models.
method Sparse variational Gaussian process inference with Kolmogorov-Arnold topology.
result Demonstrated ability to distinguish aleatoric and epistemic uncertainty in various scientific applications.
Sparse Gaussian process quantile regression tackles computational challenges in Bayesian quantile regression.
problem Nonconjugacy and computational cost in Gaussian process quantile regression.
method Sparse Gaussian process framework with Laplace approximation, adaptive inducing-input placement, and sequential data acquisition.
result Accuracy of Laplace approximation and effectiveness of adaptive mechanisms in reducing predictive uncertainty.
SGPA calibrates transformer uncertainty for safety-critical tasks.
problem Uncertainty estimation in transformer models for safety-critical domains.
method Bayesian inference in transformer's output space using sparse Gaussian processes.
result SGPA-based Transformers improve in-distribution calibration and out-of-distribution robustness.
Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or super-resolution, can be addressed by maximizing the posterior distribution of a sparse linear model (SLM). We show how higher-order Bayesian decision-making problems, such as optimizing imag…
Bayesian approach infers signaling pathways from data.
problem Accurately understand cellular regulation processes.
method Dynamic Bayesian Network structure estimation using Markov Chain Monte Carlo.
result Efficient sampling of sparse graphs improves inference.
Sparse Polynomial Chaos expansions improve accuracy and efficiency in simulations.
problem Challenges in computational efficiency and accuracy for Polynomial Chaos modeling.
method Sparse Bayesian learning using Variational Relevance Vector Machines.
result Sparse Polynomial Chaos expansions achieve comparable performance to compressive sensing with fewer data points.
Bayesian method predicts runtime metrics for fog manufacturing.
problem Accurate prediction of runtime performance metrics in fog manufacturing.
method Bayesian sparse regression for multivariate mixed responses.
result Enhanced prediction and statistical inferences of runtime metrics.
Natural image statistics exhibit hierarchical dependencies across multiple scales. Representing such prior knowledge in non-factorial latent tree models can boost performance of image denoising, inpainting, deconvolution or reconstruction substantially, beyond standard factorial "sparse" methodology. We derive a large …
Novel methods improve Bayesian analysis of chaotic dynamical systems.
problem Bayesian parameter inference and trajectory reconstruction of chaotic systems with sparse and noisy data.
method Pilot MAGI (pMAGI) and Pilot MAGI Sequential Prediction (PMSP) methods.
result pMAGI and PMSP significantly outperform existing methods in accuracy and computational efficiency.
Bayesian model improves BCI performance for ALS users.
problem Classifying EEG signals for P300 BCIs with low SNR and complex correlations.
method GLASS model with Gaussian Latent channel and Sparse time-varying effects.
result GLASS substantially improves BCI performance in ALS users.
The paper develops scalable variational inference for Bayesian neural networks under model and parameter uncertainty.
problem Combining structural and parameter uncertainties in scalable Bayesian neural networks.
method Adapted variational inference with reparametrization for model space constraints.
result Comparable accuracy with sparse inference compared to ordinary BNNs.