A new perspective on boosting in linear regression via subgradient optimization and relatives

DOI10.1214/16-AOS1505zbMath1421.62086arXiv1505.04243MaRDI QIDQ682283

Rahul Mazumder, Paul Grigas, Robert M. Freund

Publication date: 14 February 2018

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04243

zbMATH Keywords

linear regressionboostingconvex prigramming

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Convex programming (90C25)

Related Items (8)

A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers ⋮ On the selection of predictors by using greedy algorithms and information theoretic criteria ⋮ Discussion of ``Best subset, forward stepwise or Lasso? Analysis and recommendations based on extensive comparisons ⋮ Restricted strong convexity implies weak submodularity ⋮ New analysis and results for the Frank-Wolfe method ⋮ Randomized Gradient Boosting Machine ⋮ Properties of subgradient projection iteration when applying to linear imaging system ⋮ Unnamed Item

This page was built for publication: A new perspective on boosting in linear regression via subgradient optimization and relatives