LGAIFeb 4, 2025

Addressing Label Shift in Distributed Learning via Entropy Regularization

arXiv:2502.02544v1h-index: 61ICLR
Originality Incremental advance
AI Analysis

This work addresses label shift challenges in distributed learning systems, offering incremental improvements for scenarios with data privacy constraints.

The paper tackles the problem of minimizing true risk in multi-node distributed learning by addressing label shifts, proposing the VRLS method that improves model performance by up to 20% in imbalanced settings on datasets like MNIST and CIFAR-10.

We address the challenge of minimizing true risk in multi-node distributed learning. These systems are frequently exposed to both inter-node and intra-node label shifts, which present a critical obstacle to effectively optimizing model performance while ensuring that data remains confined to each node. To tackle this, we propose the Versatile Robust Label Shift (VRLS) method, which enhances the maximum likelihood estimation of the test-to-train label density ratio. VRLS incorporates Shannon entropy-based regularization and adjusts the density ratio during training to better handle label shifts at the test time. In multi-node learning environments, VRLS further extends its capabilities by learning and adapting density ratios across nodes, effectively mitigating label shifts and improving overall model performance. Experiments conducted on MNIST, Fashion MNIST, and CIFAR-10 demonstrate the effectiveness of VRLS, outperforming baselines by up to 20% in imbalanced settings. These results highlight the significant improvements VRLS offers in addressing label shifts. Our theoretical analysis further supports this by establishing high-probability bounds on estimation errors.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes