| Box, G. E. P., and Draper, N. R., Evolutionary Operation, John Wiley & Sons, Inc., New York, 1969. |
....with the least desirable function value) from the current simplex and replacing it with another vertex determined by a re ection through the centroid of the remaining vertices of the current simplex. The method proposed by Spendley et al. is closely related to the ideas of evolutionary operation [3, 17] and consists of a xed size general simplex (a simplex de ned by d 1 vertices in a d dimensional space) being used to locate the optimum, or at least the neighborhood of the optimum. Spendley et al. recommend tting some quadratic approximation to the response surface once a xed sized simplex ....
Box, G. E. P., and Draper, N. R., Evolutionary Operation, John Wiley & Sons, Inc., New York, 1969.
....definition has wide ranging application, it is by no means allencompassing. For some learning problems, we are not interested in the entire mapping X Y , but in finding the x that maximizes y. In this case, we may rely on the broad literature of optimization and response surface techniques [Box and Draper, 1969]. In other learning problems there may be additional constraints that must be considered, such as the need to avoid failure states. If the learner is required to perform as it learns (e.g. in a control task) we may also need to balance exploration and exploitation. Such constraints and costs ....
G. Box and N. Draper. (1969) Evolutionary operation.
No context found.
Box, G.E.P., and N.R. Draper. Evolutionary Operations. Wiley, 1969.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC