ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Distributed training”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CYcs.AIRecentMay 28, 2026

Does Distributed Training Undermine Compute Governance?

Robi Rahman

The paper argues that distributed training algorithms allow developers to evade compute governance regulations by using decentralized hardware, necessitating new detection methods like chip tracking a…

View →
cs.LGcs.AIRecentMay 28, 2026

Scalable Constrained Multi-Agent Reinforcement Learning via State Augmentation and Consensus for Separable Dynamics

Santiago Amaya-Corredor, Miguel Calvo-Fullana, Anders Jonsson

The paper proposes a scalable, distributed approach for constrained Multi-Agent Reinforcement Learning by using local consensus over dual variables to ensure global constraint satisfaction without cen…

View →
cs.LGcs.AIRecentJun 1, 2026

FedMTFI: Feature Importance Based Optimized Multi Teacher Knowledge Distillation in Heterogeneous Federated Learning Environment

Nazmus Shakib Shadin, Aaron Cummings, Xinyue Zhang, Bobin Deng

FedMTFI introduces a novel federated learning framework that uses multi-teacher knowledge distillation and feature importance to improve model performance and robustness in heterogeneous and non-IID d…

View →
cs.CRcs.CYRecentMar 30, 2026

Democratizing Federated Learning with Blockchain and Multi-Task Peer Prediction

Leon Witt, Kentaroh Toyoda, Wojciech Samek, Dan Li

The paper proposes a novel decentralized framework that uses blockchain and Multi-task Peer Prediction to incentivize and manage the computationally intensive process of Federated Learning.

View →
cs.CLcs.AIRecentMay 29, 2026

D$^3$: Dynamic Directional Graph-Constrained Data Scheduling for LLM Training

Yuanjian Xu, Jianing Hao, Guang Zhang, Zhong Li

The paper proposes $D^3$, a dynamic graph-constrained scheduling framework that optimizes LLM training order by modeling sample interactions as a dynamic influence graph.

View →
cs.LGcs.AIcs.CVRecentMay 30, 2026

On the Difficulty of Learning a Meta-network for Training Data Selection

Zilin Du, Junqi Zhao, Boyang Albert Li

This paper analyzes the poor performance of Meta-learning for Training-data Selection (MTS) and proposes that increasing the batch size and incorporating informative features can significantly improve…

View →
cs.LGcs.CRRecentApr 16, 2026

FedIDM: Achieving Fast and Stable Convergence in Byzantine Federated Learning through Iterative Distribution Matching

He Yang, Dongyi Lv, Wei Xi, Song Ma +2 more

FedIDM introduces a novel federated learning framework that uses iterative distribution matching to achieve fast and stable convergence and maintain high model utility even when facing a large proport…

View →
cs.MAcs.AIRecentJun 1, 2026

Dynamic Trust-Aware Sparse Communication Topology for LLM-Based Multi-Agent Consensus

Wanshuang Gou, Zihan Liu

The paper proposes DySCo, a dynamic trust-aware sparse consensus mechanism, to efficiently manage communication in multi-agent LLM systems by selectively connecting agents based on real-time value, th…

View →
cs.CRRecentJun 3, 2026

DIST-FL: Enhancing Security for TEE-based Aggregation in Federated Learning

Guanlong Wu, Ju Yang, Zhen Huang, Jianyu Niu +3 more

The paper proposes DIST-FL, a distributed system using multiple TEEs and an append-only ledger to enhance the security and robustness of federated learning aggregation against server-side adversaries.

View →
cs.CVcs.AIcs.LGRecentMay 30, 2026

DASH: Dual-Branch Score Distillation for Guidance-Calibrated Compact Diffusion Models

Abdullah Al Shafi, Kazi Saeed Alam, Sk Imran Hossain, Engelbert Mephu Nguifo

DASH introduces a dual-branch distillation framework to effectively compress class-conditional diffusion models by independently supervising both score branches, significantly preserving guidance fide…

View →
cs.LGcs.CRstat.MLRecentMay 8, 2026

Modulated learning for private and distributed regression with just a single sample per client device

Praneeth Vepakomma, Amirhossein Reisizadeh, Samuel Horváth, Munther A. Dahleh

The paper proposes a novel method for federated learning that allows devices holding only a single data sample to collaboratively train an accurate, privacy-preserving global model.

View →
cs.AIRecentMay 31, 2026

DAG-MoE: From Simple Mixture to Structural Aggregation in Mixture-of-Experts

Jiarui Feng, Hanqing Zeng, Karish Grover, Ruizhong Qiu +10 more

The paper proposes DAG-MoE, a novel sparse Mixture-of-Experts framework that replaces standard weighted-sum aggregation with structural aggregation to enhance model performance and enable multi-step r…

View →
cs.LGcs.AIRecentMay 30, 2026

Memory-Efficient LLM Training with Dynamic Sparsity: From Stability to Practical Scaling

Qiao Xiao, Boqian Wu, Patrik Okanovic, Tomasz Sternal +5 more

The paper introduces Sparse Memory-Efficient Training (SMET), a method that stabilizes and optimizes Dynamic Sparse Training (DST) for large language models, enabling stable and memory-efficient spars…

View →
cs.ROcs.AIcs.LGRecentJun 1, 2026

Network Distributed Multi-Agent Reinforcement Learning for Consensus Control of Quadcopters

Youssef Mahran, Zeyad Gamal, Aamir Ahmad, Ayman El-Badawy

The paper proposes a Network Distributed Multi-Agent Reinforcement Learning (ND-MARL) framework that enables stable, scalable consensus control for large swarms of quadcopters using only local neighbo…

View →
cs.CRcs.LGRecentMay 10, 2026

Privacy-Preserving Distributed Learning in IoT Systems: A Unified Threat Model and Evaluation Framework

John Cartmell, Alexander Williams

This paper introduces a unified threat model and evaluation framework to systematically compare privacy-preserving techniques for distributed learning in IoT systems, highlighting the trade-off betwee…

View →
cs.AIRecentMay 28, 2026

ConMoE: Expert-Pool Consolidation via Prototype Reassignment for MoE Compression

Yilun Yao, Jiaming Pan, Elsie Dai, Peizhuang Cong +2 more

ConMoE proposes a train-free method for compressing Mixture-of-Experts (MoE) models by consolidating the large expert pool into a smaller set of reusable prototypes and deterministically remapping all…

View →
cs.LGcs.AIRecentJun 1, 2026

ProbMoE: Differentiable Probabilistic Routing for Mixture-of-Experts

Heng Zhao, Zilei Shao, Guy Van den Broeck, Zhe Zeng

The paper introduces ProbMoE, a probabilistic routing framework that tackles the non-differentiability of top-$k$ routing in Mixture-of-Experts (MoE) models, achieving strong performance with improved…

View →
cs.CRcs.DCRecentMay 25, 2026

An Efficient and Privacy-Preserving Architecture for Cross-Institutional Collaborative RAG

Chenxin Mao, Shangyu Liu, Zhenzhe Zheng, Fan Wu +2 more

The paper introduces FedRAG, a novel federated RAG framework that enables privacy-preserving cross-institutional knowledge collaboration by decoupling the self-attention mechanism from data localizati…

View →
cs.LGcs.AIcs.CRRecentMay 11, 2026

DP-LAC: Lightweight Adaptive Clipping for Differentially Private Federated Fine-tuning of Language Models

Haaris Mehmood, Jie Xu, Karthikeyan Saravanan, Rogier Van Dalen +1 more

The paper proposes DP-LAC, a novel lightweight adaptive clipping technique for differentially private federated fine-tuning, which efficiently estimates and adapts the clipping threshold without consu…

View →