Penalized complexity priors for degrees of freedom in Bayesian P-splines

Abstract

Bayesian P-splines assume an intrinsic Gaussian Markov random field prior on the spline coefficients, conditional on a precision hyper-parameter $\tau$. Prior elicitation of $\tau$ is difficult. To overcome this issue we aim to building priors on an interpretable property of the model, indicating the complexity of the smooth function to be estimated. Following this idea, we propose Penalized Complexity (PC) priors for the number of effective degrees of freedom. We present the general ideas behind the construction of these new PC priors, describe their properties and show how to implement them in P-splines for Gaussian data.

Cited by in corpus (5)

• Laplace approximation for fast Bayesian inference in generalized additive models based on penalized regression splines
• Laplacian-P-splines for Bayesian inference in the mixture cure model
• Variance partitioning in spatio-temporal disease mapping models
• PC priors for residual correlation parameters in one-factor mixed models
• EcoMem: An R package for quantifying ecological memory