Statistical Optimality of Interpolated Nearest Neighbor Algorithms
원문 초록
In the era of deep learning, understanding over-fitting phenomenon becomes increasingly important. It is observed that carefully designed deep neural networks achieve small testing error even when the training error is close to zero. One possible explanation is that for many modern machine learning algorithms, over-fitting can greatly reduce the estimation bias, while not increasing the estimation variance too much. To illustrate the above idea, we prove that the proposed interpolated nearest neighbor algorithm achieves the minimax optimal rate in both regression and classification regimes, and observe that they are empirically better than the traditional $k$ nearest neighbor method in some cases.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Performing Image Classification for 10 Different Monkey Species using CNN
Extraction of Heart Rate from PPG Signal: A Machine Learning Approach using Decision Tree Regression Algorithm
Statistical characterization and classification of colon microarray gene expression data using multiple machine learning paradigms
Enhanced network anomaly detection based on deep neural networks
Using Data Mining to Predict Hospital Admissions From the Emergency Department
ExploreKit: Automatic Feature Generation and Selection
토론
이 논문과 연결된 포럼 글이 아직 없습니다.