CLS measures dataset similarity through decision rule performance.
problem Measuring dataset similarity in machine learning, especially for transfer learning and domain adaptation.
method Cross-Learning Score (CLS) measures similarity through bidirectional generalization performance of decision rules, linking to cosine similarity under canonical linear models.
result CLS effectively measures dataset similarity and transferability, validated on synthetic and real-world datasets.
The paper studies batch decompositions of random datasets with probabilistic similarity constraints.
problem Understanding how to optimally split large datasets into batches for better model learning.
method Assumes independent data points from a space, defines similarity, and uses probabilistic and martingale methods to find bounds on batch sizes.
result Demonstrates an inherent tradeoff between relaxing similarity constraints and batch size, and provides bounds for maximum similarity subsets.
Develops a fast method to analyze image similarities without pre-trained models.
problem Lack of efficient methods to analyze fine-level similarities in large image datasets.
method Wavelet decomposition and numerical analysis tools.
result Identifies similar images in standard datasets (like CIFAR) in a few seconds.
Advocates Tversky's model for image similarity learning.
problem Learning Tversky similarity measures from image data.
method Computational approach using Tversky's ratio model.
result Performs well compared to existing methods on image datasets.
Topological parallax assesses AI models' geometric similarity to datasets for safety.
problem Ensuring AI models' robustness and safety in deep learning applications.
method Topological parallax compares a trained model to a reference dataset using Rips complexes and geodesic distortions.
result Topological parallax indicates whether a model shares similar multiscale geometric features with the dataset.
This paper tackles noise in raw datasets to improve representation learning efficiency.
problem Noise in real-world datasets degrades representation learning quality.
method Proposes denoising Cosine-Similarity (dCS) loss to learn robust representations.
result Empirical results show the dCS loss outperforms baseline objective functions.
Framework learns item representations from text data for complementary and similar items.
problem Generating accurate complementary item recommendations from textual data.
method Quadruplet network learning framework for latent space representation of items.
result Items are placed closer together in latent space for similar and complementary items compared to non-complementary items.
Automates similarity measure construction from data.
problem Defining similarity measures analytically is challenging.
method Applies machine learning to learn similarity measures from data.
result Data-driven similarity measure outperforms state of the art methods.
A new method selects the best feature selection technique for datasets.
problem Selecting the best feature selection method for unseen datasets.
method Data synthesis, meta features, fuzzy similarity, classification model training.
result Successfully recommended the best feature selection method for five out of eight datasets.
Adaptive methods learn from multiple datasets, leveraging similarities and robust to outliers.
problem Simultaneously analyze multiple datasets with possible similarities and differences.
method Adaptive multi-task learning methods that automatically utilize similarities and handle differences.
result Sharp statistical guarantees and robustness against outlier tasks demonstrated.
Paper proposes a deep learning method to measure domain similarity in Persian texts.
problem Measuring the similarity between different domains of Persian text descriptions.
method Built a dataset of paired texts, used word embeddings and deep neural networks to score similarity, trained on GPU.
result Best model achieved an F1 score of 0.9865.
Study reveals how data density affects similarity learning in noisy conditions.
problem Impact of noise on similarity learning in Siamese Neural Networks.
method Investigated Pair Label Noise and Single Label Noise on Siamese Neural Networks (SNNs).
result Data density is crucial for generalization in SNNs, leading to a phenomenon called DIBS.
Paper proposes a supervised similarity framework for corporate bonds using RF proximities.
problem Challenges in measuring similarity for corporate bonds due to noisy data and lack of ground truth.
method Proposes a supervised similarity framework using Random Forest for corporate bonds, introducing a novel metric to evaluate similarities.
result Random Forest outperforms other methods in evaluating similarities for corporate bonds.
Hyperparameter optimization aims to find the optimal hyperparameter configuration of a machine learning model, which provides the best performance on a validation dataset. Manual search usually leads to get stuck in a local hyperparameter configuration, and heavily depends on human intuition and experience. A simple al…
Similarity between objects is multi-faceted and it can be easier for human annotators to measure it when the focus is on a specific aspect. We consider the problem of mapping objects into view-specific embeddings where the distance between them is consistent with the similarity comparisons of the form "from the t-th vi…
SAVeD detects dataset versions without metadata, improving accuracy and separation.
problem Difficulty in identifying similar versions of structured datasets.
method Contrastive learning with modified SimCLR pipeline, generating and contrasting augmented table views.
result SAVeD achieves higher accuracy and separation scores on unseen tables.
A new dataset distance using optimal transport, agnostic of model and label sets.
problem Quantifying task similarity across datasets without model dependence.
method Optimal transport for model-agnostic dataset comparison.
result The new distance correlates with transfer learning difficulty across various datasets.
We propose weighted inner product similarity (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…
Dataset2Vec learns dataset meta-features without expert knowledge.
problem Learning meta-features for datasets requires expert domain knowledge.
method Dataset2Vec combines DeepSet architecture with hierarchical sets to learn meta-features.
result Meta-features learned by Dataset2Vec outperform engineered features.
Exploits class similarity for better machine learning models with confidence labels and projective loss functions.
problem Poor model performance due to confusing similar classes.
method Exploits class similarity with confidence labels and projective loss functions.
result Improved model performance on noisy labels.
Improves document summarization by combining word embeddings and n-grams.
problem Exact word matching fails to measure semantic similarity between sentences.
method Uses deep embedding features and tf-idf features to improve sentence similarity measure; builds an improved sentence similarity graph; employs a submodular objective function; develops a Transformer-based compression model.
result Outperforms tf-idf based approach and achieves state-of-the-art performance on DUC04 dataset.
STANCE learns string similarity using optimal transport alignment.
problem Computing similarity between strings for record linkage and entity resolution.
method Character encoding, optimal transport alignment, convolutional neural network scoring.
result STANCE outperforms state-of-the-art models on alias detection datasets.
Measuring the similarity of two files is an important task in malware analysis, with fuzzy hash functions being a popular approach. Traditional fuzzy hash functions are data agnostic: they do not learn from a particular dataset how to determine similarity; their behavior is fixed across all datasets. In this paper, we …
A novel unsupervised feature selection method using subspace clustering and self-expressive model.
problem Feature selection for large datasets with minimal labeling effort.
method Subspace clustering with adaptive representation learning and regularized regression.
result The method effectively captures sample similarities and discriminative information.
Proposes Vendi Score for evaluating diversity in ML models.
problem Lack of flexible diversity evaluation metrics in ML.
method Integrates ecological and quantum statistical mechanics concepts to define Vendi Score.
result Vendi Score enables flexible diversity evaluation without requiring a reference dataset.
Machine learning improves invoice matching speed and accuracy.
problem Efficiently matching similar invoices from various businesses and organizations.
method Combining machine learning with string similarity functions on invoice datasets.
result Neural network and boosted decision tree outperformed existing solutions.
InfoTuple efficiently selects larger tuple queries for ranking multiple objects, improving efficiency and consistency.
problem Efficiently selecting and ranking multiple objects for similarity learning.
method Adaptive selection method using mutual information maximization.
result InfoTuple outperforms state-of-the-art methods on synthetic and human response datasets.
When the training data in a two-class classification problem is overwhelmed by one class, most classification techniques fail to correctly identify the data points belonging to the underrepresented class. We propose Similarity-based Imbalanced Classification (SBIC) that learns patterns in the training data based on an …
FDive helps analysts create relevant patterns in high-dimensional datasets.
problem Difficult detection of relevant patterns in large, high-dimensional datasets.
method FDive uses a visual active learning system with pattern-based similarity measures to rank and classify data.
result FDive enhances the quality and understanding of relevance models, leading to new insights.
Deep learning improves forensic matching of casings.
problem Identifying if two casings came from the same firearm.
method Contrastive neural networks trained on casings dataset.
result Contrastive learning achieved better ROC AUC than CMC.
Quantum-assisted VAE improves similarity search in high-dimensional datasets.
problem Finding fast and memory-efficient similarity search in high-dimensional data.
method Construct a space-efficient search index based on the latent space of a Quantum-assisted Variational Autoencoder (QVAE).
result Real-world speedups and memory-efficient scaling to half a billion data points.
Learning a similarity metric has gained much attention recently, where the goal is to learn a function that maps input patterns to a target space while preserving the semantic distance in the input space. While most related work focused on images, we focus instead on learning a similarity metric for neuroimages, such a…
New method learns distances and similarities robustly from noisy data.
problem Scalability and robustness in metric learning for large datasets.
method Robust online Distance-Similarity learning with Rescaled hinge loss.
result Significantly outperforms state-of-the-art methods in noisy data.
We consider the problem of classification using similarity/distance functions over data. Specifically, we propose a framework for defining the goodness of a (dis)similarity function with respect to a given learning task and propose algorithms that have guaranteed generalization properties when working with such good fu…
A good measure of similarity between data points is crucial to many tasks in machine learning. Similarity and metric learning methods learn such measures automatically from data, but they do not scale well respect to the dimensionality of the data. In this paper, we propose a method that can learn efficiently similarit…
Geospatial analysis lacks methods like the word vector representations and pre-trained networks that significantly boost performance across a wide range of natural language and computer vision tasks. To fill this gap, we introduce Tile2Vec, an unsupervised representation learning algorithm that extends the distribution…
In this report, we present an unsupervised machine learning method for determining groups of molecular systems according to similarity in their dynamics or structures using Ward's minimum variance objective function. We first apply the minimum variance clustering to a set of simulated tripeptides using the information …
Proposes a method to preserve graph similarities for better clustering accuracy.
problem Sub-optimal performance due to non-similarity-preserving kernels in graph-based clustering.
method Adaptive graph learning method that preserves pairwise similarities and unifies clustering and graph learning.
result Improves clustering accuracy by preserving pairwise similarities in the graph.
Learning a model of perceptual similarity from a collection of objects is a fundamental task in machine learning underlying numerous applications. A common way to learn such a model is from relative comparisons in the form of triplets: responses to queries of the form "Is object a more similar to b than it is to c?". I…
Proposes MGMN for end-to-end graph similarity learning.
problem Lack of cross-level interactions in graph similarity learning.
method Multi-level graph matching network (MGMN) combining node-graph matching and siamese graph neural networks.
result MGMN outperforms state-of-the-art models on graph-graph classification and regression tasks.
Neural networks auto-denoise similar inputs, enabling new statistical analysis.
problem Estimating similarity of inputs for neural networks.
method Define and quantify similarity from neural network perspective, using parameter variation impact on outputs.
result Estimate sample density and quantify denoising effect without true labels.
Paper tackles noisy similarity labels for multi-class classification.
problem Learning multi-class classifiers from noisy similarity-labeled data.
method Proposes a method using a noise transition matrix to learn from noisy data.
result Demonstrates superior performance compared to state-of-the-art methods.
MixMOOD improves SSDL by selecting unlabelled data based on deep feature similarity.
problem Class distribution mismatch in semi-supervised learning.
method MixMOOD uses deep dataset dissimilarity measures to select unlabelled data.
result MixMOOD selects unlabelled data based on strong correlation with MixMatch accuracy.
Develops a method for manifold learning with small sample size datasets.
problem Improving manifold learning performance for multiple tasks with limited samples.
method Uses instance and model transfer to integrate manifold models from similar tasks.
result Successfully estimates manifolds with tiny sample sizes across multiple tasks.
Synthetic telematics dataset created from insurance claims data.
problem Creating a reliable synthetic dataset for usage-based insurance models.
method Three-stage process using machine learning: binary classification, regression, and synthetic oversampling.
result Synthetic dataset remarkably similar to real data in risk assessment models.
Supervised learning has been very successful for automatic segmentation of images from a single scanner. However, several papers report deteriorated performances when using classifiers trained on images from one scanner to segment images from other scanners. We propose a transfer learning classifier that adapts to diff…
Similarity metrics are a core component of many information retrieval and machine learning systems. In this work we propose a method capable of learning a similarity metric from data equipped with a binary relation. By considering only the similarity constraints, and initially ignoring the features, we are able to lear…
Clustering is an underspecified task: there are no universal criteria for what makes a good clustering. This is especially true for relational data, where similarity can be based on the features of individuals, the relationships between them, or a mix of both. Existing methods for relational clustering have strong and …