Efficient sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm
From MaRDI portal
Cites work
- 10.1162/15324430152748236
- A comment on D. V. Lindley's statistical paradox
- A review of Bayesian variable selection methods: what, how and which
- A Simple New Approach to Variable Selection in Regression, with Application to Genetic Fine Mapping
- Adaptive Bayesian SLOPE: Model Selection With Incomplete Data
- Adaptive false discovery rate control under independence and dependence
- Adaptive posterior contraction rates for the horseshoe
- Bayesian data analysis.
- Bayesian linear regression with sparse priors
- Bayesian sparse linear regression with unknown symmetric error
- Bayesian Variable Selection in Linear Regression
- Calibration and empirical Bayes variable selection
- Consistent high-dimensional Bayesian variable selection via penalized credible regions
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Direct Calculation of the Information Matrix via the EM Algorithm
- Empirical Bayes Analysis of a Microarray Experiment
- Empirical Bayes posterior concentration in sparse high-dimensional linear models
- Empirical priors for prediction in sparse high-dimensional linear regression
- EMVS: the EM approach to Bayesian variable selection
- Estimating the Null and the Proportion of Nonnull Effects in Large-Scale Multiple Comparisons
- Estimating the proportion of true null hypotheses under dependence
- Expectation propagation as a way of life: a framework for Bayesian inference on partitioned data
- scientific article; zbMATH DE number 3768770 (Why is no real title available?)
- scientific article; zbMATH DE number 4001209 (Why is no real title available?)
- scientific article; zbMATH DE number 788230 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 6438182 (Why is no real title available?)
- Maximum likelihood estimation via the ECM algorithm: A general framework
- Mixtures of g Priors for Bayesian Variable Selection
- Multitask Compressive Sensing
- Nearly unbiased variable selection under minimax concave penalty
- On Profile Likelihood
- On spike and slab empirical Bayes multiple testing
- On the Convergence of the Jacobi Method for Arbitrary Orderings
- Oracle and Adaptive Compound Decision Rules for False Discovery Rate Control
- Parameter expansion to accelerate EM: the PX-EM algorithm
- Particle EM for variable selection
- Randomized methods for linear constraints: convergence rates and conditioning
- RcppArmadillo: accelerating R with high-performance C++ linear algebra
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Scalable variational inference for Bayesian variable selection in regression, and its accuracy in genetic association studies
- Simple and Globally Convergent Methods for Accelerating the Convergence of Any EM Algorithm
- Strong Control, Conservative Point Estimation and Simultaneous Conservative Consistency of False Discovery Rates: A Unified Approach
- The Adaptive Lasso and Its Oracle Properties
- The horseshoe estimator for sparse signals
- The spike-and-slab LASSO
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Variational Bayes for High-Dimensional Linear Regression With Sparse Priors
This page was built for publication: Efficient sparse high-dimensional linear regression with a partitioned empirical Bayes ECM algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6954848)
