paper-with-me

홈 › Papers

A Decidability-Based Loss Function

2021-09-12 · Pedro Silva, Gladston Moreira, Vander Freitas, Rodrigo Silva, David Menotti, Eduardo Luz

Nowadays, deep learning is the standard approach for a wide range of problems, including biometrics, such as face recognition and speech recognition, etc. Biometric problems often use deep learning models to extract features from images, also known as embeddings. Moreover, the loss function used during training strongly influences the quality of the generated embeddings. In this work, a loss function based on the decidability index is proposed to improve the quality of embeddings for the verification routine. Our proposal, the D-loss, avoids some Triplet-based loss disadvantages such as the use of hard samples and tricky parameter tuning, which can lead to slow convergence. The proposed approach is compared against the Softmax (cross-entropy), Triplets Soft-Hard, and the Multi Similarity losses in four different benchmarks: MNIST, Fashion-MNIST, CIFAR10 and CASIA-IrisV4. The achieved results show the efficacy of the proposal when compared to other popular metrics in the literature. The D-loss computation, besides being simple, non-parametric and easy to implement, favors both the inter-class and intra-class scenarios.

📄 PDF Abstract BibTeX arXiv:2109.05524

Code (0)

등록된 구현이 없습니다.

Tasks

Face Recognitionspeech-recognitionSpeech RecognitionTriplet

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 제목 키워드 기반

PD-Loss: Proxy-Decidability for Efficient Metric Learning

2025-08-23 · Pedro Silva, Guilherme A. L. Silva, Pablo Coelho, Vander Freitas 외 arxiv

Deep Metric Learning (DML) aims to learn embedding functions that map semantically similar inputs to proximate points in a metric space while separating dissimilar ones. Existing methods, such as pairwise losses, are hin…

Computational EfficiencyFace VerificationMetric Learning

Trakhtenbrot's Theorem in Coq, A Constructive Approach to Finite Model Theory

2020-04-15 · Dominik Kirst, Dominique Larchey-Wendling

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on t…

Relation

Trakhtenbrot's Theorem in Coq: Finite Model Theory through the Constructive Lens

2021-04-29 · Dominik Kirst, Dominique Larchey-Wendling

We study finite first-order satisfiability (FSAT) in the constructive setting of dependent type theory. Employing synthetic accounts of enumerability and decidability, we give a full classification of FSAT depending on t…

Relation

Exploring Non-Regular Extensions of Propositional Dynamic Logic with Description-Logics Features

2023-07-19 · Bartosz Bednarczyk

We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extens…

Undecidability in Finite Transducers, Defense Systems and Finite Substitutions

2021-11-30 · Vesa Halava

In this manuscript we present a detailed proof for undecidability of the equivalence of finite substitutions on regular language $b\{0,1\}^*c$. The proof is based on the works of Leonid P. Lisovik.