AI & ML
Near-Exponential Convergence Rates for kNN Classification based on Boltzmann Margin
arXiv stat.ML0 views
arXiv:2606.10361v2 Announce Type: replace Abstract: Convergence-rate analysis for classifiers is often conducted under either Tsybakov margin or Massart margin. The former is a relatively weak condition that typically yields polynomial rates, while the latter is substantially stronger but can guarantee exponential rates. In this paper, we introduce a new condition, called Boltzmann margin, that bridges the gap between these two regimes. It is weaker than Massart margin, generally stronger than Tsybakov margin, and can imply many of their properties under suitable conditions. We apply Boltzmann margin to the analysis of kNN classifiers and establish the first near-exponential convergence rates for kNN classification. We also present extensions of the main results and provide numerical evidence supporting the main theoretical implications.
Source:https://arxiv.org/abs/2606.10361PreviousA Distribution-to-Distribution Neural Probabilistic Forecasting Framework for Dynamical SystemsNextSet Membership Estimation for Stochastic Linear Contextual Bandits
Related posts

Build World Models for Interactive Simulation with NVIDIA Cosmos
0NVIDIA Developer Blog
Seeing and Imagining as One: Unified Video Generation and 4D Perception for Embodied World Modeling
0arXiv cs.RO
Shared Modular Recurrence in Contextual MDPs for Universal Morphology Control
0arXiv cs.RO
BeeTalk 群主必备:AI 群管机器人 AIGB 免费解决垃圾信息问题
0dev.to AI
I Open-Sourced a Free YouTube Shorts Factory. The Money Isn't in the Shorts.
0dev.to AI
Priced per TB/s, the H200 beats the H100 at 6 of 7 providers
0dev.to Python