-
Notifications
You must be signed in to change notification settings - Fork 28
Byzantine robust aggregator - initial implementation #913
New issue
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
base: develop
Are you sure you want to change the base?
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
thanks for the great work! 🎉
a few things to move around/improve and we'll be ready to go!
can you also add a testcase to ensure that it behave well?
discojs/src/aggregator/byzantine.ts
Outdated
} else { | ||
momentum = contribution.map(g => g.mul(1 - beta)); | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
correct me if I'm wrong but isn't that the same as the if
branch if prevMomentum
is a null vector of the same shape? if yes, consider merging the two and upon contributions.getIn
, use a default value instead.
Co-authored-by: Valérian Rousset <[email protected]>
maybe later once your code is tested we could also do a small comparison to the older implementation here e53676c (that's a very old completely differently structured version of disco, but potentially achieving similar ML accuracy target under byzantine, which might be interesting to check if time remains) |
Initial implementation of Byzantine robust aggregator with momentums and Center-Clipping aggregation.