POLO.J1: Policy-based optimization algorithms in Julia

被引:1
作者
Biel, Martin [1 ]
Aytekin, Arda [1 ]
Johansson, Mikael [1 ]
机构
[1] KTH Royal Inst Technol, Sch Elect Engn & Comp Sci, SE-10044 Stockholm, Sweden
基金
瑞典研究理事会;
关键词
64-bit architectures - Data manipulations - Design technique - Optimization algorithms - Parallel optimization - Performance of algorithm - Prototype optimization - State of the art;
D O I
10.1016/j.advengsoft.2019.102695
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
We present POLO. j1- a Julia package that helps algorithm developers and machine-learning practitioners design and use state-of-the-art parallel optimization algorithms in a flexible and efficient way. POLO. j1 extends our C+ + library POLO, which has been designed and implemented with the same intentions. POLO. j1 not only wraps selected algorithms in POLO and provides an easy mechanism to use data manipulation facilities and loss function definitions in Julia together with the underlying compiled C+ + library, but it also uses the policy-based design technique in a Julian way to help users prototype optimization algorithms from their own building blocks. In our experiments, we observe that there is little overhead when using the compiled C+ + code directly within Julia. We also notice that the performance of algorithms implemented in pure Julia is comparable with that of their C+ + counterparts. Both libraries are hosted on GitHub(1)under the free MIT license, and can be used easily by pulling the pre-built 64-bit architecture Docker images.(2)
引用
收藏
页数:11
相关论文
共 25 条
[1]  
[Anonymous], 2017, ARXIV171005080V1
[2]  
[Anonymous], ARXIV150805003V1
[3]  
[Anonymous], 1991, COMPUTING SCI STAT 2
[4]  
[Anonymous], POLO POLICY BASED OP
[5]  
[Anonymous], 2017, Advances in Neural Information Processing Systems
[6]  
[Anonymous], ADV NEURAL INFORM PR
[7]  
[Anonymous], 2016, ICLR WORKSH
[8]  
[Anonymous], 1964, COMP MATH MATH PHYS+
[9]  
[Anonymous], 2012, ARXIV12125701V1
[10]  
[Anonymous], ARXIV160604809V1