scientific article

zbMath1222.68155MaRDI QIDQ3093379

Bin Yu

Publication date: 12 October 2011

Full work available at URL: http://www.jmlr.org/papers/v7/buehlmann06a.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

model selectionregressionlassominimum description length (MDL)nonnegative garrote

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (26)

AdaBoost Semiparametric Model Averaging Prediction for Multiple Categories ⋮ Two-step sparse boosting for high-dimensional longitudinal data with varying coefficients ⋮ A new approach of subgroup identification for high-dimensional longitudinal data ⋮ Conditional sparse boosting for high-dimensional instrumental variable estimation ⋮ Wavelet-based gradient boosting ⋮ A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers ⋮ An update on statistical boosting in biomedicine ⋮ Regularization in statistics ⋮ Aggregation of estimators and stochastic optimization ⋮ Estimation and inference of treatment effects with \(L_2\)-boosting in high-dimensional settings ⋮ Gradient boosting for distributional regression: faster tuning and improved variable selection via noncyclical updates ⋮ Boosting algorithms: regularization, prediction and model fitting ⋮ Rodeo: Sparse, greedy nonparametric regression ⋮ Boosting nonlinear additive autoregressive time series ⋮ Additive monotone regression in high and lower dimensions ⋮ Remembering Leo Breiman ⋮ Remembrance of Leo Breiman ⋮ Least angle and \(\ell _{1}\) penalized regression: a review ⋮ Boosting for high-dimensional linear models ⋮ On the differences between \(L_2\) boosting and the Lasso ⋮ Component-wisely sparse boosting ⋮ Iterative bias reduction: a comparative study ⋮ Understanding large text corpora via sparse machine learning ⋮ Boosted sparse nonlinear distance metric learning ⋮ Knot selection by boosting techniques ⋮ A likelihood-based boosting algorithm for factor analysis models with binary data

This page was built for publication: