dc.contributor.author |
Tissera, D |
|
dc.contributor.author |
Wijesinghe, R |
|
dc.contributor.author |
Vithanage, K |
|
dc.contributor.author |
Xavier, A |
|
dc.contributor.author |
Fernando, S |
|
dc.contributor.author |
Rodrigo, R |
|
dc.date.accessioned |
2023-11-30T07:43:55Z |
|
dc.date.available |
2023-11-30T07:43:55Z |
|
dc.date.issued |
2025 |
|
dc.identifier.citation |
Tissera, D., Wijesinghe, R., Vithanage, K., Xavier, A., Fernando, S., & Rodrigo, R. (2023). End-to-end data-dependent routing in multi-path neural networks. Neural Computing and Applications, 35(17), 12655–12674. https://doi.org/10.1007/s00521-023-08381-8 |
en_US |
dc.identifier.issn |
1433-3058 (Online) |
en_US |
dc.identifier.uri |
http://dl.lib.uom.lk/handle/123/21819 |
|
dc.description.abstract |
Neural networks are known to give better performance with increased depth due to their ability to learn
more abstract features. Although the deepening of networks has been well established, there is still room for
efficient feature extraction within a layer, which would reduce the need for mere parameter increment. The
conventional widening of networks by having more filters in each layer introduces a quadratic increment of
parameters. Having multiple parallel convolutional/dense operations in each layer solves this problem, but
without any context-dependent allocation of input among these operations: the parallel computations tend to
learn similar features making the widening process less effective. Therefore, we propose the use of multipath
neural networks with data-dependent resource allocation from parallel computations within layers, which
also lets an input be routed end-to-end through these parallel paths. To do this, we first introduce a crossprediction
based algorithm between parallel tensors of subsequent layers. Second, we further reduce the
routing overhead by introducing feature-dependent cross-connections between parallel tensors of successive
layers. Using image recognition tasks, we show that our multi-path networks show superior performance to
existing widening and adaptive feature extraction, even ensembles, and deeper networks at similar complexity. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Springer |
en_US |
dc.subject |
Multi-path networks |
en_US |
dc.subject |
Data-dependent routing |
en_US |
dc.subject |
Dynamic routing |
en_US |
dc.subject |
Image recognition |
en_US |
dc.title |
End-to-end data-dependent routing in multi-path neural networks |
en_US |
dc.type |
Article-Full-text |
en_US |
dc.identifier.year |
2025 |
en_US |
dc.identifier.journal |
Neural Computing and Applications |
en_US |
dc.identifier.issue |
17 |
en_US |
dc.identifier.volume |
35 |
en_US |
dc.identifier.database |
Springer |
en_US |
dc.identifier.pgnos |
12655–12674 |
en_US |
dc.identifier.doi |
https://doi.org/10.1007/s00521-023-08381-8 |
en_US |