Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping (Q6072435)

scientific article; zbMATH DE number 7749930

Language	Label	Description	Also known as
English	Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping	scientific article; zbMATH DE number 7749930

Statements

instance of

scholarly article

0 references

title

Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping (English)

0 references

published in

Neural Networks

0 references

publication date

13 October 2023

0 references

full work available at URL

https://arxiv.org/abs/2004.00179

0 references

zbMATH Keywords

boosting

0 references

learning theory

0 references

squared hinge

0 references

fully corrective greedy

0 references

early stopping

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

An $L_{2}$-Boosting Algorithm for Estimation of a Regression Function

0 references

Approximation and learning by greedy algorithms

0 references

Convexity, Classification, and Risk Bounds

0 references

Q3174158

0 references

Accelerated gradient boosting

0 references

Q3093367

0 references

Random forests

0 references

Boosting With the<i>L</i><sub>2</sub>Loss

0 references

Learning rates of multi-kernel regression by orthogonal greedy algorithm

0 references

Learning Theory

0 references

Boosting a weak learning algorithm by majority

0 references

A decision-theoretic generalization of on-line learning and an application to boosting

0 references

Greedy function approximation: A gradient boosting machine.

0 references

Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)

0 references

A dual algorithm for the solution of nonlinear variational problems via finite element approximation

0 references

Q4144736

0 references

A distribution-free theory of nonparametric regression

0 references

Forward stagewise regression and the monotone lasso

0 references

The elements of statistical learning. Data mining, inference, and prediction

0 references

On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method

0 references

Q4633060

0 references

Learning Rates for Classification with Gaussian Kernels

0 references

Distributed kernel-based gradient descent algorithms

0 references

Lower bounds for the rate of convergence of greedy algorithms

0 references

10.1162/15324430152748218

0 references

The Rate of Convergence of AdaBoost

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Q4013554

0 references

Trading Accuracy for Sparsity in Optimization Problems with Sparsity Constraints

0 references

Concentration estimates for learning with $\ell ^{1}$-regularizer and data dependent hypothesis spaces

0 references

Support Vector Machines

0 references

Fast rates for support vector machines using Gaussian kernels

0 references

Greedy approximation

0 references

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

0 references

Early Stopping for Kernel Boosting Algorithms: A General Analysis With Localized Complexities

0 references

Multi-kernel regularized classifiers

0 references

SVM Soft Margin Classifiers: Linear Programming versus Quadratic Programming

0 references

Classification with Gaussians and convex loss. II: Improving error bounds by noise conditions

0 references

Boosting with early stopping: convergence and consistency

0 references

Identifiers

arXiv ID

2004.00179

0 references

DOI

10.1016/j.neunet.2021.12.016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6072435