Bayesian selection of best subsets via hybrid search
From MaRDI portal
Publication:2667010
Recommendations
- High-dimensional variable selection via low-dimensional adaptive learning
- Bayesian variable selection via particle stochastic search
- Evolutionary stochastic search for Bayesian model exploration
- EMVS: the EM approach to Bayesian variable selection
- Fast Bayesian variable selection for high dimensional linear models: marginal solo spike and slab priors
Cites work
- Bayes Factors
- Bayesian Graphical Models for Discrete Data
- Bayesian Subset Modeling for High-Dimensional Generalized Linear Models
- Best subset selection via a modern optimization lens
- Estimating the dimension of a model
- Extended Bayesian information criteria for model selection with large model spaces
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Nearly unbiased variable selection under minimax concave penalty
- Optimization by simulated annealing
- Regularization and Variable Selection Via the Elastic Net
- Shotgun Stochastic Search for “Largep” Regression
- Stochastic Approximation in Monte Carlo Computation
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(6)- High-dimensional variable selection via low-dimensional adaptive learning
- A polynomial algorithm for best-subset selection problem
- Better subset regression
- Best-subset model selection based on multitudinal assessments of likelihood improvements
- Communication-efficient estimation for distributed subset selection
- A hybrid deterministic-deterministic approach for high-dimensional Bayesian variable selection with a default prior
This page was built for publication: Bayesian selection of best subsets via hybrid search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667010)