Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A Safe Decentralized Graph Federated Learning Method

A technology of decentralization and learning methods, applied in the direction of neural learning methods, computer security devices, instruments, etc., can solve problems such as time-consuming, difficult to guarantee, and protect, to protect data privacy and security, reduce communication bottlenecks, reduce The effect of communication time

Active Publication Date: 2022-02-25
蓝象智联(杭州)科技有限公司
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The above solution does not protect the local model parameters sent to the central server in the global model aggregation stage to prevent possible information leakage; secondly, the central server responsible for aggregating model information requires a trusted neutral third party Institutions, for modeling between institutions, it is difficult to guarantee such a trusted neutral third party; finally, this centralized architecture puts high demands on the IO capabilities of the central server, and all clients must Waiting for all clients to upload the model parameters to the central server successfully, and then the central server distributes the updated global model parameters to the clients before the client can proceed to the next cycle, which is undoubtedly very time-consuming

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A Safe Decentralized Graph Federated Learning Method
  • A Safe Decentralized Graph Federated Learning Method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0041] Embodiment: A safe decentralized graph federated learning method of this embodiment, such as figure 1 shown, including the following steps:

[0042] S1: Number all n clients participating in graph federated learning as 1, 2, 3...n in sequence, and one of the clients serves as the training initiator to initialize the parameters of the graph neural network model and the ring communication topology map, and send them to other clients;

[0043] The ring communication topology diagram is matrix A,

[0044] ,

[0045] , , , 1≤i≤n, 1≤j≤n,

[0046] When i=j, A ij ≠0,

[0047] Among them, A ij Indicates the weight coefficient between the client numbered i and the client numbered j, if A ij ≠0 means that the client numbered i can communicate with the client numbered j, if A ij =0 means that the client numbered i cannot communicate with the client numbered j, matrix A is a symmetrical matrix, A ii Indicates the weight coefficient of the client numbered i, Indica...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a safe decentralized graph federation learning method. It includes the following steps: S1: number all clients in sequence, initialize the neural network model parameters of the graph and send the ring communication topology to all clients; S2: each client determines the first-level neighbor client according to the ring communication topology; Neighborhood client, and negotiate with each corresponding second-level neighbor client to generate a corresponding shared key; S3: Each client trains the local graph neural network model and updates the local graph neural network model parameters; S4: Each client receives the graph neural network model parameters sent by the first-level neighbor client to update the local graph neural network model; S5: Repeat step S3-step S4 until the graph neural network model converges. The invention can protect the data privacy and safety of each client, relieve communication bottleneck and reduce communication time.

Description

technical field [0001] The invention relates to the technical field of graph federated learning, in particular to a secure decentralized graph federated learning method. Background technique [0002] In the past few years, the rise and application of neural networks have successfully promoted the research of pattern recognition and data mining. Traditional deep learning methods have achieved great success in extracting Euclidean space data features, but many of the data in the actual scene are generated from non-Euclidean spaces, and the performance of deep learning methods on such data is unsatisfactory. , as shown in the figure, the number of neighbor nodes of each node in the network is not fixed, resulting in some important operations (such as convolution) are easy to calculate on the image, but it is no longer suitable for direct use in the graph. Moreover, deep learning is based on the assumption that the training data satisfies independent and identical distribution,...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G06F21/60G06F21/62G06N3/04G06N3/08
CPCG06F21/602G06F21/6245G06N3/04G06N3/08
Inventor 裴阳刘洋毛仁歆徐时峰朱振超
Owner 蓝象智联(杭州)科技有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products