Research map / Learning theory and algorithms / Prediction and decision losses
Efficient Classification with Adaptive KNN
Puning Zhao, Lifeng Lai
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 changed | Where | Measured | Effect |
|---|---|---|---|
| Set kmax sufficiently large | Adaptive kNN · Theorems 2 and 3 | excess-risk convergence rate: kmax ≳ N^{2γ/(2γ+1)} | Improved |
Closest papers by meaning
- Fast Rates for a kNN Classifier Robust to Unknown Asymmetric Label Noise (ICML 2019 · similarity 0.88)
- An adaptive nearest neighbor rule for classification (NeurIPS 2019 · similarity 0.86)
- Scalable Learning of Bayesian Network Classifiers (JMLR 2016 · similarity 0.85)
- On Convergence of Nearest Neighbor Classifiers over Feature Transformations (NeurIPS 2020 · similarity 0.85)
- Distributionally robust weighted k-nearest neighbors (NeurIPS 2022 · similarity 0.83)
- Learning Bayesian Network Classifiers to Minimize the Class Variable Parameters (AAAI 2024 · similarity 0.82)
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.
