Contrastive learning adapts to data intrinsic dimensions, learning low-dimensional representations.
problem Learning high-dimensional representations from multi-modal data.
method Multi-modal contrastive learning with temperature optimization.
result Contrastive learning adapts to intrinsic dimensions of data, not specified dimensions.
SupSiam and SupBYOL improve supervised representation learning with ANCL.
problem Improving supervised representation learning with ANCL.
method Proposed supervised ANCL framework leveraging labels to avoid collapse.
result Supervised ANCL improves representation learning across various datasets and tasks.
Contrastive UCB improves RL by learning feature representations efficiently.
problem Improving feature learning in RL for online decision making.
method Proposes UCB-based contrastive learning algorithms for RL in MDPs and MGs.
result Proves sample efficiency in learning optimal policies and Nash equilibria.
Paper analyzes how contrastive learning structures learned representations.
problem Understanding the structure of learned representations in contrastive learning.
method Kernel-based contrastive learning framework (KCL) and statistical dependency viewpoint.
result Theoretical upper bound and generalization error bound for KCL.
SoftCLT improves time series representation learning by soft contrastive loss.
problem Ignoring inherent correlations in time series leads to poor representation quality.
method SoftCLT introduces instance-wise and temporal contrastive loss with soft assignments.
result SoftCLT consistently improves various downstream tasks in time series learning.
Efficient PAC learning for contrastive linear representations is achieved.
problem Efficient PAC learning for contrastive linear representations.
method Relaxing the problem to a semi-definite program and using Rademacher complexity.
result First efficient PAC learning algorithm for contrastive learning.
Paper introduces a simple method to assign uncertainty in contrastive learning models.
problem Contrastive learning models lack uncertainty measures.
method Trains a deep network to assign uncertainty based on representation variance.
result Deep uncertainty model improves anomaly detection and out-of-distribution classification.
C2VAE learns disentangled and coupled representations without prior knowledge.
problem Learning disentangled and coupled representations in latent space.
method Introduces C2VAE, a self-supervised VAE that factorizes posterior and uses Gaussian copula for dependencies. result Demonstrates strong effect in enhancing disentangled representation learning.
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.
i-Mix improves contrastive learning across domains without domain-specific augmentations.
problem Improving contrastive representation learning for unlabeled data across diverse domains.
method i-Mix treats contrastive learning as a non-parametric classifier problem, mixing data in input and virtual label spaces.
result i-Mix consistently improves representation quality across image, speech, and tabular data domains.
This paper reviews and proposes a unified framework for contrastive learning.
problem The origins and development of contrastive learning across various fields.
method A comprehensive literature review and a general Contrastive Representation Learning framework.
result A unified framework simplifies and unifies contrastive learning methods.
Proposes a novel graph representation learning framework using contrastive methods.
problem Graph representation learning for graph-structured data.
method Leverages a contrastive objective at the node level, generating two graph views by corruption and learning node representations by maximizing agreement.
result Consistently outperforms existing state-of-the-art methods on transductive and inductive learning tasks.
GraphCL learns node representations by maximizing similarity between perturbed node features.
problem Learning node representations in graph data without labeled data.
method Contrastive learning of node embeddings using graph neural networks and a loss function.
result Significantly outperforms state-of-the-art in unsupervised node classification benchmarks.
Contrastive learning outperforms autoencoders and GANs in feature recovery and downstream tasks.
problem Theoretical understanding of contrastive learning's superiority in feature learning.
method Theoretical analysis of contrastive learning in linear representation settings.
result Contrastive learning outperforms autoencoders and GANs for feature recovery and in-domain downstream tasks.
RényiCL uses Rényi divergence for robust contrastive learning with stronger data augmentations.
problem Learning useful representations from multiple data views with hard augmentations.
method RényiCL employs Rényi divergence for contrastive learning, using a novel variational objective to manage hard negative sampling.
result RényiCL achieves better performance with stronger augmentations compared to other methods.
CLOCS uses contrastive learning to improve cardiac signal representations.
problem Lack of labelled data in cardiac signal analysis.
method Contrastive learning across space, time, and patients.
result CLOCS outperforms state-of-the-art methods and achieves strong generalization.
Develops a new self-supervised learning method combining contrastive and non-contrastive approaches.
problem Leveraging unlabeled data for representation learning, especially with high variance and low batch sizes.
method Converts a contrastive method (Spectral Contrastive Loss) into a non-contrastive form (MINC loss) to reduce variance and mutual information.
result MINC loss consistently improves upon the Spectral Contrastive loss baseline in learning image representations.
Contrastive learning works well with redundant data views.
problem Improving unsupervised learning with redundant data views.
method Theoretical analysis of contrastive learning in a multi-view setting.
result Linear functions of learned representations are nearly optimal on prediction tasks when views are redundant.
This paper presents SimCLR: a simple framework for contrastive learning of visual representations. We simplify recently proposed contrastive self-supervised learning algorithms without requiring specialized architectures or a memory bank. In order to understand what enables the contrastive prediction tasks to learn use…
SuNCEt accelerates contrastive learning with minimal labeled data.
problem Efficiently learning visual representations with limited labeled data.
method Noise-contrastive estimation and neighbourhood component analysis-based semi-supervised loss.
result SuNCEt achieves semi-supervised learning accuracy with less than half the labeled data.
This paper broadens contrastive learning for disentangled representations without strict data distribution assumptions.
problem Learning disentangled representations from data with specific assumptions.
method Extends theoretical guarantees for disentanglement to a broader family of contrastive methods, relaxing data distribution assumptions.
result Identifiability of true latents for four contrastive losses proved without common independence assumptions.
Contrastive learning helps linear models understand document topics.
problem Document classification with limited labeled data.
method Contrastive learning applied to document topic modeling.
result Linear models can recover topic posterior information from contrastive learning representations.
New method improves graph representations against adversarial attacks.
problem Adversarial robustness in graph contrastive learning.
method Adversarial and edge insertion transformations.
result Promising results in preliminary experiments.
Bayesian graph contrastive learning improves uncertainty quantification for graph analytics.
problem Uncertainty quantification for node representations in graph contrastive learning.
method Proposes a Bayesian framework to learn stochastic encoders representing nodes as distributions, providing uncertainty estimates.
result Significant improvement in performance on benchmark datasets compared to existing methods.
The paper shows how to answer future and past questions from high-dimensional time series data.
problem Challenges in answering probabilistic inference questions from high-dimensional time series data.
method Temporal contrastive learning to learn Gaussian representations that enable compact closed-form solutions.
result Representations learned via contrastive learning follow a Gauss-Markov chain, enabling efficient inference and planning.
ExpCLR uses expert features to improve time-series representation learning.
problem Current representation learning approaches fail to ensure useful properties for time-series data.
method ExpCLR employs expert features to replace data transformations in contrastive learning, ensuring two useful properties for time-series representations.
result ExpCLR outperforms state-of-the-art methods on three real-world time-series datasets.
A new unsupervised contrastive learning framework improves time series representation learning.
problem Lack of labeled data in time series data.
method Proposes an unsupervised contrastive learning framework using a novel contrastive loss and data augmentation.
result Framework outperforms other approaches on univariate and multivariate time series, and benefits transfer learning.
New mutual information framework improves contrastive learning for vision tasks.
problem Maximizing mutual information for better unsupervised learning representations.
method Reformulated mutual information as a lower bound, introducing new negative sampling strategies.
result Improved representations outperform previous methods in various vision tasks.
New approach learns graph representations by contrasting first-order neighbors and graph diffusion views.
problem Learning node and graph level representations from graph data.
method Self-supervised approach using contrastive learning of multi-scale encodings.
result Achieves state-of-the-art performance on 8 out of 8 benchmarks.
Improves contrastive learning invariance with novel training objectives and feature averaging.
problem Contrastive learning's implicit invariance is insufficient for robust performance.
method Introduces a novel training objective and feature averaging approach to enforce invariance.
result Improved performance and robustness to transformations on downstream tasks.
Paper develops tighter risk certificates for contrastive learning models.
problem Statistical theory for contrastive learning is lacking, especially for practical models like SimCLR.
method Develops non-vacuous PAC-Bayesian risk certificates considering practical SimCLR factors.
result Risk certificates for contrastive loss and downstream prediction are much tighter than previous results.
Debiased contrastive learning improves representation learning by correcting for same-label sampling.
problem Sampling negative examples from truly different labels improves performance in self-supervised representation learning.
method Developed a debiased contrastive objective that corrects for the sampling of same-label datapoints without true labels.
result The proposed debiased contrastive objective consistently outperforms state-of-the-art methods across vision, language, and reinforcement learning benchmarks.
This work optimizes alignment and uniformity of features on a hypersphere for better downstream performance.
problem Improving the performance of contrastive representation learning.
method Identifying and optimizing alignment and uniformity of features on a hypersphere.
result Directly optimizing alignment and uniformity leads to comparable or better performance than contrastive learning.
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.
New method learns stochastic process representations without exact reconstruction.
problem Learning exact representations of high-dimensional noisy stochastic processes.
method CReSP framework for contrastive learning of stochastic processes.
result Effective for learning representations of various stochastic processes.
A method to prevent image representation collapse through data-dependent augmentation.
problem Representation collapse due to image augmentations that damage information.
method Formalizing a stochastic encoding process with a tug-of-war between corruption and preserved information, using infoMax objective.
result Learning a data-dependent distribution of augmentations to avoid representation collapse.
New unsupervised method selects hard negative samples for contrastive learning.
problem How to select good negative examples for contrastive learning without using true similarity information.
method Developed a new family of unsupervised sampling methods for hard negative selection.
result Improves downstream performance across multiple modalities.
Poly-view contrastive learning improves image representation learning.
problem Learning representations from multiple related views in image data.
method Developed new representation learning objectives for poly-view tasks using information maximization and sufficient statistics.
result Poly-view contrastive models trained for fewer epochs and with smaller batch sizes outperform models trained for more epochs and with larger batch sizes.
ACERL embeds networks into a low-dimensional space preserving structural and semantic properties.
problem Challenges in brain connectivity data analysis with subject-specific, high-dimensional, and sparse networks.
method Contrastive learning of augmented network pairs with adaptive random masking.
result Achieves minimax optimal convergence rate for edge representation learning.
cMIM improves representation learning without positive-pair augmentations.
problem Learning robust representations for diverse tasks.
method Contrastive Mutual Information Machine (cMIM) framework.
result cMIM outperforms MIM and InfoNCE on classification and regression tasks.
The paper analyzes generalization in deep contrastive learning.
problem Generalization analysis for unsupervised deep contrastive representation learning.
method Parameter-counting and norm-based bounds derived for neural networks of varying sizes and depths.
result Bounds are independent of network depth and size, reducing dependency on matrix norms.
CSI detects novelty by contrasting shifted instances, outperforming existing methods.
problem Detecting samples from outside the training distribution.
method Contrastive learning with distributionally shifted augmentations.
result CSI outperforms existing methods in various novelty detection scenarios.
i-cNRL learns network differences with interpretability.
problem Comparing unique network characteristics.
method Contrastive network representation learning (cNRL) integrating machine learning schemes.
result i-cNRL reveals unique network patterns with interpretability.
Study uses contrastive learning to analyze market order behavior.
problem Understanding diverse market order behaviors.
method Self-supervised learning with triplet loss for order representation.
result Identified distinct behavior types using K-means clustering.
Simplified non-contrastive learning avoids representation collapse.
problem Training failure modes in self-supervised learning.
method Hyperdimensional computing and inductive bias.
result The approach avoids representation collapses.
The paper proves probabilistic alignment between unseen modalities using contrastive learning.
problem Aligning unseen modalities in unsupervised learning.
method Bayesian approach and direct comparison of contrastive representations.
result Direct comparison of contrastive representations recovers the same likelihood ratio as probabilistic graphical models.
Contrastive Code Representation Learning improves code summarization and type inference.
problem Code representations are sensitive to edits, hindering downstream semantic understanding tasks.
method ContraCode: a contrastive pre-training task that learns code functionality.
result Contrastive pre-training improves code summarization and type inference accuracy.
Method enhances anomaly detection using contrastive learning and out-of-distribution data.
problem Improving anomaly detection in datasets with limited out-of-distribution data.
method Proposes a contrastive learning method that incorporates out-of-distribution data to enhance anomaly detection performance.
result The method significantly improves anomaly detection performance, even with limited out-of-distribution data.