Name
Abstract | ||
|---|---|---|
Sparse connectivity is an important factor behind the success of convolutional neural networks and recurrent neural networks. In this paper, we consider the problem of learning sparse connectivity for feedforward neural networks (FNNs). The key idea is that a unit should be connected to a small number of units at the next level below that are strongly correlated. We use Chow-Liuu0027s algorithm to learn a tree-structured probabilistic model for the units at the current level, use the tree to identify subsets of units that are strongly correlated, and introduce a new unit with receptive field over the subsets. The procedure is repeated on the new units to build multiple layers of hidden units. The resulting model is called a TRF-net. Empirical results show that, when compared to dense FNNs, TRF-net achieves better or comparable classification performance with much fewer parameters and sparser structures. They are also more interpretable. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.24963/ijcai.2018/700 | IJCAI |
DocType | Volume | Citations |
Conference | abs/1803.05209 | 0 |
PageRank | References | Authors |
0.34 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaopeng Li | 1 | 171 | 32.15 |
| Zhourong Chen | 2 | 228 | 12.22 |
| Nevin .L Zhang | 3 | 895 | 97.21 |