Generalized quantum similarity learning
- URL: http://arxiv.org/abs/2201.02310v1
- Date: Fri, 7 Jan 2022 03:28:19 GMT
- Title: Generalized quantum similarity learning
- Authors: Santosh Kumar Radha and Casey Jao
- Abstract summary: We propose using quantum networks (GQSim) for learning task-dependent (a)symmetric similarity between data that need not have the same dimensionality.
We demonstrate that the similarity measure derived using this technique is $(epsilon,gamma,tau)$-good, resulting in theoretically guaranteed performance.
- Score: 0.0
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: The similarity between objects is significant in a broad range of areas.
While similarity can be measured using off-the-shelf distance functions, they
may fail to capture the inherent meaning of similarity, which tends to depend
on the underlying data and task. Moreover, conventional distance functions
limit the space of similarity measures to be symmetric and do not directly
allow comparing objects from different spaces. We propose using quantum
networks (GQSim) for learning task-dependent (a)symmetric similarity between
data that need not have the same dimensionality. We analyze the properties of
such similarity function analytically (for a simple case) and numerically (for
a complex case) and showthat these similarity measures can extract salient
features of the data. We also demonstrate that the similarity measure derived
using this technique is $(\epsilon,\gamma,\tau)$-good, resulting in
theoretically guaranteed performance. Finally, we conclude by applying this
technique for three relevant applications - Classification, Graph Completion,
Generative modeling.
Related papers
- Quantifying Behavioural Distance Between Mathematical Expressions [0.0]
This paper proposes and implements a measure of a behavioral distance, BED, that clusters together expressions with similar errors.
Our findings also reveal that BED significantly improves the smoothness of the error landscape in the search space for symbolic regression.
arXiv Detail & Related papers (2024-08-21T10:48:04Z) - Going Beyond Neural Network Feature Similarity: The Network Feature
Complexity and Its Interpretation Using Category Theory [64.06519549649495]
We provide the definition of what we call functionally equivalent features.
These features produce equivalent output under certain transformations.
We propose an efficient algorithm named Iterative Feature Merging.
arXiv Detail & Related papers (2023-10-10T16:27:12Z) - Semantic similarity prediction is better than other semantic similarity
measures [5.176134438571082]
We argue that when we are only interested in measuring the semantic similarity, it is better to directly predict the similarity using a fine-tuned model for such a task.
Using a fine-tuned model for the Semantic Textual Similarity Benchmark tasks (STS-B) from the GLUE benchmark, we define the STSScore approach and show that the resulting similarity is better aligned with our expectations on a robust semantic similarity measure than other approaches.
arXiv Detail & Related papers (2023-09-22T08:11:01Z) - Evaluation of taxonomic and neural embedding methods for calculating
semantic similarity [0.0]
We study the mechanisms between taxonomic and distributional similarity measures.
We find that taxonomic similarity measures can depend on the shortest path length as a prime factor to predict semantic similarity.
The synergy of retrofitting neural embeddings with concept relations in similarity prediction may indicate a new trend to leverage knowledge bases on transfer learning.
arXiv Detail & Related papers (2022-09-30T02:54:21Z) - Comparing Apples to Oranges: Learning Similarity Functions for Data
Produced by Different Distributions [6.906621279967866]
We present an efficient sampling framework that learns these across-groups similarity functions.
We show analytical results with rigorous theoretical bounds, and empirically validate our algorithms.
arXiv Detail & Related papers (2022-08-26T15:38:05Z) - Attributable Visual Similarity Learning [90.69718495533144]
This paper proposes an attributable visual similarity learning (AVSL) framework for a more accurate and explainable similarity measure between images.
Motivated by the human semantic similarity cognition, we propose a generalized similarity learning paradigm to represent the similarity between two images with a graph.
Experiments on the CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate significant improvements over existing deep similarity learning methods.
arXiv Detail & Related papers (2022-03-28T17:35:31Z) - Kernel distance measures for time series, random fields and other
structured data [71.61147615789537]
kdiff is a novel kernel-based measure for estimating distances between instances of structured data.
It accounts for both self and cross similarities across the instances and is defined using a lower quantile of the distance distribution.
Some theoretical results are provided for separability conditions using kdiff as a distance measure for clustering and classification problems.
arXiv Detail & Related papers (2021-09-29T22:54:17Z) - Instance Similarity Learning for Unsupervised Feature Representation [83.31011038813459]
We propose an instance similarity learning (ISL) method for unsupervised feature representation.
We employ the Generative Adversarial Networks (GAN) to mine the underlying feature manifold.
Experiments on image classification demonstrate the superiority of our method compared with the state-of-the-art methods.
arXiv Detail & Related papers (2021-08-05T16:42:06Z) - The role of feature space in atomistic learning [62.997667081978825]
Physically-inspired descriptors play a key role in the application of machine-learning techniques to atomistic simulations.
We introduce a framework to compare different sets of descriptors, and different ways of transforming them by means of metrics and kernels.
We compare representations built in terms of n-body correlations of the atom density, quantitatively assessing the information loss associated with the use of low-order features.
arXiv Detail & Related papers (2020-09-06T14:12:09Z) - Few-shot Visual Reasoning with Meta-analogical Contrastive Learning [141.2562447971]
We propose to solve a few-shot (or low-shot) visual reasoning problem, by resorting to analogical reasoning.
We extract structural relationships between elements in both domains, and enforce them to be as similar as possible with analogical learning.
We validate our method on RAVEN dataset, on which it outperforms state-of-the-art method, with larger gains when the training data is scarce.
arXiv Detail & Related papers (2020-07-23T14:00:34Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.