Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

Black Box Optimization, Machine Learning, and No-Free Lunch Theorems

Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
Catalogue Information
Field name Details
Dewey Class 519.6
Title Black Box Optimization, Machine Learning, and No-Free Lunch Theorems ([EBook] /) / edited by Panos M. Pardalos, Varvara Rasskazova, Michael N. Vrahatis.
Added Personal Name Pardalos, Panos M.
Rasskazova, Varvara
Vrahatis, Michael N.
Other name(s) SpringerLink (Online service)
Edition statement 1st ed. 2021.
Publication Cham : : Springer International Publishing : : Imprint: Springer, , 2021.
Physical Details X, 388 p. 113 illus., 90 illus. in color. : online resource.
Series Springer Optimization and Its Applications 1931-6836 ; ; 170
ISBN 9783030665159
Summary Note This edited volume illustrates the connections between machine learning techniques, black box optimization, and no-free lunch theorems. Each of the thirteen contributions focuses on the commonality and interdisciplinary concepts as well as the fundamentals needed to fully comprehend the impact of individual applications and problems. Current theoretical, algorithmic, and practical methods used are provided to stimulate a new effort towards innovative and efficient solutions. The book is intended for beginners who wish to achieve a broad overview of optimization methods and also for more experienced researchers as well as researchers in mathematics, optimization, operations research, quantitative logistics, data analysis, and statistics, who will benefit from access to a quick reference to key topics and methods. The coverage ranges from mathematically rigorous methods to heuristic and evolutionary approaches in an attempt to equip the reader with different viewpoints of the same problem.:
Contents note Learning enabled constrained black box optimization (Archetti) -- Black-box optimization: Methods and applications (Hasan) -- Tuning algorithms for stochastic black-box optimization: State of the art and future perspectives (Bartz-Beielstein) -- Quality diversity optimization: A novel branch of stochastic optimization (Chatzilygeroudis) -- Multi-objective evolutionary algorithms: Past, present and future (Coello C.A) -- Black-box and data driven computation (Du) -- Mathematically rigorous global optimization and fuzzy optimization: A brief comparison of paradigms, methods, similarities and differences (Kearfott) -- Optimization under Uncertainty Explains Empirical Success of Deep Learning Heuristics (Kreinovich) -- Variable neighborhood programming as a tool of machine learning (Mladenovic) -- Non-lattice covering and quanitization of high dimensional sets (Zhigljavsky) -- Finding effective SAT partitionings via black-box optimization (Semenov) -- The No Free Lunch Theorem: What are its main implications for the optimization practice? ( Serafino) -- What is important about the No Free Lunch theorems? (Wolpert).
Mode of acces to digital resource Mode of access: World Wide Web. System requirements: Internet Explorer 6.0 (or higher) or Firefox 2.0 (or higher). Available as searchable text in PDF format.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users).
Internet Site https://doi.org/10.1007/978-3-030-66515-9
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 51848 Beginning of record . Catalogue Information 51848 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating51848
Quick Search