.png){kind=icon}
.png){kind=icon}
Return
Manifold regularization based finite time distributed semi-supervised learning algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-026-03052-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a finite-time distributed semi-supervised learning (FTDSSL) algorithm based on the zero-gradient-sum strategy, manifold regularization, and extreme learning machines. The FTDSSL algorithm is designed for addressing distributed learning problems involving distributed data, including unlabeled samples. Thanks to the ZGS strategy, it yields results comparable to semi-supervised learning algorithms using single-layer feedforward neural networks on the full dataset. Moreover, FTDSSL exhibits convergence within a finite number of iterations. Each FTDSSL iteration shares only updated output weights between neighbors, preserving data privacy and communication bandwidth. Theoretical underpinnings, as exemplified by Theorem 1, demonstrate the global convergence of the FTDSSL algorithm through Lyapunov theory. Compared to event-triggered distributed semi-supervised learning, FTDSSL significantly reduces iteration count rather than communication volume. Experimental results validate that the FTDSSL algorithm converges within a finite time frame and proves efficient for distributed learning, particularly on datasets that include unlabeled samples.
Keywords:
Distributed learning
Distributed semi-supervised learning (DSSL)
Finite-time (FT)
Manifold regularization (MR)
Privacy preserving
Journal
IF:
2.7
Papers:
3.1K
Citations:
5.6K