用分区域贝叶斯优化设计更优的猪饲料配方,兼顾成本与营养多样性。
Swine Diet Design using Multi-objective Regionalized Bayesian Optimization
- 将搜索空间分区域,提升多目标贝叶斯优化在高维问题中的解集质量。
- 生成的非支配解多样性更高,且性能优于文献中随机规划方法四倍。
- 支持批量查询,加速优化过程,适合实际饲料研发场景。
动物营养中的饲料配方设计是一个复杂问题,旨在开发低成本且满足最低营养需求的配方。传统基于代谢模型和可消化能量理论的方法难以整合动物生产性能或环境变量,并难以兼顾多个可持续发展目标。近年来,多目标贝叶斯优化(MOBO)被提出作为替代方案,可处理多种信息源、多目标及测量不确定性。然而,标准MOBO在高维空间中易陷入边界探索。本文提出多目标分区域贝叶斯优化(MRBO),将搜索空间划分为若干区域,生成局部候选解,以改进帕累托集与前沿的逼近效果。实验表明,该方法产生的非支配解更具多样性;且在找到优于文献中随机规划方法的解方面,效率提升四倍。通过每轮迭代批量生成候选解,优化过程可加速,且初期关键阶段的帕累托集近似质量不受影响。
原文摘要 · Abstract (English)
The design of food diets in the context of animal nutrition is a complex problem that aims to develop cost-effective formulations while balancing minimum nutritional content. Traditional approaches based on theoretical models of metabolic responses and concentrations of digestible energy in raw materials face limitations in incorporating zootechnical or environmental variables affecting the performance of animals and including multiple objectives aligned with sustainable development policies. Recently, multi-objective Bayesian optimization has been proposed as a promising heuristic alternative able to deal with the combination of multiple sources of information, multiple and diverse objectives, and with an intrinsic capacity to deal with uncertainty in the measurements that could be related to variability in the nutritional content of raw materials. However, Bayesian optimization encounters difficulties in high-dimensional search spaces, leading to exploration predominantly at the boundaries. This work analyses a strategy to split the search space into regions that provide local candidates termed multi-objective regionalized Bayesian optimization as an alternative to improve the quality of the Pareto set and Pareto front approximation provided by BO in the context of swine diet design. Results indicate that this regionalized approach produces more diverse non-dominated solutions compared to the standard multi-objective Bayesian optimization. Besides, the regionalized strategy was four times more effective in finding solutions that outperform those identified by a stochastic programming approach referenced in the literature. Experiments using batches of query candidate solutions per iteration show that the optimization process can also be accelerated without compromising the quality of the Pareto set approximation during the initial, most critical phase of optimization.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。