Research map / Learning theory and algorithms / Prediction and decision losses
Distributionally robust weighted k-nearest neighbors
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.90)
- Extrapolation Towards Imaginary 0-Nearest Neighbour and Its Improved Convergence Rate (NeurIPS 2020 · similarity 0.89)
- On Convergence of Nearest Neighbor Classifiers over Feature Transformations (NeurIPS 2020 · similarity 0.87)
- Consistent Non-Parametric Methods for Maximizing Robustness (NeurIPS 2021 · similarity 0.87)
- An adaptive nearest neighbor rule for classification (NeurIPS 2019 · similarity 0.87)
- The optimality of kernel classifiers in Sobolev space (ICLR 2024 · similarity 0.84)
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.
