Hard-Mining Loss based Convolutional Neural Network for Face Recognition
Yash Srivastava, Vaishnav Murali, Shiv Ram Dubey

TL;DR
This paper introduces a Hard-Mining loss function that emphasizes hard samples during training, improving face recognition accuracy when combined with existing loss functions like ArcFace on standard datasets.
Contribution
It proposes a generic Hard-Mining loss that enhances existing loss functions by prioritizing hard samples, leading to improved face recognition performance.
Findings
Hard-Mining loss boosts accuracy of existing loss functions.
Improved performance on LFW and YTF datasets.
Effective with multiple loss functions like ArcFace and Softmax.
Abstract
Face Recognition is one of the prominent problems in the computer vision domain. Witnessing advances in deep learning, significant work has been observed in face recognition, which touched upon various parts of the recognition framework like Convolutional Neural Network (CNN), Layers, Loss functions, etc. Various loss functions such as Cross-Entropy, Angular-Softmax and ArcFace have been introduced to learn the weights of network for face recognition. However, these loss functions do not give high priority to the hard samples as compared to the easy samples. Moreover, their learning process is biased due to a number of easy examples compared to hard examples. In this paper, we address this issue by considering hard examples with more priority. In order to do so, We propose a Hard-Mining loss by increasing the loss for harder examples and decreasing the loss for easy examples. The…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsAdditive Angular Margin Loss
