MoCo: The Key Queue
Beginner
The problem, from first principles
MoCo keeps a fixed-size first-in, first-out queue of keys from past batches. Each training step pushes the newest keys in and drops the oldest, so the negatives are always from recent batches.
From theory to code
Implement enqueue(queue, new_keys, K), which returns the queue with the new keys appended and capped at K entries.
Constraints
- The queue keeps the most recent
Krows.
Hints
Hint 1
Concatenate the new keys after the queue, then keep the last K rows.
Keywords
research-papersunsupervisedcontrastivemomentum
Python
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.