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,742 papers · 148 categories

Trend · papers per month

4118231,2341,645 · Jun 202019922001200920172026
48 results for self-supervised metric learning

Self-supervised metric learning boosts downstream tasks in multi-view data.

problem Improving distance-based downstream tasks without labeled data.
method Developed a statistical framework to study self-supervised metric learning in multi-view data.
result Self-supervised metric learning improves target distances for various downstream tasks.

DM improves self-supervised transfer learning by matching target distributions.

problem Improving self-supervised transfer learning performance.
method Distribution Matching (DM) method that drives representation distribution towards a predefined reference distribution.
result DM outperforms existing methods on target classification tasks.

Paper proposes a new autoencoder metric for balanced learning in imbalanced tabular datasets.

problem Challenges of imbalanced self-supervised learning in tabular data.
method Developed a Multi-Supervised Balanced MSE metric to balance learning.
result The new metric outperforms standard MSE in imbalanced datasets.

Inspection-L detects illicit cryptocurrency transactions using GNNs and self-supervised learning.

problem Detect illicit cryptocurrency transactions for anti-money laundering.
method Graph Neural Network (GNN) framework based on self-supervised Deep Graph Infomax (DGI) and Graph Isomorphism Network (GIN) with supervised learning algorithms.
result Inspection-L outperforms state-of-the-art methods in key classification metrics.

This research evaluates the quality of unsupervised embeddings using linear separability metrics.

problem Difficulty in evaluating unsupervised learning model performance in practice.
method Survey and introduction of three methods, including a novel one, to assess embedding quality.
result Metrics can robustly estimate embedding quality in an unsupervised way.

S4 learns new self-supervision automatically, improving accuracy with less human effort.

problem Lack of direct supervision in machine learning.
method Combines deep learning and probabilistic logic to automatically generate and verify new self-supervision.
result S4 can automatically propose accurate self-supervision, matching supervised methods with less human effort.

Geometric theory of projection heads in self-supervised learning.

problem Dimensional collapse and information invariance trade-off in projection heads.
method Geometric modeling of projection heads as Riemannian metrics, analyzing Hessian eigenvalues, and tracking optimization geometry.
result Smooth nonlinear heads induce negative curvature, preventing collapse; linear and ReLU heads cannot.

Researchers propose a new SSL risk decomposition method to evaluate and improve self-supervised learning models.

problem Self-supervised learning evaluation is limited to a single metric, providing little insight into model performance and improvement.
method Proposes an SSL risk decomposition that considers four error components: approximation, representation usability, probe generalization, and encoder generalization.
result Analysis of 169 SSL vision models reveals the main sources of error and provides insights for improving SSL models in specific settings.

The paper accelerates LLM inference by adding early exit heads trained in a self-supervised manner.

problem Inference speed in large language models (LLMs) is slow and resource-intensive.
method Adding self-supervised early exit heads at intermediate transformer layers to stop computation early based on confidence thresholds.
result Entropy provides the most reliable confidence metric for stopping computation early.

Self-supervised learning excels in topic modeling by being less model-specific.

problem How self-supervised learning discovers useful representations in topic models.
method Applying self-supervised learning objectives to topic model-generated data.
result Self-supervised learning objectives can recover useful posterior information for topic models, outperforming misspecified models.

Survey of self-supervised learning methods in computer vision, NLP, and graph learning.

problem Manual labeling and vulnerability to attacks in supervised learning.
method Generative, contrastive, and generative-contrastive approaches.
result Self-supervised learning achieves high performance in representation learning.

This paper analyzes self-supervised learning from a multi-view perspective.

problem Understanding and optimizing self-supervised learning from multi-view data.
method Information-theoretical framework to understand and design self-supervised learning objectives.
result Self-supervised representations can extract task-relevant information and discard task-irrelevant information.

Generative model explains self-supervised learning across various tasks.

problem Lack of theoretical understanding of self-supervised learning methods.
method Generative latent variable model for self-supervised learning.
result Improves representation learning performance and narrows the gap between generative and discriminative methods.

This work improves adaptive conformal prediction using self-supervised learning.

problem Improving the adaptability of conformal prediction intervals.
method Train an auxiliary model with a self-supervised pretext task on top of an existing predictive model and use the self-supervised error as an additional feature to estimate nonconformity scores.
result Empirically demonstrates the benefit of additional information in improving the efficiency (width), deficit, and excess of conformal prediction intervals.

Paper tackles self-supervised learning for non-homophilous graphs.

problem Existing self-supervised learning methods assume homophilous graphs, but real-world graphs often lack this assumption.
method Develops a decoupled self-supervised learning (DSSL) framework that decouples different semantics between neighborhoods.
result DSSL framework achieves better performance on various graph benchmarks compared to competitive baselines.

We present a technique to improve the transferability of deep representations learned on small labeled datasets by introducing self-supervised tasks as auxiliary loss functions. While recent approaches for self-supervised learning have shown the benefits of training on large unlabeled datasets, we find improvements in …

2019-06-17abs ↗pdf ↗

Improved self-supervised learning on ImageNet achieves top-1 accuracy of 77.1%.

problem Self-supervised ResNets underperform supervised learning on ImageNet.
method ReLICv2 combines explicit invariance loss with contrastive objective over varied data views.
result ReLICv2 achieves 77.1% top-1 accuracy on ImageNet, improving over previous state-of-the-art by 1.5%.

New measure quantifies contrastive self-supervised learning's generalization ability.

problem Limited theoretical understanding of contrastive self-supervised learning's generalization.
method Defined (σ,δ)(σ,δ)-measure to mathematically quantify data augmentation and provide an upper bound for downstream classification error.
result Generalization ability is related to alignment of positive samples, divergence of class centers, and concentration of augmented data.

Plan2Explore learns new tasks efficiently through self-supervised planning.

problem Challenges in reinforcement learning, especially task-specific learning and sample efficiency.
method Self-supervised exploration and fast adaptation to new tasks through efficient planning.
result Plan2Explore outperforms prior methods in learning new tasks without supervision.

Paper analyzes self-supervised learning using causal methods and proposes a new objective.

problem Lack of theoretical understanding of self-supervised learning success.
method Uses a causal framework to enforce invariance constraints on proxy classifiers.
result ReLIC objective improves generalization guarantees and outperforms existing methods.

Self-supervised learning improves ECG classification performance.

problem Label scarcity in clinical 12-lead ECG data.
method Adapted self-supervised methods to ECG domain, focusing on contrastive representations and latent forecasting.
result Contrastive predictive coding adaptation yields linear evaluation performance only 0.5% below supervised performance.

New insights into how data transformations affect self-supervised clustering.

problem Impact of data transformations on self-supervised clustering convergence.
method Theoretical and empirical analysis of various data transformations.
result Certain transformations help in faster convergence of self-supervised clustering.

Efficiently builds diverse sub-model ensembles for robust self-supervised learning.

problem Challenges in diversity and efficiency of deep ensembles for self-supervised representation learning.
method Ensemble of independent sub-networks with a new loss function for diversity.
result Significantly improves prediction reliability and model calibration.

Self-supervised learning improves few-shot classification and segmentation on point clouds.

problem Efficiently learn from limited labeled data in point cloud applications.
method Hierarchical cover-tree partitioning for self-supervised pre-training; restricted to support set for few-shot learning.
result Self-supervised learning significantly improves downstream classification and segmentation accuracy.

Self-supervised and supervised methods learn similar intermediate visual representations but diverge in final layers.

problem Comparing self-supervised and supervised methods for visual learning.
method Comparison of contrastive self-supervised and supervised methods on simple image data.
result Contrastive and supervised methods learn similar intermediate representations but diverge in final layers.

New framework analyzes why more negative samples improve self-supervised learning performance.

problem Inconsistency between theoretical degradation and empirical improvement of downstream supervised tasks with more negative samples.
method Coupon collector's problem framework to analyze self-supervised representation learning with more negative samples.
result Bound can implicitly incorporate supervised loss in self-supervised loss by increasing negative samples.

This paper improves SSL methods using ensemble techniques with data-dependent weighted losses.

problem Improving SSL performance and robustness with large unlabeled data.
method Developed a framework for weighted cross-entropy losses in ensembling SSL methods without altering the backbone.
result Our method outperforms state-of-the-art SSL methods on ImageNet-1K, especially in few-shot learning.

Paper analyzes self-supervised image denoising with denatured data.

problem Understanding the performance of self-supervised image denoising with denatured data.
method Theoretical analysis and numerical experiments on a denoising algorithm.
result Theoretical analysis shows the algorithm finds desired solutions to the optimization problem.

Self-supervised learning helps train deep features without needing lots of labeled data.

problem Annotation bottleneck in deep learning.
method Four main families of self-supervised approaches applied to various data modalities.
result Self-supervised methods can now rival fully supervised pre-training across multiple data types.

We propose the first qualitative hypothesis characterizing the behavior of visual transformation based self-supervision, called the VTSS hypothesis. Given a dataset upon which a self-supervised task is performed while predicting instantiations of a transformation, the hypothesis states that if the predicted instantiati…

2019-11-24abs ↗pdf ↗

This paper reviews self-supervised learning methods for time series anomaly detection.

problem Challenges in traditional unsupervised methods for time series anomaly detection.
method Self-supervised learning techniques for time series anomaly detection.
result Enhanced performance of anomaly detectors through self-supervised learning.

This paper introduces a method to select and weight pretext tasks for better self-supervised speech representation learning.

problem Combining pretext tasks for better performance in self-supervised speech representation learning.
method Estimating calibrated weights for partial losses corresponding to pretext tasks during self-supervised training.
result Groups of selected and weighted pretext tasks perform better than classic baselines in automatic speech recognition and speaker/emotion recognition.

SinSim improves self-supervised learning by integrating optimal transport into contrastive learning.

problem Lack of explicit regularization in contrastive learning methods leads to suboptimal generalization.
method Integrates Sinkhorn regularization from optimal transport theory into SimCLR.
result SinSim outperforms SimCLR and other self-supervised methods on various datasets.

Self-supervised learning, which learns by constructing artificial labels given only the input signals, has recently gained considerable attention for learning representations with unlabeled datasets, i.e., learning without any human-annotated supervision. In this paper, we show that such a technique can be used to sign…

2019-10-14abs ↗pdf ↗