paper-with-me

홈 › Papers

Intraclass clustering: an implicit learning ability that regularizes DNNs

2021-03-11 · ICLR 2021 1 · Carbonnelle Simon, Christophe De Vleeschouwer

Several works have shown that the regularization mechanisms underlying deep neural networks' generalization performances are still poorly understood. In this paper, we hypothesize that deep neural networks are regularized through their ability to extract meaningful clusters among the samples of a class. This constitutes an implicit form of regularization, as no explicit training mechanisms or supervision target such behaviour. To support our hypothesis, we design four different measures of intraclass clustering, based on the neuron- and layer-level representations of the training data. We then show that these measures constitute accurate predictors of generalization performance across variations of a large set of hyperparameters (learning rate, batch size, optimizer, weight decay, dropout rate, data augmentation, network depth and width).

📄 PDF Abstract BibTeX arXiv:2103.06733

Code (1)

simoncarbo/intraclass-clustering-measures

Tasks

ClusteringData Augmentation

Methods 이 논문이 사용한 방법론

Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…

Similar Papers 제목 키워드 기반

Wasserstein Adversarially Regularized Graph Autoencoder

2021-11-09 · Huidong Liang, Junbin Gao

This paper introduces Wasserstein Adversarially Regularized Graph Autoencoder (WARGA), an implicit generative algorithm that directly regularizes the latent distribution of node embedding to a target distribution via the…

ClusteringLink PredictionNode Clustering

Deep Relational Metric Learning

2021-08-23 · ICCV 2021 10 · Wenzhao Zheng, Borui Zhang, Jiwen Lu, Jie zhou

This paper presents a deep relational metric learning (DRML) framework for image clustering and retrieval. Most existing deep metric learning methods learn an embedding space with a general objective of increasing interc…

Image ClusteringMetric LearningRetrieval

Stochastic Rounding Implicitly Regularizes Tall-and-Thin Matrices

2024-03-18 · Gregory Dexter, Christos Boutsikas, Linkai Ma, Ilse C. F. Ipsen 외

Motivated by the popularity of stochastic rounding in the context of machine learning and the training of large-scale deep neural network models, we consider stochastic nearness rounding of real matrices $\mathbf{A}$ wit…

Learning Credible Deep Neural Networks with Rationale Regularization

2019-08-13 · Mengnan Du, Ninghao Liu, Fan Yang, Xia Hu

Recent explainability related studies have shown that state-of-the-art DNNs do not always adopt correct evidences to make decisions. It not only hampers their generalization but also makes them less likely to be trusted …

text-classificationText Classification

Implicit Bias in Deep Linear Discriminant Analysis

2026-03-03 · Jiawen Li arxiv

While the Implicit Bias(or Implicit Regularization) of standard loss functions has been studied, the optimization geometry induced by discriminative metric-learning objectives remains largely unexplored.To the best of ou…