atlas

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

Tight Kernel Query Complexity of Kernel Ridge Regression and Kernel $k$-means Clustering

ICML 2019 · Learning theory and algorithms › Kernels and regression theory · approach: RKHS kernel methods · 2 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
Require a (1+ε)-relative approximation to the KRR minimizer on worst-case instancesKernel ridge regression · KRR, worst-case instanceskernel evaluations required: Ω(nd_eff^λ/ε) lower bound; O((nd_eff^λ/ε) log(nd_eff^λ/ε)) upper boundMixed
Require a (1+ε)-relative approximation to the clustering objective on worst-case instancesKernel k-means · Kernel k-means, worst-case instanceskernel queries required: Ω(nk/ε) lower bound; O((nk/ε) log(k/ε)) upper boundMixed
Restrict inputs to the stated mixture-of-Gaussians setting and use sketches of the input pointsKernel k-means · Kernel k-means, Gaussian mixtureskernel queries: Ω(nk/ε) worst-case lower bound; (n/ε) poly(log(k/ε)) upper boundHelped
Approximate the optimal cost rather than output an approximate clusteringKernel k-means · Kernel k-means, cost approximationkernel queries required: Ω(nk) lower bound; O(nk) + poly(k,1/ε,log n) upper boundMixed

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