atlas

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

Optimal Convergence Rates for Agnostic Nyström Kernel Learning

ICML 2023 · Learning theory and algorithms › Kernels and regression theory · approach: RKHS kernel methods

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
Nyström uniform sampling with landmark count M ≳ n^{1/(2r+γ)} under condition 2r+γ ≥ 1KRR-Nyström (uniform sampling) · agnostic setting (r in (0,1])excess risk rate O(n^{-2r/(2r+γ)})Helped
Nyström leverage-score (data-dependent) sampling with landmark count M ≳ n^{γ/(2r+γ)}KRR-Nyström (leverage scores sampling) · whole agnostic range r in (0,1]excess risk rate O(n^{-2r/(2r+γ)})Helped
Sample variance estimate using Bennett's inequality (N∞(λ) based bound instead of 1/(n√λ) bound)KRR-Nyström analysis · theoretical analysissample variance boundHelped
Data-dependent leverage-score sampling adds computation cost of O(N(λ)^2/λ) for samplingKRR-Nyström with leverage scores · agnostic setting r in (0,1)time complexityHurt

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