Black Box Optimization, Machine Learning, and No-Free Lunch Theorems
Description
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.
More details
Other editions
Additional editions
Persons
Varvara A. Rasskazova is aResearcher and Senior Lecture in Moscow Aviation Institute. The area of scientific interests is discrete optimization and guaranteed approximation algorithms for solving transportation and assignment problems on Railway and Metallurgical Production. She is an active participant of regular international conferences on Operations Research and Mathematical Programming, and author of more than 40 publications.
Michael N. Vrahatis focuses on mathematics, natural computing and computational intelligence, global optimization, reliable computing and imprecise data, artificial neural networks and machine learning. He has participated in the organization of over 300 conferences serving at several positions, and participated in more than 240 conferences, congresses and advanced schools as active participant, speaker or keynote speaker. He has been a visiting research fellow in many different institutions including Cornell, MIT, CERN, and INRIA. He is a professor in the Department of Mathematics at the University of Patras since 2000. He is also serving as the director of the newly founded Institute of Artificial Intelligence of University of Patras. The corpus of his work consists of over 400 publications. According to Google Scholar his work has been cited more than 16000 times (h-index 56).
Content
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).
