paper-with-me

홈 › Papers

Sharp Rate of Convergence for Deep Neural Network Classifiers under the Teacher-Student Setting

2020-01-19 · Tianyang Hu, Zuofeng Shang, Guang Cheng

Classifiers built with neural networks handle large-scale high dimensional data, such as facial images from computer vision, extremely well while traditional statistical methods often fail miserably. In this paper, we attempt to understand this empirical success in high dimensional classification by deriving the convergence rates of excess risk. In particular, a teacher-student framework is proposed that assumes the Bayes classifier to be expressed as ReLU neural networks. In this setup, we obtain a sharp rate of convergence, i.e., $\tilde{O}_d(n^{-2/3})$, for classifiers trained using either 0-1 loss or hinge loss. This rate can be further improved to $\tilde{O}_d(n^{-1})$ when the data distribution is separable. Here, $n$ denotes the sample size. An interesting observation is that the data dimension only contributes to the $\log(n)$ term in the above rates. This may provide one theoretical explanation for the empirical successes of deep neural networks in high dimensional classification, particularly for structured data.

📄 PDF Abstract BibTeX arXiv:2001.06892

Code (0)

등록된 구현이 없습니다.

Tasks

General Classification

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…

Similar Papers 제목 키워드 기반

Deep interpretable architecture for plant diseases classification

2019-05-31 · Mohammed Brahimi, Said Mahmoudi, Kamel Boukhalfa, Abdelouhab Moussaoui

Recently, many works have been inspired by the success of deep learning in computer vision for plant diseases classification. Unfortunately, these end-to-end deep classifiers lack transparency which can limit their adopt…

ClassificationGeneral Classification

Estimating a sharp convergence bound for randomized ensembles

2013-03-04 · Miles E. Lopes

When randomized ensembles such as bagging or random forests are used for binary classification, the prediction error of the ensemble tends to decrease and stabilize as the number of classifiers increases. However, the pr…

Binary ClassificationDensity EstimationPrediction

Residual-as-Teacher: Mitigating Bias Propagation in Student--Teacher Estimation

2026-03-26 · Kakei Yamamoto, Martin J. Wainwright arxiv

We study statistical estimation in a student--teacher setting, where predictions from a pre-trained teacher are used to guide a student model. A standard approach is to train the student to directly match the teacher's o…

Classification with Deep Neural Networks and Logistic Loss

2023-07-31 · Zihan Zhang, Lei Shi, Ding-Xuan Zhou

Deep neural networks (DNNs) trained with the logistic loss (i.e., the cross entropy loss) have made impressive advancements in various binary classification tasks. However, generalization analysis for binary classificati…

Binary ClassificationClassificationGeneralization Bounds

SADT: Combining Sharpness-Aware Minimization with Self-Distillation for Improved Model Generalization

2022-11-01 · Masud An-Nur Islam Fahim, Jani Boutellier

Methods for improving deep neural network training times and model generalizability consist of various data augmentation, regularization, and optimization approaches, which tend to be sensitive to hyperparameter settings…

Data Augmentation