Lookahead: When Syncs Happen
Beginner
The problem, from first principles
Lookahead synchronizes only every k fast steps. Choosing k sets how often the slow weights are updated, with the fast optimizer running in between.
From theory to code
Implement sync_steps(total, k), the step numbers at which a sync happens.
Constraints
- Steps are numbered from one.
Hints
Hint 1
Keep each step whose number is a multiple of k.
Keywords
research-papersoptimizationmeta-optimizer
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.