Truncating Wide Networks Using Binary Tree Architectures

Yan Zhang, Mete Ozay, Shuohao Li, Takayuki Okatani; The IEEE International Conference on Computer Vision (ICCV), 2017, pp. 2097-2105


In this paper, we propose a binary tree architecture to truncate architecture of wide networks by reducing the width of the networks. More precisely, in the proposed architecture, the width is incrementally reduced from lower layers to higher layers in order to increase the expressive capacity of networks with a less increase on parameter size. Also, in order to ease the gradient vanishing problem, features obtained at different layers are concatenated to form the output of our architecture. By employing the proposed architecture on a baseline wide network, we can construct and train a new network with same depth but considerably less number of parameters. In our experimental analyses, we observe that the proposed architecture enables us to obtain better parameter size and accuracy trade-off compared to baseline networks using various benchmark image classification datasets. The results show that our model can decrease the classification error of a baseline from 20.43% to 19.22% on Cifar-100 using only 28% of parameters that the baseline has.

Related Material

[pdf] [Supp] [arXiv]
author = {Zhang, Yan and Ozay, Mete and Li, Shuohao and Okatani, Takayuki},
title = {Truncating Wide Networks Using Binary Tree Architectures},
booktitle = {The IEEE International Conference on Computer Vision (ICCV)},
month = {Oct},
year = {2017}