atlas

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

Active Nearest-Neighbor Learning in Metric Spaces

NeurIPS 2016 · Learning theory and algorithms › Prediction and decision losses · approach: Approximate nearest neighbor indexing · 12 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
Replace passive compression set construction (removing obstructing points, then t-net) with MARMANN's active label-efficient compression set via majority-vote labeling on a t/2-netnearest-neighbor classifier in general metric spaces · theoretical guarantee (Theorem 3.2)label complexityHelped
Generalized compression analysis allowing compression-set examples to take labels different from original labelsnearest-neighbor compression bound · theoretical bound (Theorem 4.1)generalization boundNo clear effect
Active model selection via binary-search over scales with label-bounded error estimation (SelectScale) instead of cross-validation over all scalesMARMANN scale selection · theoretical guarantee (Theorem 5.4, 5.5)label complexity and generalization boundHelped

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