Variational approximations provide fast, deterministic alternatives to Markov Chain Monte Carlo for Bayesian inference on the parameters of complex, hierarchical models. Variational approximations are often limited in practicality in the absence of conjugate posterior distributions. Recent work has focused on the application of variational methods to models with only partial conjugacy, such as in semiparametric regression with heteroskedastic errors. Here, both the mean and log variance functions are modeled as smooth functions of covariates. For this problem, we derive a mean field variational approximation with an embedded Laplace approximation to account for the non-conjugate structure. Empirical results with simulated and real data show that our approximate method has significant computational advantages over traditional Markov Chain Monte Carlo; in this case, a delayed rejection adaptive Metropolis algorithm. The variational approximation is much faster and eliminates the need for tuning parameter selection, achieves good fits for both the mean and log variance functions, and reasonably reflects the posterior uncertainty. We apply the methods to log-intensity data from a small angle X-ray scattering experiment, in which properly accounting for the smooth heteroskedasticity leads to significant improvements in posterior inference for key physical characteristics of an organic molecule.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC5033129 | PMC |
http://dx.doi.org/10.1080/10618600.2014.983642 | DOI Listing |
Br J Math Stat Psychol
January 2025
Department of Community Health Sciences, University of Manitoba, Winnipeg, Manitoba, Canada.
Recent technological advancements have enabled the collection of intensive longitudinal data (ILD), consisting of repeated measurements from the same individual. The threshold autoregressive (TAR) model is often used to capture the dynamic outcome process in ILD, with autoregressive parameters varying based on outcome variable levels. For ILD from multiple individuals, multilevel TAR (ML-TAR) models have been proposed, with Bayesian approaches typically used for parameter estimation.
View Article and Find Full Text PDFNeural Netw
January 2025
College of Intelligence and Computing, Tianjin University, Tianjin, 300350, China. Electronic address:
Federated Learning (FL) is a popular framework for data privacy protection in distributed machine learning. However, current FL faces some several problems and challenges, including the limited amount of client data and data heterogeneity. These lead to models trained on clients prone to drifting and overfitting, such that we just obtain suboptimal performance of the aggregated model.
View Article and Find Full Text PDFACS Nano
January 2025
Department of Physics and Astronomy, University of Manitoba, Winnipeg R3T 2N2, Canada.
Theory and simulations are used to demonstrate implementation of a variational Bayes algorithm called "active inference" in interacting arrays of nanomagnetic elements. The algorithm requires stochastic elements, and a simplified model based on a magnetic artificial spin ice geometry is used to illustrate how nanomagnets can generate the required random dynamics. Examples of tracking and PID control are demonstrated and shown to be consistent with the original stochastic differential equation formulation of active inference.
View Article and Find Full Text PDFSci Rep
January 2025
Department of Computer Science and Information Technology, Benazir Bhutto Shaheed University Lyari, Karachi, 75660, Pakistan.
Deep learning-based medical image analysis has shown strong potential in disease categorization, segmentation, detection, and even prediction. However, in high-stakes and complex domains like healthcare, the opaque nature of these models makes it challenging to trust predictions, particularly in uncertain cases. This sort of uncertainty can be crucial in medical image analysis; diabetic retinopathy is an example where even slight errors without an indication of confidence can have adverse impacts.
View Article and Find Full Text PDFNat Commun
January 2025
Quantum Research Center, Technology Innovation Institute, Abu Dhabi, UAE.
Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over binary variables using only n qubits, with tunable k > 1.
View Article and Find Full Text PDFEnter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!