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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for SSL models

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.

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.

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.

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.

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.

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.

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.

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.

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.

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 ↗

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.

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.

MaxMatch improves SSL with worst-case consistency for better generalization.

problem Efficiently supervised learning with unlabeled data.
method Worst-case consistency regularization for SSL, providing a bound and an algorithm.
result The proposed method converges to a stationary point and improves generalization.

Paper analyzes high-dimensional GMM for SSL, showing RMLE near-optimal performance.

problem Understanding when and why SSL works well with unlabeled data.
method Message-passing and state evolution methods for high-dimensional settings.
result RMLE achieves near-optimal performance in estimation and prediction with appropriate regularization.

Semi-supervised learning improves prediction using unlabeled data.

problem Improving prediction performance using unlabeled data.
method General methodology for semi-supervised Empirical Risk Minimization (ERM) focusing on generalized linear regression.
result Adaptive SSL can achieve substantial improvement over supervised and null models in various settings.

JRFs improve semi-supervised learning by balancing generation and classification.

problem Mode missing and mode covering issues in GANs and VAEs, and conflict between good classification and generation.
method Joint-stochastic-approximation random fields (JRFs) for deep undirected generative models.
result JRFs achieve good classification and generation results in SSL.

AUC-spec optimizes graph-based SSL for complex label distributions.

problem Training accurate models with scarce labeled data and abundant unlabeled data.
method Computes a low-dimensional representation that maximizes class separation via AUC optimization.
result AUC-spec achieves competitive results on synthetic and 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.

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.

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.

The paper proposes a SSL framework for complex causal models using unlabelled data.

problem Understanding how unlabelled data can improve SSL in complex causal models.
method The paper explores flexible causal graph structures and designs causal generative models to generate synthetic labelled data.
result The proposed method effectively improves predictive model accuracy using synthetic labelled data generated from unlabelled data.

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.

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.

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.

New analysis reveals masked self-supervised learning's effectiveness in extracting data structure.

problem Analyzing masked self-supervised learning in high-dimensional data.
method Developed precise high-dimensional analysis of masked modeling objectives.
result Identified phase transitions and structured regimes for masked self-supervised learning.

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.