Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

Composing insight from the full article — this may take a moment.

Sursă care acoperăarXiv

Domain-Aware Hierarchical Federated Learning for UAV Swarms Across Heterogeneous Environments

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2611.01812v1 Announce Type: cross Abstract: Hierarchical federated learning (HFL) enables communication-efficient training in unmanned aerial vehicle (UAV) swarms, but performance degrades under changing and heterogeneous environments. This paper proposes domain-aware HFL (DA-HFL), integrating mobility-informed clustering, cluster-level aggregation, cloud-based Fisher-weighted merging, a domain-adversarial shared backbone, environment-specific heads, and gated inference with local adaptation. A mission-weighted optimization formulation incorporates energy, latency, and cluster-head eligibility constraints. Theoretical analysis establishes resource feasibility, a conditional backbone-stationarity bound, the quadratic optimality of Fisher-weighted merging, and communication and computation complexity bounds. Simulations across four heterogeneous environments demonstrate faster convergence, improved accuracy during environmental transitions, and more stable, purer clusters than the evaluated baselines, with modest energy overhead over resource-aware HFL. Ablation studies validate the contributions of the proposed components.

Abstract:Hierarchical federated learning (HFL) enables communication-efficient training in unmanned aerial vehicle (UAV) swarms, but performance degrades under changing and heterogeneous environments. This paper proposes domain-aware HFL (DA-HFL), integrating mobility-informed clustering, cluster-level aggregation, cloud-based Fisher-weighted merging, a domain-adversarial shared backbone, environment-specific heads, and gated inference with local adaptation. A mission-weighted optimization formulation incorporates energy, latency, and cluster-head eligibility constraints. Theoretical analysis establishes resource feasibility, a conditional backbone-stationarity bound, the quadratic optimality of Fisher-weighted merging, and communication and computation complexity bounds. Simulations across four heterogeneous environments demonstrate faster convergence, improved accuracy during environmental transitions, and more stable, purer clusters than the evaluated baselines, with modest energy overhead over resource-aware HFL. Ablation studies validate the contributions of the proposed components.

Signal Processing (eess.SP); Machine Learning (cs.LG)

arXiv:2611.01812 [eess.SP]

(or arXiv:2611.01812v1 [eess.SP] for this version)

https://doi.org/10.48550/arXiv.2611.01812 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Text integral sub licența deschisă a publicației · 214 cuvinte

Subiecte conexe