On the Differences between L2-Boosting and the Lasso

12/13/2018
by   Michael Vogt, et al.
0

We prove that L2-Boosting lacks a theoretical property which is central to the behaviour of l1-penalized methods such as basis pursuit and the Lasso: Whereas l1-penalized methods are guaranteed to recover the sparse parameter vector in a high-dimensional linear model under an appropriate restricted nullspace property, L2-Boosting is not guaranteed to do so. Hence, L2-Boosting behaves quite differently from l1-penalized methods when it comes to parameter recovery/estimation in high-dimensional linear models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/14/2022

Early stopping for L^2-boosting in high-dimensional linear models

Increasingly high-dimensional data sets require that estimation methods ...
research
10/25/2019

Boosting heritability: estimating the genetic component of phenotypic variation with multiple sample splitting

Heritability is a central measure in genetics quantifying how much of th...
research
05/04/2018

Hedging parameter selection for basis pursuit

In Compressed Sensing and high dimensional estimation, signal recovery o...
research
02/05/2020

A Precise High-Dimensional Asymptotic Theory for Boosting and Min-L1-Norm Interpolated Classifiers

This paper establishes a precise high-dimensional asymptotic theory for ...
research
07/19/2023

Pattern Recovery in Penalized and Thresholded Estimation and its Geometry

We consider the framework of penalized estimation where the penalty term...
research
02/29/2016

High-Dimensional L_2Boosting: Rate of Convergence

Boosting is one of the most significant developments in machine learning...
research
05/04/2023

Using interpretable boosting algorithms for modeling environmental and agricultural data

We describe how interpretable boosting algorithms based on ridge-regular...

Please sign up or login with your details

Forgot password? Click here to reset