國立虎尾科技大學 |

General-Purpose Optimization Through Information Maximization

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	General-Purpose Optimization Through Information Maximization/ by Alan J. Lockett.
作者:	Lockett, Alan J.
面頁冊數:	XVIII, 561 p.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematics of Computing. -
電子資源:	https://doi.org/10.1007/978-3-662-62007-6
ISBN:	9783662620076

General-Purpose Optimization Through Information Maximization
Lockett, Alan J.

General-Purpose Optimization Through Information Maximization[electronic resource] /by Alan J. Lockett. - 1st ed. 2020. - XVIII, 561 p.online resource. - Natural Computing Series,1619-7127. - Natural Computing Series,.

Introduction -- Review of Optimization Methods -- Functional Analysis of Optimization -- A Unified View of Population-Based Optimizers -- Continuity of Optimizers -- The Optimization Process -- Performance Analysis -- Performance Experiments -- No Free Lunch Does Not Prevent General Optimization -- The Geometry of Optimization and the Optimization Game -- The Evolutionary Annealing Method -- Evolutionary Annealing In Euclidean Space -- Neuroannealing -- Discussion and Future Work -- Conclusion -- App. A, Performance Experiment Results -- App. B, Automated Currency Exchange Trading. .

This book examines the mismatch between discrete programs, which lie at the center of modern applied mathematics, and the continuous space phenomena they simulate. The author considers whether we can imagine continuous spaces of programs, and asks what the structure of such spaces would be and how they would be constituted. He proposes a functional analysis of program spaces focused through the lens of iterative optimization. The author begins with the observation that optimization methods such as Genetic Algorithms, Evolution Strategies, and Particle Swarm Optimization can be analyzed as Estimation of Distributions Algorithms (EDAs) in that they can be formulated as conditional probability distributions. The probabilities themselves are mathematical objects that can be compared and operated on, and thus many methods in Evolutionary Computation can be placed in a shared vector space and analyzed using techniques of functional analysis. The core ideas of this book expand from that concept, eventually incorporating all iterative stochastic search methods, including gradient-based methods. Inspired by work on Randomized Search Heuristics, the author covers all iterative optimization methods and not just evolutionary methods. The No Free Lunch Theorem is viewed as a useful introduction to the broader field of analysis that comes from developing a shared mathematical space for optimization algorithms. The author brings in intuitions from several branches of mathematics such as topology, probability theory, and stochastic processes and provides substantial background material to make the work as self-contained as possible. The book will be valuable for researchers in the areas of global optimization, machine learning, evolutionary theory, and control theory.

ISBN: 9783662620076

Standard No.: 10.1007/978-3-662-62007-6doiSubjects--Topical Terms:

669457
Mathematics of Computing.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

General-Purpose Optimization Through Information Maximization
LDR:03808nam a22004335i 4500 001 1025927
003 DE-He213
005 20200816084800.0
007 cr nn 008mamaa
008 210318s2020 gw | s |||| 0|eng d
020 $a 9783662620076 $9 978-3-662-62007-6
024 7 $a 10.1007/978-3-662-62007-6 $2 doi
035 $a 978-3-662-62007-6
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Lockett, Alan J. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1322236
245 1 0 $a General-Purpose Optimization Through Information Maximization $h [electronic resource] / $c by Alan J. Lockett.
250 $a 1st ed. 2020.
264 1 $a Berlin, Heidelberg : $b Springer Berlin Heidelberg : $b Imprint: Springer, $c 2020.
300 $a XVIII, 561 p. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
490 1 $a Natural Computing Series, $x 1619-7127
505 0 $a Introduction -- Review of Optimization Methods -- Functional Analysis of Optimization -- A Unified View of Population-Based Optimizers -- Continuity of Optimizers -- The Optimization Process -- Performance Analysis -- Performance Experiments -- No Free Lunch Does Not Prevent General Optimization -- The Geometry of Optimization and the Optimization Game -- The Evolutionary Annealing Method -- Evolutionary Annealing In Euclidean Space -- Neuroannealing -- Discussion and Future Work -- Conclusion -- App. A, Performance Experiment Results -- App. B, Automated Currency Exchange Trading. .
520 $a This book examines the mismatch between discrete programs, which lie at the center of modern applied mathematics, and the continuous space phenomena they simulate. The author considers whether we can imagine continuous spaces of programs, and asks what the structure of such spaces would be and how they would be constituted. He proposes a functional analysis of program spaces focused through the lens of iterative optimization. The author begins with the observation that optimization methods such as Genetic Algorithms, Evolution Strategies, and Particle Swarm Optimization can be analyzed as Estimation of Distributions Algorithms (EDAs) in that they can be formulated as conditional probability distributions. The probabilities themselves are mathematical objects that can be compared and operated on, and thus many methods in Evolutionary Computation can be placed in a shared vector space and analyzed using techniques of functional analysis. The core ideas of this book expand from that concept, eventually incorporating all iterative stochastic search methods, including gradient-based methods. Inspired by work on Randomized Search Heuristics, the author covers all iterative optimization methods and not just evolutionary methods. The No Free Lunch Theorem is viewed as a useful introduction to the broader field of analysis that comes from developing a shared mathematical space for optimization algorithms. The author brings in intuitions from several branches of mathematics such as topology, probability theory, and stochastic processes and provides substantial background material to make the work as self-contained as possible. The book will be valuable for researchers in the areas of global optimization, machine learning, evolutionary theory, and control theory.
650 2 4 $a Mathematics of Computing. $3 669457
650 2 4 $a Optimization. $3 669174
650 2 4 $a Artificial Intelligence. $3 646849
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Computer science—Mathematics. $3 1253519
650 0 $a Mathematical optimization. $3 527675
650 0 $a Artificial intelligence. $3 559380
650 0 $a Computers. $3 565115
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783662620069
776 0 8 $i Printed edition: $z 9783662620083
776 0 8 $i Printed edition: $z 9783662620090
830 0 $a Natural Computing Series, $x 1619-7127 $3 1256952
856 4 0 $u https://doi.org/10.1007/978-3-662-62007-6
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)