Massive Parallelization of Massive Sample-Size Survival Analysis
From MaRDI portal
Cites work
- A Proportional Hazards Model for the Subdistribution of a Competing Risk
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Bootstrapping Lasso estimators
- Coordinate descent algorithms for lasso penalized regression
- GPU-accelerated Gibbs sampling: a case study of the horseshoe probit model
- Graphics processing units and high-dimensional optimization
- High-performance statistical computing in the computing environments of the 2020s
- Massive Parallelization Boosts Big Bayesian Multidimensional Scaling
- Massive parallelization of serial inference algorithms for a complex generalized linear model
- Outcome-adaptive Lasso: variable selection for causal inference
- Penalized regression, standard errors, and Bayesian Lassos
- Scalable Algorithms for Large Competing Risks Data
This page was built for publication: Massive Parallelization of Massive Sample-Size Survival Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6552555)