Breaking Chains with Trees: Model-Parallel Deep Learning with $\mathcal{O}(\log N)$ Time Complexity
用树打破链:具有 $\mathcal{O}(\log N)$ 并行时间复杂度的深度学习
Neeraj Mohan Sushma, Aditya Nagarsekar, Cabrel Teguemne Fokam, Robin Schiewer, Amit Kumar Pal, Anand Subramoney, David Kappel
机构
*
Center for Cognitive Interaction Technology, Bielefeld University(比勒费尔德大学认知交互技术中心)
;
Ruhr Universität Bochum(波鸿鲁尔大学)
;
Birla Institute of Technology and Science, Pilani, Goa Campus(比拉理工学院皮拉尼校区果阿分校)
;
Royal Holloway, University of London(伦敦大学皇家霍洛威学院)
机构
*
School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen(香港中文大学(深圳)理工学院)
;
Shenzhen Research Institute of Big Data(深圳大数据研究院)