2-party Asymmetric learning #61
Labels
Priority: 4 - Low 😎
Should only be scheduled if it's important relative to other issues
Status: Blocked ✖️
Cannot work on this because of some other incomplete work
Type: New Feature ➕
Introduction of a completely new addition to the codebase
Milestone
Feature Description
Implement an asymmetric learning protocol when calculating the ID intersection between parties.
See this paper for more information
Is your feature request related to a problem?
Asymmetric learning is the case where one of the parties in vertical federated learning has the majority of data IDs.
The major party can learn a great deal about the individuals/entities the minor party holds data on, but the minor party
learns almost nothing about the major party's dataset.
Protocols to protect both parties in this scenario include obscuring the intersection of data IDs by adding random IDs to the set sent to each party.
What alternatives have you considered?
None
Additional Context
This may need to implemented upstream by the PSI team.
This issue is should be worked on after
syft
(i.e. we have worker-to-worker communication in place)Open questions:
The text was updated successfully, but these errors were encountered: