paper-with-me

홈 › Papers

The NT-Xent loss upper bound

2022-05-06 · Wilhelm Ågren

Self-supervised learning is a growing paradigm in deep representation learning, showing great generalization capabilities and competitive performance in low-labeled data regimes. The SimCLR framework proposes the NT-Xent loss for contrastive representation learning. The objective of the loss function is to maximize agreement, similarity, between sampled positive pairs. This short paper derives and proposes an upper bound for the loss and average similarity. An analysis of the implications is however not provided, but we strongly encourage anyone in the field to conduct this.

📄 PDF Abstract BibTeX arXiv:2205.03169

Code (0)

등록된 구현이 없습니다.

Tasks

Representation LearningSelf-Supervised Learning

Methods 이 논문이 사용한 방법론

ReLU How Do I Communicate to Expedia? How Do I Communicate to Expedia? – Call ☎️ +1-(888) 829 (0881) or +1-805-330-4056 or +1-805-330-4056 for Live Support & Special Travel…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Average Pooling 설명 없음
1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Residual Connection 설명 없음
Batch Normalization 설명 없음
Global Average Pooling Global Average Pooling is a pooling operation designed to replace fully connected layers in classical CNNs. The idea is to generate one feature map for each corresponding…
Feedforward Network A Feedforward Network, or a Multilayer Perceptron (MLP), is a neural network with solely densely connected layers. This is the classic neural network architecture of the…

Similar Papers 제목 키워드 기반

Maximum Entropy RL (Provably) Solves Some Robust RL Problems

2021-03-10 · ICLR 2022 4 · Benjamin Eysenbach, Sergey Levine

Many potential applications of reinforcement learning (RL) require guarantees that the agent will perform well in the face of disturbances to the dynamics or reward function. In this paper, we prove theoretically that ma…

Reinforcement Learning (RL)

Cross-Entropy Games for Language Models: From Implicit Knowledge to General Capability Measures

2025-06-07 · Clément Hongler, Andrew Emil

Large Language Models (LLMs) define probability measures on text. By considering the implicit knowledge question of what it means for an LLM to know such a measure and what it entails algorithmically, we are naturally le…

Anomaly Detectioncounterfactual

Estimating Mixture Entropy with Pairwise Distances

2017-06-08 · Artemy Kolchinsky, Brendan D. Tracey

Mixture distributions arise in many parametric and non-parametric settings -- for example, in Gaussian mixture models and in non-parametric estimation. It is often necessary to compute the entropy of a mixture, but, in m…

Form

MaxEnt Learners are Biased Against Giving Probability to Harmonically Bounded Candidates

2022-02-01 · SCiL 2022 2 · Charlie O’Hara

AAG: Self-Supervised Representation Learning by Auxiliary Augmentation with GNT-Xent Loss

2020-09-17 · Yanlun Tu, Jianxing Feng, Yang Yang

Self-supervised representation learning is an emerging research topic for its powerful capacity in learning with unlabeled data. As a mainstream self-supervised learning method, augmentation-based contrastive learning ha…

Contrastive LearningDiversityRepresentation LearningSelf-Supervised Learning