Evolutionary Learning: Advances in Theories and Algorithms

個数：

Evolutionary Learning: Advances in Theories and Algorithms

Zhou, Zhi-Hua/ Yu, Yang/ Qian, Chao

ウェブストア価格 ¥33,564（本体¥30,513）
Springer Verlag, Singapore（2019/06発売）
外貨定価 US$ 159.99
ポイント 305pt

提携先の海外書籍取次会社に在庫がございます。通常3週間で発送いたします。
【重要ご説明事項】
1. 納期遅延や、ご入手不能となる場合が若干ございます。
2. 複数冊ご注文の場合は、ご注文数量が揃ってからまとめて発送いたします。
3. 美品のご指定は承りかねます。

●3Dセキュア導入とクレジットカードによるお支払いについて

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Hardcover:ハードカバー版／ページ数 361 p.
言語 ENG
商品コード 9789811359552
DDC分類 006

Full Description

Many machine learning tasks involve solving complex optimization problems, such as working on non-differentiable, non-continuous, and non-unique objective functions; in some cases it can prove difficult to even define an explicit objective function. Evolutionary learning applies evolutionary algorithms to address optimization problems in machine learning, and has yielded encouraging outcomes in many applications. However, due to the heuristic nature of evolutionary optimization, most outcomes to date have been empirical and lack theoretical support. This shortcoming has kept evolutionary learning from being well received in the machine learning community, which favors solid theoretical approaches.

Recently there have been considerable efforts to address this issue. This book presents a range of those efforts, divided into four parts. Part I briefly introduces readers to evolutionary learning and provides some preliminaries, while Part II presents general theoretical tools for the analysis of running time and approximation performance in evolutionary algorithms. Based on these general tools, Part III presents a number of theoretical findings on major factors in evolutionary optimization, such as recombination, representation, inaccurate fitness evaluation, and population. In closing, Part IV addresses the development of evolutionary learning algorithms with provable theoretical guarantees for several representative tasks, in which evolutionary learning offers excellent performance.

1.Introduction.- 2. Preliminaries.- 3. Running Time Analysis: Convergence-based Analysis.- 4. Running Time Analysis: Switch Analysis.- 5. Running Time Analysis: Comparison and Unification.- 6. Approximation Analysis: SEIP.- 7. Boundary Problems of EAs.- 8. Recombination.- 9. Representation.- 10. Inaccurate Fitness Evaluation.- 11. Population.- 12. Constrained Optimization.- 13. Selective Ensemble.- 14. Subset Selection.- 15. Subset Selection: k-Submodular Maximization.- 16. Subset Selection: Ratio Minimization.- 17. Subset Selection: Noise.- 18. Subset Selection: Acceleration.