OPTIMAL LEARNING WITH LOCAL NONLINEAR PARAMETRIC MODELS OVER CONTINUOUS DESIGNS

被引:4
作者
He, Xinyu [1 ]
Reyes, Kristofer G. [2 ]
Powell, Warren B. [3 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] SUNY Univ Buffalo, Dept Mat Design & Innovat, Buffalo, NY 14260 USA
[3] Princeton Univ, Dept Operat Res & Financial Engn, Princeton, NJ 08544 USA
关键词
optimal learning; knowledge gradient; local approximation; nonlinear parametric models; KNOWLEDGE-GRADIENT; GLOBAL OPTIMIZATION; SIMULATION; CARBON; ALLOCATION; SELECTION; KINETICS; SEARCH; POLICY;
D O I
10.1137/19M1245608
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We consider the problem of optimizing an unknown function over a multidimensional continuous domain, where function evaluation is noisy and expensive. We assume that a globally accurate model of the function is not available, but there exist some parametric models that can well approximate the function in local regions. In this paper, we propose an algorithm in the optimal learning framework that learns the shape of the function and finds the optimal design with a limited number of measurements. We construct belief functions using a radial basis function-based local approximation technique, and use the knowledge gradient policy to decide where to measure, aiming at maximizing the value of information from each measurement. Experiments on both synthetic test problems and a real materials science application show the strong performance of our algorithm.
引用
收藏
页码:A2134 / A2157
页数:24
相关论文
共 63 条
[1]   A global search method for discrete stochastic optimization [J].
Andradottir, S .
SIAM JOURNAL ON OPTIMIZATION, 1996, 6 (02) :513-530
[2]   Adaptive Random Search for Continuous Simulation Optimization [J].
Andradottir, Sigrun ;
Prudius, Andrei A. .
NAVAL RESEARCH LOGISTICS, 2010, 57 (06) :583-604
[3]  
[Anonymous], WILEY SER PROBAB STA
[4]  
[Anonymous], 2008, Probability, Statistics, and Random Processes for Electrical Engineering
[5]  
Audibert J.-Y., P 23 C LEARN THEOR C
[6]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[7]   Optimal learning for sequential sampling with non-parametric beliefs [J].
Barut, Emre ;
Powell, Warren B. .
JOURNAL OF GLOBAL OPTIMIZATION, 2014, 58 (03) :517-543
[8]  
Bening V.E., 2012, Generalized Poisson models and their applications in insurance and finance
[9]   A survey on metaheuristics for stochastic combinatorial optimization [J].
Bianchi L. ;
Dorigo M. ;
Gambardella L.M. ;
Gutjahr W.J. .
Natural Computing, 2009, 8 (2) :239-287
[10]   A rigorous framework for optimization of expensive functions by surrogates [J].
Booker A.J. ;
Dennis Jr. J.E. ;
Frank P.D. ;
Serafini D.B. ;
Torczon V. ;
Trosset M.W. .
Structural optimization, 1999, 17 (1) :1-13