atlas

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

Learning Bounds for Greedy Approximation with Explicit Feature Maps from Multiple Kernels

NeurIPS 2018 · Learning theory and algorithms › Kernels and regression theory · approach: RKHS kernel methods · 5 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
Select explicit features greedily by gradient correlation instead of using GLKKernel approximation · Year predictiontest error (%): 5.08 -> 4.78Helped
Select explicit features greedily rather than use EERF random featuresKernel approximation · Online news popularitytest error (%): 1.63% to 0.57%Helped
Select explicit features greedily instead of using GLKKernel approximation · Online news popularitytest error (%): 0.14 -> 0.57Hurt
Select explicit features greedily instead of using GLKKernel approximation · Adulttest error (%): 15.22 -> 15.10Helped
Select explicit features greedily instead of using GKKernel approximation · Epileptic seizure recognitiontest error (%): 2.82 -> 4.73Hurt

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