atlas

Research map / Learning theory and algorithms / Kernels and regression theory

Early stopping for kernel boosting algorithms: A general analysis with localized complexities

NeurIPS 2017 · Learning theory and algorithms › Kernels and regression theory · approach: RKHS kernel methods · 17 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the theoretically selected stopping rule T = (7 n)^0.67 instead of the oracle gold-standard stopping timeL²-Boost · First-order Sobolev kernel simulationmean-squared errorMixed
Use the theoretically selected stopping rule T = (7 n)^0.67 instead of the oracle gold-standard stopping timeLogitBoost · First-order Sobolev kernel simulationmean-squared errorMixed
Use exponent κ = 0.33 instead of the theoretically optimal κ = 0.67 (ablation)L²-Boost · First-order Sobolev kernel simulationmean-squared errorHurt
Use exponent κ = 1 instead of the theoretically optimal κ = 0.67 (ablation)L²-Boost · First-order Sobolev kernel simulationmean-squared errorHurt
Use exponent κ = 0.33 instead of the theoretically optimal κ = 0.67 (ablation)LogitBoost · First-order Sobolev kernel simulationmean-squared errorHurt
Use exponent κ = 1 instead of the theoretically optimal κ = 0.67 (ablation)LogitBoost · First-order Sobolev kernel simulationmean-squared errorHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy