arXiv:2609.06830cs.LGcs.DC2026-09

用约束贝叶斯优化,高效配置物联网植物病害分类的联邦学习

Constrained Bayesian Optimization for Hierarchical Federated Learning in IoT Networks for Plant Disease Classification

论文配图:Constrained Bayesian Optimization for Hierarchical Federated Learning in IoT Networks for Plant Disease Classification
图 1 · 摘自论文原文
  • 联合优化模型结构、聚合策略和通信轮数,兼顾性能与资源消耗
  • 仅探索11.11%搜索空间,平均最优差距仅0.056%,接近全局最优
  • 适合资源受限的智能农业场景,可快速找到高性价比部署方案

在资源受限的物联网环境中部署分层联邦学习(HFL)需精细调参以平衡预测性能、能耗与执行时间。本研究针对智慧农业中分布式物联网设备支持的植物病害自动分类任务,提出一种约束贝叶斯优化框架,用于高效配置HFL部署。该方法联合优化深度学习骨干网络架构、聚合策略及通信轮数,同时根据农田空间覆盖需求确定联邦规模。通过加权目标函数体现用户定义的能耗、时延与性能权衡,并引入显式约束确保满足特定资源与精度要求。在多个深度网络、聚合策略与通信轮次设置下进行评估,30次独立优化实验表明,所提方法仅探索11.11%的搜索空间,始终找到距离穷举最优解1%内的解,平均最优差距仅为0.056%。

原文摘要 · Abstract (English)

The deployment of Hierarchical Federated Learning (HFL) in resource-constrained Internet of Things (IoT) environments requires careful configuration to balance predictive performance with energy consumption and execution time. This challenge is particularly relevant to smart agriculture, where distributed IoT devices can support automated plant disease classification while operating under limited computational and communication resources. This paper presents a constrained Bayesian Optimization framework for the efficient configuration of HFL deployments. The proposed approach jointly explores the deep learning backbone architecture, aggregation strategy, and number of communication rounds, while the federation size is determined according to the spatial coverage requirements of the agricultural deployment. A weighted objective function captures user-defined trade-offs among energy consumption, execution time, and predictive performance, while explicit constraints ensure compliance with deployment-specific resource and accuracy requirements. The framework is evaluated on an IoT-based plant disease classification task considering multiple deep learning architectures, federated aggregation strategies, and communication-round settings. Experimental results across 30 independent optimization runs show that the proposed approach explores only 11.11% of the search space, while consistently identifying solutions within 1% of the exhaustive-search optimum, with a mean optimality gap of only 0.056%.

联邦学习物联网优化农业AI

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。