Back History
High-dimensional derivative-free optimization

<nowiki>[</nowiki>[MainPage|Back to main page] <nowiki>]</nowiki>

Derivative-free optimization methods are hard to scale up, thus are hard to applied to high-dimensional problems.


==Sequential Random Embeddings==

Sequential random embeddings employ random embedding several times, such that the optimization is maintained in low dimensional spaces, and the embedding loss can be reduced. It can help optimize problems with tens of thousands dimensions in single CPU thread. For details please see:<br/>
{{Hong Qian, Yi-Qi Hu and Yang Yu. Derivative-free optimization of high-dimensional non-convex functions by sequential random embeddings. In: Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI'16), New York, NY, 2016.}} ([{UP}papers/ijcai16-sre.pdf|PDF])

The latest version is in Github (available in Java): [^https://github.com/eyounx/SRE]<br/>
* The codes are released under the GNU GPL 2.0 license. For commercial purposes, please contact [yuy@nju.edu.cn|me] or [zhouzh@nju.edu.cn|Prof. Zhi-Hua Zhou].