atlas

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

Rates of Convergence for Large-scale Nearest Neighbor Classification

NeurIPS 2019 · Learning theory and algorithms › Prediction and decision losses · approach: Approximate nearest neighbor indexing · 6 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
Divide the training data into partitions and aggregate local kNN predictions by majority votekNN classification · Binary classification under smoothness and margin assumptionsexcess risk convergence rate: N^{-α(β+1)/(2α+1)}No clear effect
Use bigNN instead of centralized oracle kNNkNN classification · Simulation 1prediction timeHelped
Increase the partitioning rate to γ≥0.4bigNN · CreditriskHurt
Pre-train labels using bigNN and predict with 1-NN on smaller subsamplesbigNN · Simulation 3prediction timeHelped
Use small prediction subsamples for denoised bigNNdenoised bigNN · Simulation 3regretHurt
Fix the neighbor count at k=5 instead of scaling it with sample size and partitions (ablation)bigNN · Simulation 2regret convergence rate: O(N^{-γ(1+β)/2})Mixed
Vary the number of prediction subsampling repeats I (ablation)denoised bigNN · Simulation 3regretNo 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