首页 /研究 /POSTER: Space and Time Optimal DNN Primitive Selection with Integer Linear Programming
LEARNING

POSTER: Space and Time Optimal DNN Primitive Selection with Integer Linear Programming

Yuan Wen, Andrew Anderson, Valentin Radu, Michael O’Boyle, David Gregg

发表年份
2019
引用次数
2

摘要

Convolutional neural networks (CNNs) are used in many applications, from industrial robotics to biometric identification on mobile devices. But they can be too resource-hungry for mobile and embedded devices with tightly constrained memory and energy budgets. We propose an ahead-of-time primitive selection for CNNs, based on integer linear programming (ILP). Under a tight memory budget, our ILP solver selects the optimal primitive for each layer such that the entire network is optimized for execution time subject to a memory budget, or vice versa. Our method yields significant speedup and memory reduction compared to existing methods.

关键词

Computer scienceInteger programmingSpeedupSolverInteger (computer science)Parallel computingConvolutional neural networkSelection (genetic algorithm)Artificial intelligenceAlgorithm

相关论文

查看 LEARNING 分类全部论文