View in EDS HTML Full Text PDF Full Text

Latin Hypercube Designs with Branching and Nested Factors for Initialization of Automatic Algorithm Configuration.

Saved in:
Bibliographic Details
Title: Latin Hypercube Designs with Branching and Nested Factors for Initialization of Automatic Algorithm Configuration.
Authors: Wessing, Simon1, López-Ibáñez, Manuel2
Source: Evolutionary Computation. Spring2019, Vol. 27 Issue 1, p129-145. 17p.
Subjects: Hypercube networks (Computer networks), Evolutionary computation, Metaheuristic algorithms, Monte Carlo method, Computers
Abstract: The configuration of algorithms is a laborious and difficult process. Thus, it is advisable to automate this task by using appropriate automatic configuration methods. The irace method is among the most widely used in the literature. By default, irace initializes its search process via uniform sampling of algorithm configurations. Although better initialization methods exist in the literature, the mixed-variable (numerical and categorical) nature of typical parameter spaces and the presence of conditional parameters make most of the methods not applicable in practice. Here, we present an improved initialization method that overcomes these limitations by employing concepts from the design and analysis of computer experiments with branching and nested factors. Our results show that this initialization method is not only better, in some scenarios, than the uniform sampling used by the current version of irace , but also better than other initialization methods present in other automatic configuration methods. [ABSTRACT FROM AUTHOR]
Copyright of Evolutionary Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 135057795
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Latin Hypercube Designs with Branching and Nested Factors for Initialization of Automatic Algorithm Configuration.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Wessing%2C+Simon%22">Wessing, Simon</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22López-Ibáñez%2C+Manuel%22">López-Ibáñez, Manuel</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Evolutionary+Computation%22">Evolutionary Computation</searchLink>. Spring2019, Vol. 27 Issue 1, p129-145. 17p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Hypercube+networks+%28Computer+networks%29%22">Hypercube networks (Computer networks)</searchLink><br /><searchLink fieldCode="DE" term="%22Evolutionary+computation%22">Evolutionary computation</searchLink><br /><searchLink fieldCode="DE" term="%22Metaheuristic+algorithms%22">Metaheuristic algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Monte+Carlo+method%22">Monte Carlo method</searchLink><br /><searchLink fieldCode="DE" term="%22Computers%22">Computers</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The configuration of algorithms is a laborious and difficult process. Thus, it is advisable to automate this task by using appropriate automatic configuration methods. The irace method is among the most widely used in the literature. By default, irace initializes its search process via uniform sampling of algorithm configurations. Although better initialization methods exist in the literature, the mixed-variable (numerical and categorical) nature of typical parameter spaces and the presence of conditional parameters make most of the methods not applicable in practice. Here, we present an improved initialization method that overcomes these limitations by employing concepts from the design and analysis of computer experiments with branching and nested factors. Our results show that this initialization method is not only better, in some scenarios, than the uniform sampling used by the current version of irace , but also better than other initialization methods present in other automatic configuration methods. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Evolutionary Computation is the property of MIT Press and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=135057795
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1162/evco_a_00241
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 17
        StartPage: 129
    Subjects:
      – SubjectFull: Hypercube networks (Computer networks)
        Type: general
      – SubjectFull: Evolutionary computation
        Type: general
      – SubjectFull: Metaheuristic algorithms
        Type: general
      – SubjectFull: Monte Carlo method
        Type: general
      – SubjectFull: Computers
        Type: general
    Titles:
      – TitleFull: Latin Hypercube Designs with Branching and Nested Factors for Initialization of Automatic Algorithm Configuration.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Wessing, Simon
      – PersonEntity:
          Name:
            NameFull: López-Ibáñez, Manuel
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Spring2019
              Type: published
              Y: 2019
          Identifiers:
            – Type: issn-print
              Value: 10636560
          Numbering:
            – Type: volume
              Value: 27
            – Type: issue
              Value: 1
          Titles:
            – TitleFull: Evolutionary Computation
              Type: main
ResultId 1