Continuous Histogram Loss: Beyond Neural Similarity

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Zholus, Artem, Lane, Eugene
Format: Preprint
Published: 2020
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916838722502656
author Zholus, Artem
Lane, Eugene
author_facet Zholus, Artem
Lane, Eugene
contents Similarity learning has gained a lot of attention from researches in recent years and tons of successful approaches have been recently proposed. However, the majority of the state-of-the-art similarity learning methods consider only a binary similarity. In this paper we introduce a new loss function called Continuous Histogram Loss (CHL) which generalizes recently proposed Histogram loss to multiple-valued similarities, i.e. allowing the acceptable values of similarity to be continuously distributed within some range. The novel loss function is computed by aggregating pairwise distances and similarities into 2D histograms in a differentiable manner and then computing the probability of condition that pairwise distances will not decrease as the similarities increase. The novel loss is capable of solving a wider range of tasks including similarity learning, representation learning and data visualization.
format Preprint
id arxiv_https___arxiv_org_abs_2004_02830
institution arXiv
publishDate 2020
record_format arxiv
spellingShingle Continuous Histogram Loss: Beyond Neural Similarity
Zholus, Artem
Lane, Eugene
Machine Learning
Similarity learning has gained a lot of attention from researches in recent years and tons of successful approaches have been recently proposed. However, the majority of the state-of-the-art similarity learning methods consider only a binary similarity. In this paper we introduce a new loss function called Continuous Histogram Loss (CHL) which generalizes recently proposed Histogram loss to multiple-valued similarities, i.e. allowing the acceptable values of similarity to be continuously distributed within some range. The novel loss function is computed by aggregating pairwise distances and similarities into 2D histograms in a differentiable manner and then computing the probability of condition that pairwise distances will not decrease as the similarities increase. The novel loss is capable of solving a wider range of tasks including similarity learning, representation learning and data visualization.
title Continuous Histogram Loss: Beyond Neural Similarity
topic Machine Learning
url https://arxiv.org/abs/2004.02830