Evolutionary Learning: Advances in Theories and Algorithms
Home > Computer & Internet > Computer programming / software development > Compilers > Evolutionary Learning: Advances in Theories and Algorithms
Evolutionary Learning: Advances in Theories and Algorithms

Evolutionary Learning: Advances in Theories and Algorithms

|
     0     
5
4
3
2
1




International Edition


About the Book

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.


About the Author:

Zhi-Hua Zhou is a Professor, founding director of the LAMDA Group, Head of the Department of Computer Science and Technology of Nanjing University, China. He authored the books "Ensemble Methods: Foundations and Algorithms" (2012) and "Machine Learning" (in Chinese, 2016), and published many papers in top venues in artificial intelligence and machine learning. His H-index is 89 according to Google Scholar. He founded ACML (Asian Conference on Machine Learning), and served as chairs for many prestigious conferences such as AAAI 2019 program chair, ICDM 2016 general chair, etc., and served as action/associate editor for prestigious journals such as PAMI, Machine Learning journal, etc. He is a Fellow of the ACM, AAAI, AAAS, IEEE and IAPR.

Yang Yu is an associate Professor of Nanjing University, China. His research interests are in artificial intelligence, including reinforcement learning, machine learning, and derivative-free optimization. He was recognized in "AI's 10 to Watch" by IEEE Intelligent Systems 2018, and received several awards/honors including the PAKDD Early Career Award, IJCAI'18 Early Career Spotlight talk, National Outstanding Doctoral Dissertation Award, China Computer Federation Outstanding Doctoral Dissertation Award, PAKDD'08 Best Paper Award, GECCO'11 Best Paper (Theory Track), etc. He is a Junior Associate Editor of Frontiers of Computer Science, and an Area Chair of ACML'17, IJCAI'18, and ICPR'18.

Chao Qian is an associate Researcher of University of Science and Technology of China, China. His research interests are in artificial intelligence, evolutionary computation and machine learning. He has published over 20 papers in leading international journals and conference proceedings, including Artificial Intelligence, Evolutionary Computation, IEEE Transactions on Evolutionary Computation, Algorithmica, NIPS, IJCAI, AAAI, etc. He has won the ACM GECCO 2011 Best Paper Award (Theory Track) and the IDEAL 2016 Best Paper Award. He has also been chair of IEEE Computational Intelligence Society (CIS) Task Force "Theoretical Foundations of Bio-inspired Computation".


Best Sellers



Product Details
  • ISBN-13: 9789811359552
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Height: 234 mm
  • No of Pages: 361
  • Spine Width: 22 mm
  • Width: 156 mm
  • ISBN-10: 9811359555
  • Publisher Date: 03 Jun 2019
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Weight: 752 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Evolutionary Learning: Advances in Theories and Algorithms
Springer -
Evolutionary Learning: Advances in Theories and Algorithms
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Evolutionary Learning: Advances in Theories and Algorithms

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!