用户名  找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Evolutionary Learning: Advances in Theories and Algorithms; Zhi-Hua Zhou,Yang Yu,Chao Qian Book 2019 Springer Nature Singapore Pte Ltd. 20

[复制链接]
查看: 41311|回复: 54
发表于 2025-3-21 17:24:25 | 显示全部楼层 |阅读模式
书目名称Evolutionary Learning: Advances in Theories and Algorithms
编辑Zhi-Hua Zhou,Yang Yu,Chao Qian
视频video
概述Presents theoretical results for evolutionary learning.Provides general theoretical tools for analysing evolutionary algorithms.Proposes evolutionary learning algorithms with provable theoretical guar
图书封面Titlebook: Evolutionary Learning: Advances in Theories and Algorithms;  Zhi-Hua Zhou,Yang Yu,Chao Qian Book 2019 Springer Nature Singapore Pte Ltd. 20
描述.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 opt
出版日期Book 2019
关键词Artificial intelligence; Machine Learning; Evolutionary Learning; Evolutionary Algorithms; Evolutionary
版次1
doihttps://doi.org/10.1007/978-981-13-5956-9
isbn_ebook978-981-13-5956-9
copyrightSpringer Nature Singapore Pte Ltd. 2019
The information of publication is updating

书目名称Evolutionary Learning: Advances in Theories and Algorithms影响因子(影响力)




书目名称Evolutionary Learning: Advances in Theories and Algorithms影响因子(影响力)学科排名




书目名称Evolutionary Learning: Advances in Theories and Algorithms网络公开度




书目名称Evolutionary Learning: Advances in Theories and Algorithms网络公开度学科排名




书目名称Evolutionary Learning: Advances in Theories and Algorithms被引频次




书目名称Evolutionary Learning: Advances in Theories and Algorithms被引频次学科排名




书目名称Evolutionary Learning: Advances in Theories and Algorithms年度引用




书目名称Evolutionary Learning: Advances in Theories and Algorithms年度引用学科排名




书目名称Evolutionary Learning: Advances in Theories and Algorithms读者反馈




书目名称Evolutionary Learning: Advances in Theories and Algorithms读者反馈学科排名




单选投票, 共有 0 人参与投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:22:44 | 显示全部楼层
Existence: Semantics and Syntaxhe original constrained optimization problem into a bi-objective optimization problem, is probably better than the commonly employed penalty method and the greedy method. Its effectiveness is moreover verified in machine learning tasks.
发表于 2025-3-22 03:58:59 | 显示全部楼层
发表于 2025-3-22 05:52:30 | 显示全部楼层
Constrained Optimizationhe original constrained optimization problem into a bi-objective optimization problem, is probably better than the commonly employed penalty method and the greedy method. Its effectiveness is moreover verified in machine learning tasks.
发表于 2025-3-22 12:45:42 | 显示全部楼层
发表于 2025-3-22 15:45:19 | 显示全部楼层
发表于 2025-3-22 20:45:09 | 显示全部楼层
发表于 2025-3-22 23:00:49 | 显示全部楼层
发表于 2025-3-23 03:25:26 | 显示全部楼层
发表于 2025-3-23 08:47:39 | 显示全部楼层
https://doi.org/10.1007/978-94-007-4207-9helpful, while for easy problems, it can be harmful. The findings are verified in the experiments. We also prove that the two common strategies, i.e., threshold selection and sampling, can bring robustness against noise when it is harmful.
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-23 21:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表