atlas

Research map / Learning theory and algorithms / Prediction and decision losses

A Two-Stage Active Learning Algorithm for k-Nearest Neighbors

ICML 2023 · Learning theory and algorithms › Prediction and decision losses · approach: Approximate nearest neighbor indexing · 1 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
Two-round active sampling: in round two, sample only from the estimated hard region (rejection sampling) versus passive sampling of all pointsk-NN classifier (modified k-NN with rejection-sampled second round) · theoretical analysis under beta-margin condition and smoothnessbound on disagreement with Bayes classifier (Pr(g* != g_hat))Helped
Consistency guarantee for the active scheme without any smoothness assumption on eta, provided x != X_(kbar+1)(x) for first-round sampleactive k-NN scheme · theory: convergence to Bayes risk as m growsR(g_hat) - R* convergence in probabilityHelped
Modify VC-dimension/tie-breaking: augmented balls in X x [0,1] for l_infinity space give VC bound 2daugmented ball class · theory: VC dimension of augmented ballsVC dimension boundNo clear effect

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