Distributed iterative hard thresholding for variable selection in Tobit models
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- Best subset selection for high-dimensional non-smooth models using iterative hard thresholding
- Best subset selection via a modern optimization lens
- Censored linear model in high dimensions. Penalised linear regression on high-dimensional data with left-censored response variable
- Communication-efficient algorithms for statistical optimization
- Communication-efficient distributed statistical inference
- Communication-efficient sparse regression
- Distributed Subgradient Methods for Multi-Agent Optimization
- Estimation of Relationships for Limited Dependent Variables
- Hard thresholding pursuit: an algorithm for compressive sensing
- High-Dimensional Censored Regression via the Penalized Tobit Likelihood
- Iterative hard thresholding for compressed sensing
- LAD-Lasso variable selection for doubly censored median regression models
- Linear regression with censored data
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
- Minimax risks for sparse regressions: ultra-high dimensional phenomenons
- Note on the Uniqueness of the Maximum Likelihood Estimator for the Tobit Model
- Some Inequalities on Mill's Ratio and Related Functions
- Variable selection and subgroup analysis for high-dimensional censored data
- \(\ell_1\)-penalized quantile regression in high-dimensional sparse models
This page was built for publication: Distributed iterative hard thresholding for variable selection in Tobit models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922211)
