Back
History
CIS Webminar: Towards Evolutionary Approximate Optimization for Machine Learning
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 new ways of evolutionary algorithms. Slides: [{UP}ciswebminar/CIS-Webminar.pdf|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