arXiv (Cornell University) · 2019 · 15 citations · 17 references
ComputingComputer ScienceFeature EngineeringMachine LearningStatistical LearningBias-variance TradeoffDeep LearningDimensionality ReductionEnsemble LearningEnsemble MethodsEnsemble ModelingAsymptotic PropertiesDropoutEnsemble Learning TheoryEnsemble RegressionEnsemble-based PredictionOrdinary Least SquaresRegularizationRidge Regression
Ensemble methods that average over a collection of independent predictors that are each limited to a subsampling of both the examples and features of the training data command a significant presence in machine learning, such as the ever-popular random forest, yet the nature of the subsampling effect, particularly of the features, is not well understood. We study the case of an ensemble of linear predictors, where each individual predictor is fit using ordinary least squares on a random submatrix of the data matrix. We show that, under standard Gaussianity assumptions, when the number of features selected for each predictor is optimally tuned, the asymptotic risk of a large ensemble is equal to the asymptotic ridge regression risk, which is known to be optimal among linear predictors in this setting. In addition to eliciting this implicit regularization that results from subsampling, we also connect this ensemble to the dropout technique used in training deep (neural) networks, another strategy that has been shown to have a ridge-like regularizing effect.
17
Leo Breiman · Machine Learning · 2001 · 126.2K citations · Full text
Dropout: a simple way to prevent neural networks from overfitting
Nitish Srivastava, Geoffrey E. Hinton, Alex Krizhevsky et al. · 2014 · 34.3K citations
Leo Breiman · Machine Learning · 1996 · 17K citations · Full text
Ridge Regression: Biased Estimation for Nonorthogonal Problems
Arthur E. Hoerl, Robert W. Kennard · Technometrics · 2000 · 6.6K citations