arXiv Statistics ML

Graph-dependent shrinkage priors for Bayesian trend filtering

arXiv Statistics ML
Oct 9

Regularized Small Area Estimation with Graph Laplacian Benchmarking priors

The paper introduces a Bayesian framework for small area estimation that jointly handles borrowing information across areas and benchmarking estimates to reliable aggregates via a new family of Benchmarking priors. These priors arise from a benchmark-constrained regularization problem and include a Benchmarking Prior without additional regularization, as well as Single and Multi-View Laplacian Benchmarking Priors that use graph Laplacians built from area similarities based on external covariates. Tailored MCMC algorithms are developed for posterior computation, and the models are evaluated through a data-based simulation and applied to estimate Average Household Size at the municipality level in Colombia in 2025, where graph-based regularization improves performance and Multi-View models yield more precise estimates.

By Jairo F\'uquene-Pati\~no, Brenda Betancourt
arXiv Machine Learning
3d ago

Time-partitioning Gaussian Process Mixture Model

The Time-partitioning Gaussian Process Mixture Model (TPGPMM) is a Bayesian nonparametric framework that identifies persistent regimes and models nonstationary dependence in time series. It uses an adaptive Pitman–Yor prior on contiguous segmentations combined with regime-specific Gaussian processes, and learns change points and hyperparameters via a split–merge Metropolis-within-Gibbs sampler. Experiments on the CBOE Volatility Index and the 10‑year U.S. Treasury yield recover regime structures aligned with major market and monetary‑policy events, while variants that estimate observation noise improve predictive accuracy but may reduce sparsity or event alignment.

By Guilherme Piantino, Hedibert F. Lopes
arXiv Statistics ML
Aug 28

A Two-step Metropolis Hastings Method for Bayesian Empirical Likelihood Computation with Application to Quantile Regression and Bayesian Model Selection

The paper introduces a two-step Metropolis–Hastings algorithm designed to efficiently sample from Bayesian empirical likelihood (BayesEL) posterior distributions, addressing challenges posed by the complex, often non‑convex support of empirical likelihood. The method leverages current parameter values and estimating equations to propose new values for remaining parameters, making it suitable for problems with discontinuous estimating equations such as simultaneous quantile regression. Additionally, the approach extends naturally to BayesEL model selection via reversible‑jump MCMC, and the authors demonstrate its utility through several real‑life applications.

By Sanjay Chaudhuri, Teng Yin, Snehashis Chakraborty, Rupsa Roy
arXiv Machine Learning
Jul 14

Hierarchical Bayesian Quadrature

arXiv:2607. 10793v1 Announce Type: new Abstract: Numerical integration is a cornerstone of various scientific computing applications, such as engineering simulations and model evidence computations in probabilistic machine learning.

By Tim Weiland, Toni Karvonen, Philipp Hennig
arXiv Machine Learning
Sep 25

Nuclear Norm-Regularized Bayesian Matrix Completion

The paper introduces a Bayesian approach to matrix completion that uses a nuclear norm-based prior and addresses the challenge of unknown noise variance by placing a prior on it. It presents the first sampler for this model, providing a non‑asymptotic polynomial‑time guarantee in terms of matrix dimensions and desired accuracy. The method discretizes the noise precision and employs thermodynamic integration to construct a categorical posterior, offering a feasibility result for Bayesian sampling in non‑log‑concave settings.

By Calvin Tolbert