# DynLP: Parallel Dynamic Batch Update for Label Propagation in Semi-Supervised Learning

arXiv: https://arxiv.org/abs/2604.06596 · HTML: https://mlsanity.com/paper/2604.06596/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 5 of its 43 references that are in the map.
- First posted on arXiv 8 Apr 2026.

## Builds on (most cited first, 5 of 5)

- [Deep Residual Learning for Image Recognition](https://mlsanity.com/paper/1512.03385/) (2015)
- [Bridging Language and Items for Retrieval and Recommendation: Benchmarking LLMs as Semantic Encoders](https://mlsanity.com/paper/2403.03952/) (2024)
- [CAGNN: Cluster-Aware Graph Neural Networks for Unsupervised Graph Representation Learning](https://mlsanity.com/paper/2009.01674/) (2020)
- [Large Scale Distributed Semi-Supervised Learning Using Streaming Approximation](https://mlsanity.com/paper/1512.01752/) (2015)
- [GLAM: Graph Learning by Modeling Affinity to Labeled Nodes for Graph Neural Networks](https://mlsanity.com/paper/2102.10403/) (2021)

## Abstract (arXiv)

Semi-supervised learning aims to infer class labels using only a small fraction of labeled data. In graph-based semi-supervised learning, this is typically achieved through label propagation to predict labels of unlabeled nodes. However, in real-world applications, data often arrive incrementally in batches. Each time a new batch appears, reapplying the traditional label propagation algorithm to recompute all labels is redundant, computationally intensive, and inefficient. To address the absence of an efficient label propagation update method, we propose DynLP, a novel GPU-centric Dynamic Batched Parallel Label Propagation algorithm that performs only the necessary updates, propagating changes to the relevant subgraph without requiring full recalculation. By exploiting GPU architectural optimizations, our algorithm achieves on average 13x and upto 102x speedup on large-scale datasets compared to state-of-the-art approaches.