Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

71143214285 · Jun 202019922001200920172026
48 results for triplet loss

New method samples triplets from data distributions for training Triplet networks.

problem Training robust Triplet networks with discriminative triplets.
method Bayesian updating of multivariate normal distributions for dynamic class embedding sampling.
result Experimental validation on MNIST and histopathology CRC datasets shows effectiveness of the proposed method.

As an effective way of metric learning, triplet loss has been widely used in many deep learning tasks, including face recognition and person-ReID, leading to many states of the arts. The main innovation of triplet loss is using feature map to replace softmax in the classification task. Inspired by this concept, we prop…

2017-11-14abs ↗pdf ↗

Paper introduces new loss functions for Siamese networks using FDA.

problem Training Siamese networks with improved loss functions.
method Proposes Fisher Discriminant Triplet (FDT) and Fisher Discriminant Contrastive (FDC) loss functions based on FDA.
result Shows effectiveness of FDT and FDC on MNIST and histopathology datasets.

We analyze the semi-hard triplet loss using Edgeworth expansion for better understanding of its behavior.

problem Understanding the behavior of the semi-hard triplet loss function.
method Developed a higher-order asymptotic analysis using the Edgeworth expansion.
result Derived explicit Edgeworth expansions revealing first-order corrections in terms of the third cumulant.

A significant challenge for a supervised learning approach to inertial human activity recognition is the heterogeneity of data between individual users, resulting in very poor performance of impersonal algorithms for some subjects. We present an approach to personalized activity recognition based on deep embeddings der…

2020-01-15abs ↗pdf ↗

This paper shows how optimizing with hard negative examples improves image retrieval.

problem Training with hard negative examples leads to poor training behavior.
method Characterize the space of triplets, derive why hard negatives fail, and offer a fix to the loss function.
result Optimizing with hard negative examples leads to more generalizable features and better image retrieval.

New method accelerates large margin metric learning for nearest neighbor classification.

problem Efficiently learning metrics for nearest neighbor classification.
method Triplet mining and stratified sampling for large margin metric learning.
result Improved efficiency and scalability of optimization.

TristouNet is a neural network architecture based on Long Short-Term Memory recurrent networks, meant to project speech sequences into a fixed-dimensional euclidean space. Thanks to the triplet loss paradigm used for training, the resulting sequence embeddings can be compared directly with the euclidean distance, for s…

2016-09-14abs ↗pdf ↗

Paper proposes self-supervised method for accurate speaker diarization.

problem Speaker diarization without massive labeling effort.
method Introduces dynamic triplet loss and multinomial loss for audio-video synchronization.
result Best model yields +8% F1-score improvement and diarization error rate reduction.

Deep metric learning has been demonstrated to be highly effective in learning semantic representation and encoding information that can be used to measure data similarity, by relying on the embedding learned from metric learning. At the same time, variational autoencoder (VAE) has widely been used to approximate infere…

2018-02-13abs ↗pdf ↗

Learning from triplet comparison data has been extensively studied in the context of metric learning, where we want to learn a distance metric between two instances, and ordinal embedding, where we want to learn an embedding in an Euclidean space of the given instances that preserves the comparison order as well as pos…

2019-07-24abs ↗pdf ↗

Framework learns to transform majority to minority samples for balanced classification.

problem Imbalanced classification leading to biased predictions.
method Minimizes MMD and uses triplet loss for global alignment and boundary awareness.
result Consistent improvements over classical and generative baselines in AUROC, G-mean, F1-score, and MCC.

Distance metric learning (DML) approaches learn a transformation to a representation space where distance is in correspondence with a predefined notion of similarity. While such models offer a number of compelling benefits, it has been difficult for these to compete with modern classification algorithms in performance …

2015-11-18abs ↗pdf ↗

Paper proposes a new speech representation benchmark and model.

problem Lack of benchmarks for comparing speech representations.
method Unsupervised triplet-loss objective for training a universal non-semantic speech representation.
result Proposed representation outperforms other models on benchmark and transfer learning tasks.

We study safe screening for metric learning. Distance metric learning can optimize a metric over a set of triplets, each one of which is defined by a pair of same class instances and an instance in a different class. However, the number of possible triplets is quite huge even for a small dataset. Our safe triplet scree…

2018-02-12abs ↗pdf ↗

Despite the breakthroughs achieved by deep learning models in conventional supervised learning scenarios, their dependence on sufficient labeled training data in each class prevents effective applications of these deep models in situations where labeled training instances for a subset of novel classes are very sparse -…

2018-04-19abs ↗pdf ↗

This paper analyzes the stability and generalization of triplet learning algorithms.

problem Lack of theoretical understanding of triplet learning's generalization performance.
method Stability analysis and high-probability generalization bounds for triplet learning algorithms.
result Established general high-probability generalization bound for triplet learning algorithms.

Data analysis require a pairwise proximity measure over objects. Recent work has extended this to situations where the distance information between objects is given as comparison results of distances between three objects (triplets). Humans find the comparison tasks much easier than the exact distance computation and s…

2019-12-27abs ↗pdf ↗

Improved unsupervised probing for ranking tasks using Contrast-Consistent Ranking.

problem Improving self-consistency in language model rankings.
method Adapting Contrast-Consistent Search (CCS) to Contrast-Consistent Ranking (CCR) for ranking tasks.
result CCR probing outperforms prompting techniques across different models and datasets.

In automatic speech processing systems, speaker diarization is a crucial front-end component to separate segments from different speakers. Inspired by the recent success of deep neural networks (DNNs) in semantic inferencing, triplet loss-based architectures have been successfully used for this problem. However, existi…

2018-08-04abs ↗pdf ↗

Deep metric learning (DML) is a popular approach for images retrieval, solving verification (same or not) problems and addressing open set classification. Arguably, the most common DML approach is with triplet loss, despite significant advances in the area of DML. Triplet loss suffers from several issues such as collap…

2019-11-28abs ↗pdf ↗

In an independence model, the triplets that represent conditional independences between singletons are called elementary. It is known that the elementary triplets represent the independence model unambiguously under some conditions. In this paper, we show how this representation helps performing some operations with in…

2016-12-04abs ↗pdf ↗

Automatic cover detection -- the task of finding in a audio dataset all covers of a query track -- has long been a challenging theoretical problem in MIR community. It also became a practical need for music composers societies requiring to detect automatically if an audio excerpt embeds musical content belonging to the…

2019-10-22abs ↗pdf ↗

We consider the problem of classification in a comparison-based setting: given a set of objects, we only have access to triplet comparisons of the form "object xix_i is closer to object xjx_j than to object xkx_k." In this paper we introduce TripletBoost, a new method that can learn a classifier just from such triplet …

2018-10-31abs ↗pdf ↗

The work investigates deep generative models, which allow us to use training data from one domain to build a model for another domain. We propose the Variational Bi-domain Triplet Autoencoder (VBTA) that learns a joint distribution of objects from different domains. We extend the VBTAs objective function by the relativ…

2018-06-22abs ↗pdf ↗

Abstracts a construction of boundary triplets for self-adjoint elliptic problems.

problem Computing the index of families of self-adjoint elliptic boundary problems.
method Abstract axiomatic version of boundary triplets and their applications.
result Analytic proof of index theorem and computation of index differences.

Triplet networks are widely used models that are characterized by good performance in classification and retrieval tasks. In this work we propose to train a triplet network by putting it as the discriminator in Generative Adversarial Nets (GANs). We make use of the good capability of representation learning of the disc…

2017-04-06abs ↗pdf ↗

Study of symplectic trivialization and reduction of bundles with symmetry and connection.

problem Symplectic trivialization and reduction of bundles with symmetry and connection.
method Analysis of the Tulczyjew's triplet with an Ehresmann connection.
result Trivializations and reductions of iterated tangent and cotangent bundles.

Given only information in the form of similarity triplets "Object A is more similar to object B than to object C" about a data set, we propose two ways of defining a kernel function on the data set. While previous approaches construct a low-dimensional Euclidean embedding of the data set that reflects the given similar…

2016-07-28abs ↗pdf ↗

Deep metric learning is often used to learn an embedding function that captures the semantic differences within a dataset. A key factor in many problem domains is how this embedding generalizes to new classes of data. In observing many triplet selection strategies for Metric Learning, we find that the best performance …

2019-09-16abs ↗pdf ↗

Speaker embedding models that utilize neural networks to map utterances to a space where distances reflect similarity between speakers have driven recent progress in the speaker recognition task. However, there is still a significant performance gap between recognizing speakers in the training set and unseen speakers. …

2019-02-06abs ↗pdf ↗

Survey of spectral, probabilistic, and deep metric learning methods.

problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.

Many machine learning tasks such as clustering, classification, and dataset search benefit from embedding data points in a space where distances reflect notions of relative similarity as perceived by humans. A common way to construct such an embedding is to request triplet similarity queries to an oracle, comparing two…

2019-10-09abs ↗pdf ↗

To investigate objects without a describable notion of distance, one can gather ordinal information by asking triplet comparisons of the form "Is object xx closer to yy or is xx closer to zz?" In order to learn from such data, the objects are typically embedded in a Euclidean space while satisfying as many triplet …

2019-06-27abs ↗pdf ↗