Abstract

We study asymptotic properties of optimal statistical estimators in global random search algorithms when the dimension of the feasible domain is large. The results obtained can be helpful in deciding what sample size is required for achieving a given accuracy of estimation.

Original languageEnglish
Title of host publicationLearning and Intelligent Optimization - 11th International Conference, LION 11, Revised Selected Papers
EditorsDmitri E. Kvasov, Yaroslav D. Sergeyev, Roberto Battiti, Roberto Battiti, Dmitri E. Kvasov, Yaroslav D. Sergeyev
PublisherSpringer Nature
Pages364-369
Number of pages6
ISBN (Print)9783319694030
DOIs
Publication statusPublished - 1 Jan 2017
Event11th International Conference on Learning and Intelligent Optimization, LION 2017 - Nizhny Novgorod
Duration: 18 Jun 201720 Jun 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10556 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Learning and Intelligent Optimization, LION 2017
CountryRussian Federation
CityNizhny Novgorod
Period18/06/1720/06/17

Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Statistical estimation in global random search algorithms in case of large dimensions'. Together they form a unique fingerprint.

Cite this