Questions regarding the implementation of SigLIP loss #951
Unanswered
binwang777
asked this question in
Q&A
Replies: 1 comment
-
each node receives to/from their neighbours, it's a neighbour exchange algorithm, you can't change who's to the left and right of you... imagine people sitting in a circle of chairs passing potatoes to the left and right, same person is always to the left of you and right of you but the potatoes make their way around the circle... |
Beta Was this translation helpful? Give feedback.
0 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Why are leftrank and rightrank not updated during the bidirectional operation?
like this:
Beta Was this translation helpful? Give feedback.
All reactions