Contrastive embeddings improve neural architecture search performance.
problem Improving performance of neural architecture search algorithms.
method Contrastive learning to identify networks based on data Jacobians and produce embeddings.
result Traditional black-box optimization algorithms can reach state-of-the-art performance with contrastive embeddings.
A new contrastive learning method extracts asset embeddings from financial time series.
problem Extracting meaningful latent features from noisy financial data.
method Contrastive learning framework using hypothesis testing for positive and negative samples.
result Effective asset embeddings significantly outperform existing methods on financial tasks.
New insights show embedding lengths correlate with semantic properties.
problem Contrastive embedding norms ignore embedding magnitudes but correlate with semantic properties.
method Formal theoretical framework and analysis of optimization dynamics.
result Embedding lengths encode semantic information as a byproduct of training.
VCL adds uncertainty to contrastive learning models.
problem Lack of uncertainty quantification in contrastive learning methods.
method VCL uses a decoder-free framework that maximizes ELBO with InfoNCE loss and KL divergence.
result VCL provides meaningful uncertainty estimates and matches deterministic baselines in accuracy.
Study shows uncertainty of deep learning models can be measured from their embeddings.
problem Uncertainty in contrastive learning models for critical applications.
method Estimating the distribution of training data in embedding space and accounting for local consistency.
result Uncertainty of an embedding vector correlates strongly with downstream accuracy.
Paper explains contrastive learning using cosine similarity and proposes mitigations for batch size effects.
problem Understanding and improving contrastive learning through batch size effects.
method Unified framework of cosine similarity, theoretical insights, and auxiliary loss.
result Performance improvement in small-batch settings through proposed auxiliary loss.
ViCE uses superpixels to enhance self-supervised learning for better dense visual embeddings.
problem Lack of high-resolution feature maps from self-supervised models.
method Superpixels for dense representation learning, contrasting over regions.
result Improves unsupervised semantic segmentation on benchmarks like Cityscapes and COCO.
Improved similarity search in embeddings using InfoNCE loss.
problem Improving similarity search in embedding models trained by contrastive learning.
method Introduced a new continuity bound for InfoNCE loss via Gâteaux differentiation, preserving the averaging effect of negative samples.
result Demonstrated that the averaging effect of k negative samples in InfoNCE loss carries over to stabilisation of generalisation error as k grows. VJE learns latent representations without contrastive learning, providing probabilistic semantics.
problem Learning latent representations without contrastive signals.
method VJE maximizes a symmetric conditional evidence lower bound (ELBO) on paired encoder embeddings, using a Student-t distribution on a polar representation.
result VJE outperforms standard non-contrastive baselines in ImageNet-1K, CIFAR-10/100, and STL-10.
Framework predicts patient risk progression over time.
problem Predicting how patient risk changes over time.
method Supervised contrastive learning framework with embedding properties.
result Framework outperforms baselines in mortality and cognitive impairment datasets.
A framework converts spatial data into embeddings for insurance risk modelling.
problem Improving underwriting precision and risk management in insurance with spatial data.
method Multi-view contrastive learning framework for generating spatial embeddings.
result Spatial embeddings consistently improve predictive accuracy across various models.
COBRA reduces modality gap in cross-modal tasks.
problem Joint embedding spaces fail to sufficiently reduce modality gap in multi-modal tasks.
method COBRA trains image and text modalities in a joint fashion using Contrastive Predictive Coding and Noise Contrastive Estimation.
result COBRA significantly reduces the modality gap and generates robust joint-embedding space.
ContraSim learns financial headline similarities for market forecasting.
problem Financial market forecasting accuracy improvement.
method ContraSim framework with Weighted Headline Augmentation and WSSCL.
result Improves financial forecasting accuracy by 7%.
This work analyzes when contrastive models are close to PCA or kernel methods.
problem Understanding when contrastive models are equivalent to kernel methods or PCA.
method Analyzing the training dynamics of two-layer contrastive models with non-linear activation.
result Wide contrastive models with cosine similarity based losses are close to PCA.
GCBS improves contrastive learning performance efficiently.
problem Efficiently mining hard negatives for contrastive learning.
method Global Contrastive Batch Sampling (GCBS) approximates batch assignment problem.
result GCBS improves state-of-the-art performance in sentence embedding and code-search tasks.
SANS uses graph structure to find meaningful negatives for entity and relation embeddings.
problem Finding hard negatives for entity and relation embeddings in knowledge graphs.
method Structure Aware Negative Sampling (SANS) that selects negatives from a node's k-hop neighborhood.
result SANS finds semantically meaningful negatives and is competitive with state-of-the-art approaches.
In contrast with knots, whose properties depend only on their extrinsic topology in S3, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in S3 . For example, it was shown in [2] that every embedding of the complete graph K7 in S3 …
In this paper we give two examples of sequences of embedded minimal planar domains in R3 which converge to singular laminations of R3. In contrast with the situation for embedded minimal disks, these examples do not arise from complete embedded minimal planar domains and highlight some of the su…
New method improves reinforcement learning generalization.
problem Few environments lead to poor generalization in reinforcement learning.
method Integrates sequential structure into representation learning, using a policy similarity metric (PSM) and contrastive embeddings (PSEs).
result PSEs improve generalization across various benchmarks.
In contrast with what happens for Legendrian embeddings, there always exist positive loops of Legendrian immersions.
We present a fully-supervized method for learning to segment data structured by an adjacency graph. We introduce the graph-structured contrastive loss, a loss function structured by a ground truth segmentation. It promotes learning vertex embeddings which are homogeneous within desired segments, and have high contrast …
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.
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.
SCE improves network embedding using sparsest cut for negative samples only.
problem Efficient unsupervised network embedding using negative samples.
method Inspired by sparsest cut, SCE uses Laplacian smoothing for node representations.
result SCE outperforms GraphSAGE, G2G, and DGI in accuracy and scalability.
The study examines Lipschitz normally embedded Hölder triangles in 4D space.
problem Comparing ambient and outer Lipschitz geometry of Hölder triangles.
method Analyzes Lipschitz normally embedded Hölder triangles in \(\mathbb{R}^4\).
result Infinitely many equivalence classes of microknots.
Study removes bias from chest X-ray embeddings using orthogonalization.
problem Reduces bias in chest X-ray embeddings due to protected features.
method Orthogonalization technique to remove protected feature effects.
result Orthogonalization removes bias and makes predictions of protected attributes infeasible.
A new topology design improves zero-shot classification performance in contrastive learning.
problem Improving zero-shot classification performance in contrastive visual-textual alignment.
method Proposed an alternative topology design using multiple class tokens and an oblique manifold with negative inner product.
result Improves zero-shot classification performance by an average of 6.1%.
New findings suggest non-contrastive learning has many bad minima, not just collapsed ones.
problem The effectiveness of non-contrastive learning in unsupervised feature learning.
method Theoretical analysis and controlled experiments on simple data models.
result Non-contrastive losses have a preponderance of non-collapsed bad minima, and these minima are not avoided during training.
Method learns audio embeddings with contextualized tags.
problem Align audio and tags for cross-modal tasks.
method Audio autoencoder, word embeddings, multi-head self-attention, contrastive loss.
result Multi-head self-attention improves audio representations.
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.
Enhances thematic investing with stock embeddings from textual data.
problem Challenges in constructing thematic portfolios due to overlapping sector boundaries and evolving market dynamics.
method Introduces THEME, a framework that fine-tunes embeddings using hierarchical contrastive learning, aligning themes and stocks using their hierarchical relationship and incorporating stock returns.
result Theme-aligned portfolios demonstrate compelling performance, significantly outperforming large language models in thematic asset retrieval.
Solenoids are ``inverse limits'' of the circle, and the classical knot theory is the theory of tame embeddings of the circle into the 3-space. We give some general study, including certain classification results, of tame embeddings of solenoids into the 3-space as the ``inverse limits'' of the tame embeddings of the ci…
Current meta-learning approaches focus on learning functional representations of relationships between variables, i.e. on estimating conditional expectations in regression. In many applications, however, we are faced with conditional distributions which cannot be meaningfully summarized using expectation only (due to e…
A fast binary embedding method preserves Euclidean distances in high-dimensional data.
problem Preserving Euclidean distances in high-dimensional datasets.
method Stable noise-shaping quantization of Ax with A a sparse Gaussian random matrix, followed by a linear transformation. result Euclidean distances are approximated by the ℓ1 norm on binary sequences, leading to accurate binary codes. WEINCE improves contrastive learning by correcting softmax biases.
problem Softmax in InfoNCE can lead to misaligned statistical assumptions in contrastive learning.
method WEINCE uses anchor-wise online batch statistics to blend softmax logits with an endpoint shortfall correction.
result WEINCE yields consistent improvements in frozen-feature evaluation across five vision benchmarks.
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.
A framework evaluates the impact of different modules in graph contrastive learning.
problem Insufficient module-level evaluation in existing graph contrastive learning methods.
method Proposes a framework decomposing GCL models into four modules for module-level evaluation.
result Identifies module-level guidelines and competitive performance of different modules.
Given a closed flat 3-torus N, for each H>0 and each non-negative integer g, we obtain area estimates for closed surfaces with genus g and constant mean curvature H embedded in N. This result contrasts with the theorem of Traizet [33], who proved that every flat 3-torus admits for every positive integer g…
We present an efficient algorithm for maximum likelihood estimation (MLE) of exponential family models, with a general parametrization of the energy function that includes neural networks. We exploit the primal-dual view of the MLE with a kinetics augmented model to obtain an estimate associated with an adversarial dua…
The study explores how 3-manifolds embed locally flatly in S4.
problem Embedding homology 3-spheres in S4 locally flatly. method Survey of known results, focusing on Seifert fibred 3-manifolds and using 4-dimension surgery.
result Characterization of embeddings by properties of complementary regions.
AutoSciDACT detects scientific anomalies in noisy data.
problem Detecting anomalies in large, noisy scientific datasets.
method Contrastive pre-training for low-dimensional data representations, two-sample test using NPLM.
result Strong sensitivity to small anomalies across various scientific domains.
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.
Supervised contrastive learning improves image classification accuracy.
problem Improving image classification accuracy using supervised contrastive learning.
method Extending self-supervised batch contrastive approach to fully-supervised setting, leveraging label information.
result Top-1 accuracy of 81.4% on ImageNet dataset, outperforming cross-entropy.
We construct infinitely many smooth oriented 4-manifolds containing pairs of homotopic, smoothly embedded 2-spheres that are not topologically isotopic, but that are equivalent by an ambient diffeomorphism inducing the identity on homology. These examples show that Gabai's recent "Generalized" 4D Lightbulb Theorem does…
EbC learns equivariant embeddings from unlabeled group actions.
problem Learning equivariant embeddings from unlabeled group actions.
method Equivariance by Contrast (EbC) method to learn equivariant embeddings from observation pairs (y,g⋅y). result High-fidelity equivariance in latent space for diverse groups.
Extends conformal prediction to contrastive learning for better coverage of positive samples.
problem Lack of principled guarantees on coverage in contrastive learning.
method Introduces minimum-volume covering sets with learnable constraints.
result Improves inclusion-exclusion trade-offs in positive and negative samples.
Typical graph embeddings may not capture type-specific bipartite graph features that arise in such areas as recommender systems, data visualization, and drug discovery. Machine learning methods utilized in these applications would be better served with specialized embedding techniques. We propose two embeddings for bip…
Zero-shot contrastive loss improves text-guided image style transfer without extra training.
problem Stochastic nature of diffusion models leads to trade-offs between style transformation and content preservation.
method Proposes a zero-shot contrastive loss for diffusion models that doesn't require additional fine-tuning or auxiliary networks.
result Method outperforms existing methods while preserving content and requiring no additional training.