Questo prodotto usufruisce delle SPEDIZIONI GRATIS
selezionando l'opzione Corriere Veloce in fase di ordine.
Pagabile anche con Carta della cultura giovani e del merito, 18App Bonus Cultura e Carta del Docente
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.
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).
Il sito utilizza cookie ed altri strumenti di tracciamento che raccolgono informazioni dal dispositivo dell’utente. Oltre ai cookie tecnici ed analitici aggregati, strettamente necessari per il funzionamento di questo sito web, previo consenso dell’utente possono essere installati cookie di profilazione e marketing e cookie dei social media. Cliccando su “Accetto tutti i cookie” saranno attivate tutte le categorie di cookie. Per accettare solo deterninate categorie di cookie, cliccare invece su “Impostazioni cookie”. Chiudendo il banner o continuando a navigare saranno installati solo cookie tecnici. Per maggiori dettagli, consultare la Cookie Policy.