About: Evolutionary optimization with active learning of surrogate models and fixed evaluation batch size

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Evolutionary optimization with active learning of surrogate models and fixed evaluation batch size Goto Sponge Distinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	Evolutionary optimization is often applied to problems, where simulations or experiments used as the fitness function are expensive to run. In such cases, surrogate models are used to reduce the number of fitness evaluations. Some of the problems also require a fixed size batch of solutions to be evaluated at a time. Traditional methods of selecting individuals for true evaluation to improve the surrogate model either require individual points to be evaluated, or couple the batch size with the EA generation size. We propose a queue based method for individual selection based on active learning of a kriging model. Individuals are selected using the confidence intervals predicted by the model, added to a queue and evaluated once the queue length reaches the batch size. The method was tested on several standard benchmark problems. Results show that the proposed algorithm is able to achieve a solution using significantly less evaluations of the true fitness function. The effect of the batc Evolutionary optimization is often applied to problems, where simulations or experiments used as the fitness function are expensive to run. In such cases, surrogate models are used to reduce the number of fitness evaluations. Some of the problems also require a fixed size batch of solutions to be evaluated at a time. Traditional methods of selecting individuals for true evaluation to improve the surrogate model either require individual points to be evaluated, or couple the batch size with the EA generation size. We propose a queue based method for individual selection based on active learning of a kriging model. Individuals are selected using the confidence intervals predicted by the model, added to a queue and evaluated once the queue length reaches the batch size. The method was tested on several standard benchmark problems. Results show that the proposed algorithm is able to achieve a solution using significantly less evaluations of the true fitness function. The effect of the batc (en)
Title	Evolutionary optimization with active learning of surrogate models and fixed evaluation batch size Evolutionary optimization with active learning of surrogate models and fixed evaluation batch size (en)
skos:prefLabel	Evolutionary optimization with active learning of surrogate models and fixed evaluation batch size Evolutionary optimization with active learning of surrogate models and fixed evaluation batch size (en)
skos:notation	RIV/67985807:_____/12:00384885!RIV13-GA0-67985807
http://linked.open...avai/predkladatel	Ústav informatiky AV ČR, v.v.i.
http://linked.open...avai/riv/aktivita	I P S
http://linked.open...avai/riv/aktivity	I, P(GA201/08/0802), S
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Holeňa, Martin
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Ústav informatiky AV ČR, v. v. i.
http://linked.open...dnocenehoVysledku	135326
http://linked.open...ai/riv/idVysledku	RIV/67985807:_____/12:00384885
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	evolutionary optimization; fitness evaluation; surrogate modelling; Gaussian process; active learning (en)
http://linked.open.../riv/klicoveSlovo	evolutionary optimization surrogate modelling active learning Gaussian process fitness evaluation
http://linked.open...ontrolniKodProRIV	[49C7BB6CA6A7]
http://linked.open...v/mistoKonaniAkce	Ždiar
http://linked.open...i/riv/mistoVydani	Seňa
http://linked.open...i/riv/nazevZdroje	Information Technologies - Applications and Theory
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Applications of Methods of Knowledge Engineering in Data Mining
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Holeňa, Martin Charypar, V.
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2012-09-17 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	PONT s.r.o.
https://schema.org/isbn	978-80-971144-0-4
is http://linked.open...avai/riv/vysledek of	Evolutionary optimization with active learning of surrogate models and fixed evaluation batch size

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software