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

285684112 · Jun 202019922001200920172026
48 results for contrastive SSL

Flaky performance found in GNN SSL on RDBs, leading to worse linear evaluation.

problem Downstream task performances of GNN SSL on RDBs are poor.
method Proposed InfoNode to maximize mutual information between initial and final node representations.
result InfoNode improves GNN SSL performance on RDBs, supporting conjecture of conflict between SSL and GNN message passing.

This work defines idealized SSL representations and improves existing methods.

problem Unclear characteristics of SSL representations leading to high downstream accuracies.
method Characterized ideal properties and derived necessary and sufficient conditions.
result Improved SSL methods and derived new objectives for contrastive and non-contrastive learning.

Semi-supervised learning (SSL) provides a powerful framework for leveraging unlabeled data when labels are limited or expensive to obtain. SSL algorithms based on deep neural networks have recently proven successful on standard benchmark tasks. However, many of them have thus far been either inflexible, inefficient or …

2019-05-25abs ↗pdf ↗

Paper proposes a novel GCN-based SSL algorithm to enhance node representations using contrastive and generative losses.

problem Shortage of supervision in graph-based semi-supervised learning.
method Combines contrastive and generative graph convolutional networks to enrich supervision signals.
result Improves node representations and classification results on various real-world datasets.

Unified framework for self-supervised learning via latent distribution matching.

problem Lack of a unifying theoretical framework for diverse SSL methods.
method Casting SSL as latent distribution matching (LDM): maximizing alignment and uniformity.
result Derives a Bayesian filtering model and proves identifiable latent representations.

Unified framework for SSL methods linking contrastive and non-contrastive approaches.

problem Lack of theoretical foundations and design guidelines for SSL methods.
method Spectral manifold learning framework to unify SSL methods.
result Theoretical bridge between contrastive and non-contrastive methods.

Kernel-based SSL creates useful representations without labels.

problem Creating useful representations without labels using self-supervised learning.
method Derive methods for kernel-based SSL, focusing on contrastive and non-contrastive loss functions.
result Kernel-induced representations correlate related points and de-correlate unrelated ones.

A new SSL method using whitening of latent-space features.

problem Efficiency and effectiveness of self-supervised representation learning.
method Proposes a new loss function based on whitening of latent-space features, avoiding the need for negatives and asymmetric networks.
result Improves efficiency and effectiveness of SSL by avoiding the need for negatives and asymmetric networks.

Contrastive learning harms minority group representations, affecting downstream tasks.

problem Representation harm in contrastive learning, especially affecting minority groups.
method Causal mediation analysis and stochastic block model explanation.
result Representation harm in contrastive learning is partly responsible for allocation harm in downstream tasks.

MET learns tabular data representations without data augmentations.

problem Lack of effective self-supervised learning methods for tabular data.
method Reconstruction-based approach using masked encoding, with separate representations for each coordinate and adversarial reconstruction loss.
result MET achieves state-of-the-art performance on five diverse tabular datasets, improving up to 9% over current methods.

Novel bio-inspired masking for robust speech emotion recognition.

problem Noise degradation in speech emotion recognition.
method Cochlear cepstrogram-based contrastive learning with temporal and frequency masking.
result Improved speech emotion recognition performance on K-EmoCon benchmark.

Self-supervised learning performs better than supervised learning on imbalanced datasets.

problem The performance gap between balanced and imbalanced pre-training with self-supervised learning is smaller than with supervised learning.
method Systematic investigation of self-supervised learning under dataset imbalance, including experiments and theoretical analyses.
result Self-supervised representations are more robust to class imbalance than supervised representations.

New theory explains how equivariant self-supervised learning improves feature extraction.

problem Contrastive learning sacrifices useful features due to invariance to data augmentations.
method Information-theoretic perspective to understand E-SSL's generalization ability.
result Equivariant self-supervised learning creates synergy between equivariant and classification tasks.

We introduce Negative Sampling in Semi-Supervised Learning (NS3L), a simple, fast, easy to tune algorithm for semi-supervised learning (SSL). NS3L is motivated by the success of negative sampling/contrastive estimation. We demonstrate that adding the NS3L loss to state-of-the-art SSL algorithms, such as the Virtual Adv…

2019-11-12abs ↗pdf ↗

This work improves medical image segmentation with limited annotations using contrastive learning.

problem Lack of labeled data for medical image segmentation.
method Contrastive learning framework for semi-supervised segmentation with domain-specific and problem-specific cues.
result Significant improvements in segmentation performance compared to other methods.

CurvSSL improves SSL by aligning local manifold curvature.

problem Improving self-supervised learning by capturing local manifold geometry.
method CurvSSL augments Barlow Twins with a curvature-based regularizer to align and decorrelate embeddings across augmentations.
result Curvature-regularized SSL yields competitive or improved linear evaluation performance.

We explain SSL objectives as log-likelihoods in a data curation model.

problem Lack of understanding of SSL objectives as log-likelihoods.
method Formulate SSL objectives as a log-likelihood in a generative model of data curation.
result SSL methods can be understood as lower-bounds on a principled log-likelihood.

Semi-supervised learning benefits the rich more than the poor, affecting fairness.

problem Disparate impact of semi-supervised learning on different sub-populations.
method Theoretical and empirical analysis of a broad family of SSL algorithms using pseudo-labels.
result Semi-supervised learning benefits the rich more than the poor, potentially violating fairness.

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.

New theory explains how self-supervised learning converges, advancing AI research.

problem Lack of precise theoretical explanation for self-supervised learning convergence.
method Synthesized Identifiability Theory with empirical evidence to propose Singular Identifiability Theory (SITh).
result SITh provides deeper insights into SSL's implicit data assumptions and advances representation learning.

A new SSL method improves medical image classification using global latent mixing.

problem Costly annotation of large-scale medical image data sets.
method Linear mixing of labeled and unlabeled data in both input and latent space.
result Improved performance in semi-supervised classification of thoracic disease and skin lesion.

Maximizes image representation dependence for self-supervised learning.

problem Learning meaningful image representations from unlabeled data.
method Maximizes Hilbert-Schmidt Independence Criterion (HSIC) between image transformations and identity.
result Matches state-of-the-art performance on ImageNet and other vision tasks.

ST-STORM separates semantic and appearance features for robust representation learning.

problem Traditional SSL methods fail to capture appearance cues in critical applications.
method Hybrid SSL framework with two latent streams, Content and Style, disentangled through gating mechanisms.
result The Style branch effectively isolates complex appearance phenomena without degrading semantic performance.

Semi-supervised learning (SSL) provides a powerful framework for leveraging unlabeled data when labels are limited or expensive to obtain. SSL algorithms based on deep neural networks have recently proven successful on standard benchmark tasks. However, we argue that these benchmarks fail to address many issues that th…

2018-04-24abs ↗pdf ↗

A new framework decouples SSL tasks into VDA and VLC, revealing VDA's importance.

problem Designing effective self-supervised learning tasks without manual annotation.
method Borrowing a multi-view perspective, the paper decouples popular pretext tasks into VDA and VLC, focusing on VDA's role in feature learning.
result VDA tasks dominate SSL performance, and integrating predictions from augmented views improves overall performance.

Solves biased pseudo-labels in imbalanced SSL by refining them.

problem Imbalanced class distributions in semi-supervised learning lead to biased pseudo-labels.
method Formulates a convex optimization problem to refine pseudo-labels and develops an efficient algorithm, DARP.
result Demonstrates the effectiveness of DARP in various imbalanced semi-supervised scenarios.

A new probabilistic model for semi-supervised learning unifies various methods.

problem Combining different aspects of data distribution for semi-supervised learning.
method A probabilistic model that interprets and improves upon existing SSL methods.
result The model unifies various SSL methods and extends to neuro-symbolic learning.

Semi-supervised learning improves classification in high dimensions.

problem Combining labeled and unlabeled data for high-dimensional classification.
method Information theoretic and computational lower bounds analysis for feature selection.
result Semi-supervised learning is advantageous for classification in high dimensions.

This paper explores SSL for graph neural networks, improving performance on real-world datasets.

problem Leveraging unlabeled data for graph neural networks to improve deep learning performance.
method Empirical study of various SSL pretext tasks on graphs and proposing a new approach called SelfTask.
result Proposes SelfTask, achieving state-of-the-art performance on real-world datasets.

The study analyzes consistency-based SSL methods and proposes a new framework.

problem Improving performance in semi-supervised learning with minimal labeled data.
method Analysis of consistency-based SSL methods, including the ΠΠ-model, and proposing a new framework.
result A simple extension of the Hidden Manifold Model that incorporates data-augmentation schemes.