Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
OPTIMAL SAMPLE COMPLEXITY OF CONTRASTIVE LEARNING
Noga Alon
, Dmitrii Avdiukhin
, Dor Elboim
, Orr Fischer
, Grigory Yaroslavtsev
Mathematics
Research output
:
Contribution to conference
›
Paper
›
peer-review
3
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'OPTIMAL SAMPLE COMPLEXITY OF CONTRASTIVE LEARNING'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Main Result
100%
Integer
100%
Predictive Power
100%
Arbitrary Distribution
100%
Distance Function
100%
Deep Learning
100%
Chervonenkis
100%
Representation Learning
100%
Computer Science
Contrastive Learning
100%
Experimental Result
33%
Predictive Power
33%
Distance Function
33%
Representation Learning
33%
Statistical Learning Theory
33%
Deep Learning
33%
Psychology
Main Result
100%
Keyphrases
P-distance
50%
FP-tree
25%