The following pages link to (Q3174171):
Displaying 25 items.
- Nearly unbiased variable selection under minimax concave penalty (Q117379) (← links)
- Multivariate Bernoulli distribution (Q373541) (← links)
- Blasso for object categorization and retrieval: towards interpretable visual models (Q408074) (← links)
- Boosting algorithms: regularization, prediction and model fitting (Q449780) (← links)
- Functional gradient ascent for probit regression (Q454437) (← links)
- A sharp nonasymptotic bound and phase diagram of \(L_{1/2}\) regularization (Q477827) (← links)
- Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875) (← links)
- Variational approximation for heteroscedastic linear models and matching pursuit algorithms (Q746230) (← links)
- Shrinkage and model selection with correlated variables via weighted fusion (Q961274) (← links)
- Least angle and \(\ell _{1}\) penalized regression: a review (Q975564) (← links)
- Lasso-type recovery of sparse representations for high-dimensional data (Q1002157) (← links)
- The composite absolute penalties family for grouped and hierarchical variable selection (Q1043749) (← links)
- Estimating the dimension of a model (Q1247128) (← links)
- A forward and backward stagewise algorithm for nonconvex loss functions with adaptive Lasso (Q1662870) (← links)
- Marginal false discovery rate for a penalized transformation survival model (Q2242009) (← links)
- ROS regression: integrating regularization with optimal scaling regression (Q2292391) (← links)
- Novel harmonic regularization approach for variable selection in Cox's proportional hazards model (Q2330191) (← links)
- Incremental relevance sample-feature machine: a fast marginal likelihood maximization approach for joint feature selection and classification (Q2417835) (← links)
- Concise comparative summaries (CCS) of large text corpora with a human experiment (Q2453687) (← links)
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization (Q3391453) (← links)
- Understanding large text corpora via sparse machine learning (Q4969899) (← links)
- (Q5159420) (← links)
- Sobol Sensitivity: A Strategy for Feature Selection (Q5268903) (← links)
- Distributed online multi‐task sparse identification for multiple systems with asynchronous updates (Q6117510) (← links)
- Multi-task sparse identification for closed-loop systems with general observation sequences (Q6157363) (← links)
