Search arXivSearch

arXiv · 1801.02321

Log-Scale Shrinkage Priors and Adaptive Bayesian Global-Local Shrinkage Estimation

Abstract

Global-local shrinkage hierarchies are an important innovation in Bayesian estimation. We propose the use of log-scale distributions as a novel basis for generating familes of prior distributions for local shrinkage hyperparameters. By varying the scale parameter one may vary the degree to which the prior distribution promotes sparsity in the coefficient estimates. By examining the class of distributions over the logarithm of the local shrinkage parameter that have log-linear, or sub-log-linear tails, we show that many standard prior distributions for local shrinkage parameters can be unified in terms of the tail behaviour and concentration properties of their corresponding marginal distributions over the coefficients $β_j$. We derive upper bounds on the rate of concentration around $|β_j|=0$, and the tail decay as $|β_j| \to \infty$, achievable by this wide class of prior distributions. We then propose a new type of ultra-heavy tailed prior, called the log-$t$ prior with the property that, irrespective of the choice of associated scale parameter, the marginal distribution always diverges at $β_j = 0$, and always possesses super-Cauchy tails. We develop results demonstrating when prior distributions with (sub)-log-linear tails attain Kullback--Leibler super-efficiency and prove that the log-$t$ prior distribution is always super-efficient. We show that the log-$t$ prior is less sensitive to misspecification of the global shrinkage parameter than the horseshoe or lasso priors. By incorporating the scale parameter of the log-scale prior distributions into the Bayesian hierarchy we derive novel adaptive shrinkage procedures. Simulations show that the adaptive log-$t$ procedure appears to always perform well, irrespective of the level of sparsity or signal-to-noise ratio of the underlying model.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniel F. Schmidt, Enes Makalic. 2020-01-30. Log-Scale Shrinkage Priors and Adaptive Bayesian Global-Local Shrinkage Estimation. https://arxiv.org/abs/1801.02321

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

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST