arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2205.08528stat.MLcs.LG
收藏

单调约束下的高维加性高斯过程

High-dimensional additive Gaussian processes under monotonicity constraints

CERAMATHS(CERAMATHS实验室);Univ. Polytechnique Hauts-de-France(上法兰西综合理工大学);IMT, UMR5219 CNRS(图卢兹数学研究所(法国国家科学研究中心混合研究单位5219));Université Paul Sabatier(保罗·萨巴蒂埃大学);INSA(国立应用科学学院)

Andrés F. López-Lopera, François Bachoc, Olivier Roustant

摘要:

我们引入了一个加性高斯过程的框架占单调性约束和可扩展到高维。我们的贡献是三方面的。首先,我们证明了我们的框架能够满足输入空间中的所有约束。我们还表明,更一般的分量线性不等式约束可以类似地处理,如分量凸性。其次,我们提出了一个加性MaxMod算法的顺序降维。通过顺序最大化平方范数准则,MaxMod识别活动输入维度并细化最重要的维度。该标准可以以线性成本显式计算。最后,我们为我们的完整框架提供开源代码。我们展示了性能和可扩展性的方法在几个合成的例子,数百个方面的单调性约束下,以及在现实世界中的洪水应用程序。

英文摘要:

We introduce an additive Gaussian process framework accounting for monotonicity constraints and scalable to high dimensions. Our contributions are threefold. First, we show that our framework enables to satisfy the constraints everywhere in the input space. We also show that more general componentwise linear inequality constraints can be handled similarly, such as componentwise convexity. Second, we propose the additive MaxMod algorithm for sequential dimension reduction. By sequentially maximizing a squared-norm criterion, MaxMod identifies the active input dimensions and refines the most important ones. This criterion can be computed explicitly at a linear cost. Finally, we provide open-source codes for our full framework. We demonstrate the performance and scalability of the methodology in several synthetic examples with hundreds of dimensions under monotonicity constraints as well as on a real-world flood application.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑