We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Unsupervised Learning of Visual Features by Contrasting Cluster Assignments Sinkhorn distance, transportation polytope
Augmentation 을 하여, qs-->vt, qt-->vs 로 추정하기. 이 과정에서 transportation polytope 로 q, probability matrix 를 최적화시키려는 시도가 있었음.
논문 원본 링크: https://proceedings.neurips.cc/paper/2020/file/70feb62b69f16e0238f741fab228fec2-Paper.pdf
https://docs.google.com/presentation/d/1ycPIdLBBzMWptNa37Xzh4a52hTOY4EF4/edit?usp=drive_web&ouid=109708923245527629092&rtpof=true
https://youtu.be/6u_yt_Ql3qs
다양한 인용 논문을 통해 이해하려고 시도했으나 쉽지 않았음. 어떤 contribute 라도 감사합니다.
이메일은 [email protected]으로 보내주세요!
The text was updated successfully, but these errors were encountered:
Futuremine97
No branches or pull requests
Keywords
Unsupervised Learning of Visual Features by Contrasting Cluster Assignments
Sinkhorn distance, transportation polytope
Abstract
Augmentation 을 하여, qs-->vt, qt-->vs 로 추정하기.
이 과정에서 transportation polytope 로 q, probability matrix 를 최적화시키려는 시도가 있었음.
Paper link
논문 원본 링크: https://proceedings.neurips.cc/paper/2020/file/70feb62b69f16e0238f741fab228fec2-Paper.pdf
Presentation link
https://docs.google.com/presentation/d/1ycPIdLBBzMWptNa37Xzh4a52hTOY4EF4/edit?usp=drive_web&ouid=109708923245527629092&rtpof=true
video link
https://youtu.be/6u_yt_Ql3qs
개인적으로 하고 싶은 말(박성훈님)
다양한 인용 논문을 통해 이해하려고 시도했으나 쉽지 않았음.
어떤 contribute 라도 감사합니다.
이메일은 [email protected]으로 보내주세요!
The text was updated successfully, but these errors were encountered: