Search arXivSearch

arXiv · 2311.13347

Loss-based Objective and Penalizing Priors for Model Selection Problems

Abstract

Many Bayesian model selection problems, such as variable selection or cluster analysis, start by setting prior model probabilities on a structured model space. Based on a chosen loss function between models, model selection is often performed with a Bayes estimator that minimizes the posterior expected loss. The prior model probabilities and the choice of loss both highly affect the model selection results, especially for data with small sample sizes, and their proper calibration and careful reflection of no prior model preference are crucial in objective Bayesian analysis. We propose risk equilibrium priors as an objective choice for prior model probabilities that only depend on the model space and the choice of loss. Under the risk equilibrium priors, the Bayes action becomes indifferent before observing data, and the family of the risk equilibrium priors includes existing popular objective priors in Bayesian variable selection problems. We generalize the result to the elicitation of objective priors for Bayesian cluster analysis with Binder's loss. We also propose risk penalization priors, where the Bayes action chooses the simplest model before seeing data. The concept of risk equilibrium and penalization priors allows us to interpret prior properties in light of the effect of loss functions, and also provides new insight into the sensitivity of Bayes estimators under the same prior but different loss. We illustrate the proposed concepts with variable selection simulation studies and cluster analysis on a galaxy dataset.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Changwoo J. Lee. 2023-11-22. Loss-based Objective and Penalizing Priors for Model Selection Problems. https://arxiv.org/abs/2311.13347

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

KEEP EXPLORING

Related papers

Switchback Experiments under Geometric Mixing

The switchback is an experimental design that measures treatment effects by repeatedly turning an intervention on and off for a whole system. Switchback experiments are a robust way to overcome cross-unit spillover effects; however, they are vulnerable to bias from temporal carryovers. In this paper, we consider properties of switchback experiments in Markovian systems that mix at a geometric rate. We find that, in this setting, standard switchback designs suffer considerably from carryover bias: Their estimation error decays as $T^{-1/3}$ in terms of the experiment horizon $T$, whereas in the absence of carryovers a faster rate of $T^{-1/2}$ would have been possible. We also show, however, that judicious use of burn-in periods can considerably improve the situation, and enables errors that decay as $\log(T)^{1/2}T^{-1/2}$. Our formal results are mirrored in an empirical evaluation.

stat.ME

Saddlepoint approximations for plug-in resampling

Resampling-based procedures can improve on normal approximations in sparse, large-scale testing problems, but their computational cost can be prohibitive. We recognize that several existing procedures belong to a faster plug-in resampling subclass, fixing fitted nuisance parameters during resampling. When the resampled statistic is a sum of conditionally independent terms, the saddlepoint approximation (SPA) for the resampling $p$-value offers further acceleration, replacing resampling with an analytical tail approximation. However, standard Edgeworth-based approximation-error bounds impose regularity conditions that are hard to verify for plug-in resampling laws. We use an alternative approach to establish a finite-sample relative-error bound for the Lugannani-Rice approximation under more tractable conditions, which we apply in two contexts. In statistical genetics, we identify response resampling procedures as the targets of existing SPAs and establish guarantees in a representative setting. In conditional independence testing, we introduce spaCRT, an SPA for the distilled conditional randomization test (dCRT), which has been applied successfully in biology. Our rates quantify the effects of sparsity and signal strength, with matching lower bounds in special cases. We additionally establish asymptotic Type-I error control of the corresponding plug-in resampling procedures under growing sparsity. In simulations and single-cell CRISPR data analysis, spaCRT closely approximates dCRT $p$-values and preserves its statistical performance while accelerating computation by up to 250-fold.

stat.ME

NIRVAR: Network Informed Restricted Vector Autoregression

High-dimensional panels of time series often arise in finance and macroeconomics, where co-movements within groups of panel components occur. Extracting these groupings from the data provides a coarse-grained description of the complex system in question and can inform subsequent prediction tasks. We develop a novel methodology to model such a panel as a restricted vector autoregressive process, where the coefficient matrix is the weighted adjacency matrix of a stochastic block model. This network time series model, which we call the Network Informed Restricted Vector Autoregression (NIRVAR) model, yields a coefficient matrix that has a sparse block-diagonal structure. We propose an estimation procedure that embeds each panel component in a low-dimensional latent space and clusters the embedded points to recover the blocks of the coefficient matrix. Crucially, the method allows for network-based time series modelling when the underlying network is unobserved. We derive the bias, consistency and asymptotic normality of the NIRVAR estimator. Simulation studies suggest that the NIRVAR estimated embedded points are Gaussian distributed around the ground truth latent positions. On three applications to finance, macroeconomics, and transportation systems, NIRVAR outperforms competing models in terms of prediction and provides interpretable results regarding group recovery.

stat.ME