Search arXivSearch

arXiv · 1307.2442

Power-Expected-Posterior Priors for Variable Selection in Gaussian Linear Models

Abstract

In the context of the expected-posterior prior (EPP) approach to Bayesian variable selection in linear models, we combine ideas from power-prior and unit-information-prior methodologies to simultaneously produce a minimally-informative prior and diminish the effect of training samples. The result is that in practice our power-expected-posterior (PEP) methodology is sufficiently insensitive to the size n* of the training sample, due to PEP's unit-information construction, that one may take n* equal to the full-data sample size n and dispense with training samples altogether. In this paper we focus on Gaussian linear models and develop our method under two different baseline prior choices: the independence Jeffreys (or reference) prior, yielding the J-PEP posterior, and the Zellner g-prior, leading to Z-PEP. We find that, under the reference baseline prior, the asymptotics of PEP Bayes factors are equivalent to those of Schwartz's BIC criterion, ensuring consistency of the PEP approach to model selection. We compare the performance of our method, in simulation studies and a real example involving prediction of air-pollutant concentrations from meteorological covariates, with that of a variety of previously-defined variants on Bayes factors for objective variable selection. Our prior, due to its unit-information structure, leads to a variable-selection procedure that (1) is systematically more parsimonious than the basic EPP with minimal training sample, while sacrificing no desirable performance characteristics to achieve this parsimony; (2) is robust to the size of the training sample, thus enjoying the advantages described above arising from the avoidance of training samples altogether; and (3) identifies maximum-a-posteriori models that achieve good out-of-sample predictive performance.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dimitris Fouskakis, Ioannis Ntzoufras, David Draper. 2014-05-20. Power-Expected-Posterior Priors for Variable Selection in Gaussian Linear Models. https://doi.org/10.1214/14-ba887

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fast inversion of the generalized Fisher transformation of correlation matrices

The generalized Fisher transformation maps a non-singular correlation matrix to an unconstrained real vector through the off-diagonal elements of its matrix logarithm. Evaluating its inverse is a computational bottleneck in dynamic correlation and multivariate volatility models. We develop a fast inversion algorithm by characterizing the unknown diagonal as the minimizer of a smooth, strictly convex, and coercive objective. An explicit Hessian and global spectral bounds identify the standard fixed-point iteration as a quasi-Newton method and explain why it can converge slowly near singularity. Every fixed-point step decreases the objective, and the iteration converges from every starting point. These results motivate GFT-FP+N, a hybrid of fixed-point and matrix-free Newton steps that never forms the Jacobian. In benchmarks with up to 1,000 replications per design and dimensions up to 800, GFT-FP+N reduces computation time by up to a factor of forty-five relative to the fixed-point iteration and converged in every replication, including on designs where Broyden's method almost always fails. Julia and R packages are provided.

stat.CO

Exact Simulation of Diffusions via Brownian Bridge Range Reconstruction

We develop an exact simulation algorithm for scalar diffusion paths and diffusion bridges when the Poisson potential is unbounded in both tails. The method reconstructs the realized range of a Brownian bridge proposal by sampling its maximum and location, together with the maxima and locations of the two adjacent restricted Brownian meanders. Conditional on this finite information, the remaining path decomposes into four conditionally independent interval-constrained Brownian bridges, which can be sampled exactly at the Poisson times required by the rejection test. In contrast to constructions based on an enclosing range layer, the proposed representation retains the exact extrema and their locations. Our algorithm returns an exact finite-dimensional skeleton without time-discretization error and permits exact post-acceptance refinement at arbitrary finite collections of times. Numerical experiments validate the resulting finite-dimensional laws and identify the restricted-meander extremum simulation as the principal computational cost in the nonlinear example.

stat.CO

Wasserstein mixing of a systematic-scan random rotation sampler

We study the mixing time of a systematic-scan analogue of Kac's walk that was proposed as a fast surrogate for Haar-distributed orthogonal matrices in randomized high-dimensional algorithms and was conjectured to approach Haar measure after only logarithmically many sweeps. We show that this conjectured speed-up does not occur for convergence of the full matrix law to Haar measure in Frobenius Wasserstein distance. At fixed normalized accuracy, the mixing time lies between order $n/\log n$ and order $n$ sweeps; at fixed absolute Frobenius accuracy, the corresponding bounds are between order $n$ and order $n\log n$. More strongly, below the scale $n/\log n$, the normalized Wasserstein distance remains asymptotically at its extremal value. We also show that the output law is singular with respect to Haar measure for fewer than $n/2$ sweeps. Thus the sampler may provide effective application-specific randomization without exhibiting the much faster full-Haar mixing.

stat.CO