You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In classic gossip learning, the list of neighbors is dynamic and is computed thanks to the Newscast algorithm (gossip-based peer sampling). Is it the case in this implementation ? For me it seems that the topology is static.
The text was updated successfully, but these errors were encountered:
MohamedLEGH
changed the title
Are neighbors changing at each cycle ?
Are neighbors changing at each cycle for Gossip Learning?
Sep 25, 2024
In classic gossip learning, the list of neighbors is dynamic and is computed thanks to the Newscast algorithm (gossip-based peer sampling). Is it the case in this implementation ? For me it seems that the topology is static.
The text was updated successfully, but these errors were encountered: