Page History: CIS Webminar: Towards Evolutionary Approximate Optimization for Machine Learning

Compare Page Revisions

0 Current 0

« Older Revision - Back to Page History - Current Revision

Page Revision: 2016/11/05 09:22

This CIS Webminar talk introduces our recent progress in solving two kinds of problems, the subset selection problem and the local Lipschitz continuous problems, by evolutionary algorithms.

Slides: Download PDF (Update: Nov. 05, 2016)

Links:

• RACOS source code: https://github.com/eyounx/RACOS
• SRE for high-dimensional optimization: https://github.com/eyounx/SRE
• POSS source code: http://lamda.nju.edu.cn/code_POSS.ashx
• Parallel POSS source code: http://lamda.nju.edu.cn/code_PPOSS.ashx

The end