paper-with-me

홈 › Papers

P2SGrad: Refined Gradients for Optimizing Deep Face Models

2019-05-07 · CVPR 2019 6 · Xiao Zhang, Rui Zhao, Junjie Yan, Mengya Gao, Yu Qiao, Xiaogang Wang, Hongsheng Li

Cosine-based softmax losses significantly improve the performance of deep face recognition networks. However, these losses always include sensitive hyper-parameters which can make training process unstable, and it is very tricky to set suitable hyper parameters for a specific dataset. This paper addresses this challenge by directly designing the gradients for adaptively training deep neural networks. We first investigate and unify previous cosine softmax losses by analyzing their gradients. This unified view inspires us to propose a novel gradient called P2SGrad (Probability-to-Similarity Gradient), which leverages a cosine similarity instead of classification probability to directly update the testing metrics for updating neural network parameters. P2SGrad is adaptive and hyper-parameter free, which makes the training process more efficient and faster. We evaluate our P2SGrad on three face recognition benchmarks, LFW, MegaFace, and IJB-C. The results show that P2SGrad is stable in training, robust to noise, and achieves state-of-the-art performance on all the three benchmarks.

📄 PDF Abstract BibTeX arXiv:1905.02479

Code (0)

등록된 구현이 없습니다.

Tasks

Face Recognition

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Similar Papers 제목 키워드 기반

BAMSProd: A Step towards Generalizing the Adaptive Optimization Methods to Deep Binary Model

2020-09-29 · Junjie Liu, Dongchao Wen, Deyu Wang, Wei Tao 외

Recent methods have significantly reduced the performance degradation of Binary Neural Networks (BNNs), but guaranteeing the effective and efficient training of BNNs is an unsolved problem. The main reason is that the es…

Quantization

Double Adaptive Stochastic Gradient Optimization

2018-11-06 · Kin Gutierrez, Jin Li, Cristian Challu, Artur Dubrawski

Adaptive moment methods have been remarkably successful in deep learning optimization, particularly in the presence of noisy and/or sparse gradients. We further the advantages of adaptive moment techniques by proposing a…

Deep Learning

An Optimistic Acceleration of AMSGrad for Nonconvex Optimization

2019-03-04 · ICLR 2020 1 · Jun-Kun Wang, Xiaoyun Li, Belhal Karimi, Ping Li

We propose a new variant of AMSGrad, a popular adaptive gradient based optimization algorithm widely used for training deep neural networks. Our algorithm adds prior knowledge about the sequence of consecutive mini-batch…

DASGrad: Double Adaptive Stochastic Gradient

2019-09-25 · Kin Gutierrez, Cristian Challu, Jin Li, Artur Dubrawski

Adaptive moment methods have been remarkably successful for optimization under the presence of high dimensional or sparse gradients, in parallel to this, adaptive sampling probabilities for SGD have allowed optimizers to…

Transfer Learning

Generalizing Across Domains via Cross-Gradient Training

2018-04-28 · ICLR 2018 1 · Shiv Shankar, Vihari Piratla, Soumen Chakrabarti, Siddhartha Chaudhuri 외

We present CROSSGRAD, a method to use multi-domain training data to learn a classifier that generalizes to new domains. CROSSGRAD does not need an adaptation phase via labeled or unlabeled data, or domain features in the…

Data AugmentationDomain AdaptationDomain Generalization