Pith. sign in

REVIEW 2 cited by

Deep metric learning using Triplet network

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1412.6622 v4 pith:J5CYQZM2 submitted 2014-12-20 cs.LG cs.CVstat.ML

classification cs.LGcs.CVstat.ML
keywords learningmodelnetworkdeeprepresentationstripletusefulaims
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Deep learning has proven itself as a successful set of models for learning useful semantic representations of data. These, however, are mostly implicitly learned as part of a classification task. In this paper we propose the triplet network model, which aims to learn useful representations by distance comparisons. A similar model was defined by Wang et al. (2014), tailor made for learning a ranking for image information retrieval. Here we demonstrate using various datasets that our model learns a better representation than that of its immediate competitor, the Siamese network. We also discuss future possible usage as a framework for unsupervised learning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learning a Unified Embedding for Visual Search at Pinterest

    cs.CV 2019-08 conditional novelty 5.0 of 10

    A single multi-task metric learning embedding trained on engagement and human-labeled data outperformed Pinterest's three specialized visual search embeddings in offline, human, and A/B evaluations.

  2. A Study of BERT for Non-Factoid Question-Answering under Passage Length Constraints

    cs.IR 2019-08 conditional novelty 4.0 of 10

    BERT fine-tuning substantially improves non-factoid passage re-ranking over prior baselines, with a 256-token input window performing best and chunking providing a workaround for longer passages.

Pith tools