Many software systems can be tuned for multiple objectives (e.g., faster runtime, less required memory, less network traffic or energy consumption, etc.). Optimizers built for different objectives suffer from "model disagreement"; i.e., they have different (or even opposite) insights and tactics on how to optimize a system. Model disagreement is rampant (at least for configuration problems). Yet prior to this paper, it has barely been explored. This paper shows that model disagreement can be mitigated via VEER, a one-dimensional approximation to the N-objective space. Since it is exploring a simpler goal space, VEER runs very fast (for eleven configuration problems). Even for our largest problem (with tens of thousands of possible configurations), VEER finds as good or better optimizations with zero model disagreements, three orders of magnitude faster (since its one-dimensional output no longer needs the sorting procedure). Based on the above, we recommend VEER as a very fast method to solve complex configuration problems, while at the same time avoiding model disagreement.
翻译:许多软件系统可以适应多重目标(例如,运行时间加快、记忆需求减少、网络交通或能源消耗减少等)。为不同目标而建造的优化器因“模式分歧”而受到影响;即它们对于如何优化系统有不同(甚至相反)的洞察力和策略。模型分歧非常普遍(至少对配置问题而言是如此)。在本文之前,它几乎没有被探讨过。本文表明,模型分歧可以通过VeER(向N目标空间的单维近似)来缓解。由于它正在探索一个更简单的目标空间,VeER运行速度非常快(11个配置问题)。即使我们最大的问题(可能有数万个配置),VeER发现零模式分歧是良好或更好的优化,三个规模更快(因为其单维输出不再需要排序程序)。基于以上,我们建议VeER作为解决复杂配置问题的非常快速的方法,同时避免模式分歧。