Research map / Optimization / Nonconvex and smooth optimization
Extrapolation Towards Imaginary 0-Nearest Neighbour and Its Improved Convergence Rate
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.
Closest papers by meaning
- k*-Nearest Neighbors: From Global to Local (NeurIPS 2016 · similarity 0.89)
- Distributionally robust weighted k-nearest neighbors (NeurIPS 2022 · similarity 0.89)
- An adaptive nearest neighbor rule for classification (NeurIPS 2019 · similarity 0.87)
- On Convergence of Nearest Neighbor Classifiers over Feature Transformations (NeurIPS 2020 · similarity 0.87)
- Shapley-Based Data Valuation for Weighted $k$-Nearest Neighbors (NeurIPS 2025 · similarity 0.86)
- Weighted distance nearest neighbor condensing (ICML 2024 · similarity 0.83)
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.