Fetching the paper…
Reading the bibliography…
How can you sample good negative examples for contrastive learning? We argue that, as with metric learning, contrastive learning of representations benefits from hard negative samples (i.e., points that are difficult to distinguish from an anchor point).
On the origin of number and arrangement of the places of exit on the surface of pollen-grains
Pieter Merkus Lambertus Tammes · 1930
Earlier work this paper cites.
Auf welcher kugel haben 5, 6, 7, 8 oder 9 punkte mit mindestabstand eins platz?
K Schütte and BL Van der Waerden · 1951
Earlier work this paper cites.
A training algorithm for optimal margin classifiers
Bernhard E Boser, Isabelle M Guyon, and Vladimir N Vapnik · 1992
Earlier work this paper cites.
Support-Vector Networks
Corinna Cortes and Vladimir Vapnik · 1995
Earlier work this paper cites.
Combining labeled and unlabeled data with co-training
Avrim Blum and Tom Mitchell · 1998
Earlier work this paper cites.
Directional Statistics
K. V. Mardia and P. Jupp · 2000
Earlier work this paper cites.
Overview of trec 2002
Ellen M Voorhees and Donna Harman · 2002
Earlier work this paper cites.
Improved baselines with momentum contrastive learning
Xinlei Chen, Haoqi Fan, Ross Girshick, and Kaiming He · 2003
Earlier work this paper cites.
Unsupervised construction of large paraphrase corpora: Exploiting massively parallel news sources
Bill Dolan, Chris Quirk, and Chris Brockett · 2004
Earlier work this paper cites.
Mining and summarizing customer reviews
Minqing Hu and Bing Liu · 2004
Earlier work this paper cites.
A sentimental education: Sentiment analysis using subjectivity summarization based on minimum cuts
Bo Pang and Lillian Lee · 2004
Earlier work this paper cites.
Learning a similarity metric discriminatively, with application to face verification
Sumit Chopra, Raia Hadsell, and Yann LeCun · 2005
Earlier work this paper cites.
Seeing stars: Exploiting class relationships for sentiment categorization with respect to rating scales
Bo Pang and Lillian Lee · 2005
Earlier work this paper cites.
Annotating expressions of opinions and emotions in language
Janyce Wiebe, Theresa Wilson, and Claire Cardie · 2005
Earlier work this paper cites.
Dimensionality reduction by learning an invariant mapping
Raia Hadsell, Sumit Chopra, and Yann LeCun · 2006
Earlier work this paper cites.
Learning classifiers from only positive and unlabeled data
Charles Elkan and Keith Noto · 2008
Earlier work this paper cites.
Noise-Contrastive Estimation: A new estimation principle for unnormalized statistical models
Michael Gutmann and Aapo Hyvärinen · 2010
Earlier work this paper cites.
A survey on multi-view learning
Chang Xu, Dacheng Tao, and Chao Xu · 2013
Earlier work this paper cites.
Analysis of learning from positive and unlabeled data
Marthinus C Du Plessis, Gang Niu, and Masashi Sugiyama · 2014
Earlier work this paper cites.
Adam: A method for stochastic optimization
Diederik P Kingma and Jimmy Ba · 2015
Cited alongside, same era.
Skip-Thought Vectors
Ryan Kiros, Yukun Zhu, Russ R Salakhutdinov, Richard Zemel, Raquel Urtasun, Antonio Torralba, and Sanja Fidler · 2015
Cited alongside, same era.
The tammes problem for n= 14
Oleg R Musin and Alexey S Tarasov · 2015
Cited alongside, same era.
Facenet: A unified embedding for face recognition and clustering
Florian Schroff, Dmitry Kalenichenko, and James Philbin · 2015
Cited alongside, same era.
Class-prior estimation for learning from positive and unlabeled data
Marthinus Christoffel, Gang Niu, and Masashi Sugiyama · 2016
Cited alongside, same era.
Deep residual learning for image recognition
Kaiming He, Xiangyu Zhang, Shaoqing Ren, and Jian Sun · 2016
Cited alongside, same era.
Graph matching networks for learning the similarity of graph structured objects
Yujia Li, Chenjie Gu, Thomas Dullien, Oriol Vinyals, and Pushmeet Kohli · 2019
Later among the works it cites.
Stochastic class-based hard example mining for deep metric learning
Yumin Suh, Bohyung Han, Wonsik Kim, and Kyoung Mu Lee · 2019
Later among the works it cites.
Contrastive Multiview Coding
Yonglong Tian, Dilip Krishnan, and Phillip Isola · 2019
Later among the works it cites.
Deep Graph Infomax
Petar Velickovic, William Fedus, William L Hamilton, Pietro Liò, Yoshua Bengio, and R Devon Hjelm · 2019
Later among the works it cites.
How powerful are graph neural networks?
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka · 2019
Later among the works it cites.
Debiased Contrastive Learning
Ching-Yao Chuang, Joshua Robinson, Lin Yen-Chen, Antonio Torralba, and Stefanie Jegelka · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Estimating the class prior and posterior from noisy positives and unlabeled data
Shantanu Jain, Martha White, and Predrag Radivojac · 2016
Cited alongside, same era.
f-GAN: Training generative neural samplers using variational divergence minimization
Sebastian Nowozin, Botond Cseke, and Ryota Tomioka · 2016
Cited alongside, same era.
Deep metric learning via lifted structured feature embedding
Hyun Oh Song, Yu Xiang, Stefanie Jegelka, and Silvio Savarese · 2016
Cited alongside, same era.
Smart mining for deep metric learning
Ben Harwood, Vijay Kumar BG, Gustavo Carneiro, Ian Reid, and Tom Drummond · 2017
Cited alongside, same era.
Sampling matters in deep embedding learning
Chao-Yuan Wu, R Manmatha, Alexander J Smola, and Philipp Krahenbuhl · 2017
Cited alongside, same era.
Deep metric learning with hierarchical triplet loss
Weifeng Ge · 2018
Cited alongside, same era.
Contrastive multi-view representation learning on graphs
Kaveh Hassani and Amir Hosein Khasahmadi · 2020
Closest in time.
Momentum contrast for unsupervised visual representation learning
Kaiming He, Haoqi Fan, Yuxin Wu, Saining Xie, and Ross Girshick · 2020
Closest in time.
Data-efficient image recognition with contrastive predictive coding
Olivier J Hénaff, Aravind Srinivas, Jeffrey De Fauw, Ali Razavi, Carl Doersch, SM Eslami, and Aaron van den Oord · 2020
Closest in time.
Hard negative mixing for contrastive learning
Yannis Kalantidis, Mert Bulent Sariyildiz, Noe Pion, Philippe Weinzaepfel, and Diane Larlus · 2020
Closest in time.
Supervised contrastive learning
Prannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna, Yonglong Tian, Phillip Isola, Aaron Maschinot, Ce Liu, and Dilip Krishnan · 2020
Closest in time.
Self-supervised learning of pretext-invariant representations
Ishan Misra and Laurens van der Maaten · 2020
Closest in time.
Tudataset: A collection of benchmark datasets for learning with graphs
Christopher Morris, Nils M Kriege, Franka Bause, Kristian Kersting, Petra Mutzel, and Marion Neumann · 2020
Closest in time.
Demystifying contrastive self-supervised learning: Invariances, augmentations and dataset biases
Senthil Purushwalkam and Abhinav Gupta · 2020
Closest in time.
CURL: Contrastive unsupervised representations for reinforcement learning
Aravind Srinivas, Michael Laskin, and Pieter Abbeel · 2020
Closest in time.
InfoGraph: Unsupervised and semi-supervised graph-level representation learning via mutual information maximization
Fan-Yun Sun, Jordan Hoffmann, Vikas Verma, and Jian Tang · 2020
Closest in time.
Locality and compositionality in zero-shot learning
Tristan Sylvain, Linda Petrini, and Devon Hjelm · 2020
Closest in time.
What makes for good views for contrastive learning?
Yonglong Tian, Chen Sun, Ben Poole, Dilip Krishnan, Cordelia Schmid, and Phillip Isola · 2020
Closest in time.
Understanding contrastive representation learning through alignment and uniformity on the hypersphere
Tongzhou Wang and Phillip Isola · 2020
Closest in time.