Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Anchor-based Nearest Class Mean Loss for Convolutional Neural Networks (1804.08087v1)

Published 22 Apr 2018 in cs.CV

Abstract: Discriminative features are critical for machine learning applications. Most existing deep learning approaches, however, rely on convolutional neural networks (CNNs) for learning features, whose discriminant power is not explicitly enforced. In this paper, we propose a novel approach to train deep CNNs by imposing the intra-class compactness and the inter-class separability, so as to enhance the learned features' discriminant power. To this end, we introduce anchors, which are predefined vectors regarded as the centers for each class and fixed during training. Discriminative features are obtained by constraining the deep CNNs to map training samples to the corresponding anchors as close as possible. We propose two principles to select the anchors, and measure the proximity of two points using the Euclidean and cosine distance metric functions, which results in two novel loss functions. These loss functions require no sample pairs or triplets and can be efficiently optimized by batch stochastic gradient descent. We test the proposed method on three benchmark image classification datasets and demonstrate its promising results.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Fusheng Hao (2 papers)
  2. Jun Cheng (108 papers)
  3. Lei Wang (975 papers)
  4. Xinchao Wang (203 papers)
  5. Jianzhong Cao (1 paper)
  6. Xiping Hu (46 papers)
  7. Dapeng Tao (28 papers)
Citations (1)

Summary

We haven't generated a summary for this paper yet.