Smoothed InfoNCE: Breaking the log N Curse without Overshooting

Xu Wang, Ali Al-Bashabsheh, Chao Zhao, Chung Chan. Smoothed InfoNCE: Breaking the log N Curse without Overshooting. In IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022. pages 724-729, IEEE, 2022. [doi]

Abstract

Abstract is missing.