An efficient computational approach for prior sensitivity analysis and cross‐validation
From MaRDI portal
Publication:3561483
DOI10.1002/cjs.10045zbMath1190.62046MaRDI QIDQ3561483
Arnaud Doucet, Raphael Gottardo, Luke Bornn
Publication date: 25 May 2010
Published in: Canadian Journal of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cjs.10045
Markov chain Monte Carlo; sequential Monte Carlo; variable selection; penalized regression; \(g\)-prior; regularization path plot
Related Items
On consistency and optimality of Bayesian variable selection based on \(g\)-prior in normal linear regression models, Bayesian regularization via graph Laplacian, Comment on article by Finegold and Drton, A survey of Bayesian predictive methods for model assessment, selection and comparison
Cites Work
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Stability of sequential Monte Carlo samplers via the Foster-Lyapunov condition
- Nonequilibrium measurements of free energy differences for microscopically reversible Markovian systems
- Least angle regression. (With discussion)
- Local sensitivity diagnostics for Bayesian inference
- Case-deletion importance sampling estimators: central limit theorems and related results
- Central limit theorem for sequential Monte Carlo methods and its application to Bayesian inference
- Following a Moving Target—Monte Carlo Inference for Dynamic Bayesian Models
- Sequential Monte Carlo Methods in Practice
- On cross-validation of Bayesian models
- Local Sensitivity of Inferences to Prior Marginals
- Sequential Monte Carlo Samplers
- The Bayesian Lasso
- On the Variability of Case-Deletion Importance Sampling Weights in the Bayesian Linear Model
- A sequential particle filter method for static models
- Sequential Monte Carlo Methods for Dynamic Systems
- Filtering via Simulation: Auxiliary Particle Filters
- Bayesian Inference in Econometric Models Using Monte Carlo Integration
- Importance re-sampling MCMC for cross-validation in inverse problems
