Abstract

The metamodel-based high-dimensional model representation (e.g., RBF-HDMR) has recently been proven to be very promising for modeling high dimensional functions. A frequently encountered scenario in practical engineering problems is the need of building accurate models under limited computational budget. In this context, the original RBF-HDMR approach may be intractable due to the independent and successive treatment of the component functions, which translates in a lack of knowledge on when the modeling process will stop and how many points (simulations) it will cost. This article proposes an adaptive and tractable RBF-HDMR (ARBF-HDMR) modeling framework. Given a total of Nmax points, it first uses Nini points to build an initial RBF-HDMR model for capturing the characteristics of the target function f, and then keeps adaptively identifying, sampling and modeling the potential cuts with the remaining Nmax ź Nini points. For the second-order ARBF-HDMR, Nini ź [2n + 2,2n2 + 2] not only depends on the dimensionality n but also on the characteristics of f. Numerical results on nine cases with up to 30 dimensions reveal that the proposed approach provides more accurate predictions than the original RBF-HDMR with the same computational budget, and the version that uses the maximin sampling criterion and the best-model strategy is a recommended choice. Moreover, the second-order ARBF-HDMR model significantly outperforms the first-order model; however, if the computational budget is strictly limited (e.g., 2n + 1

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.