AI Paper Atlas

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

Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions

NeurIPS 2017 · Learning theory and algorithms › Kernels and regression theory · approach: Information-theoretic generalization bounds · 5 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 classic 1-NN with KSU compression-based 1-NN (gamma-net majority-vote with compression bound for scale selection)1-NN multiclass classifier in finite doubling-dimension metric spaces · finite doubling dimension metric spaces (theoretical)Bayes-consistency (strong)Helped
Use KSU (compression-based 1-NN) instead of k-NN on Preiss's infinite-dimensional constructionKSU vs k-NN · Preiss infinite-dimensional construction (Example 1)Bayes-consistency (weak)Helped
Use majority-vote gamma-net partitions with vanishing diameter that violate the packing property (ablation)Voronoi partition classifiers in infinite dimensions · Preiss infinite-dimensional constructionBayes-consistencyHurt

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