paper-with-me

홈 › Papers

Propagation Mechanism for Deep and Wide Neural Networks

2019-06-01 · CVPR 2019 6 · Dejiang Xu, Mong Li Lee, Wynne Hsu

Recent deep neural networks (DNN) utilize identity mappings involving either element-wise addition or channel-wise concatenation for the propagation of these identity mappings. In this paper, we propose a new propagation mechanism called channel-wise addition (cAdd) to deal with the vanishing gradients problem without sacrificing the complexity of the learned features. Unlike channel-wise concatenation, cAdd is able to eliminate the need to store feature maps thus reducing the memory requirement. The proposed cAdd mechanism can deepen and widen existing neural architectures with fewer parameters compared to channel-wise concatenation and element-wise addition. We incorporate cAdd into state-of-the-art architectures such as ResNet, WideResNet, and CondenseNet and carry out extensive experiments on CIFAR10, CIFAR100, SVHN and ImageNet to demonstrate that cAdd-based architectures are able to achieve much higher accuracy with fewer parameters compared to their corresponding base architectures.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

1x1 Convolution A 1 x 1 Convolution is a convolution with some special properties in that it can be used for dimensionality reduction,…
Bottleneck Residual Block A Bottleneck Residual Block is a variant of the residual block that utilises 1x1 convolutions to create a bottleneck. The…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Residual Connection 설명 없음
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Residual Block Residual Blocks are skip-connection blocks that learn residual functions with reference to the layer inputs, instead of learning unreferenced functions. They were introduced…
Average Pooling 설명 없음
Bitcoin Customer Service Number +1-833-534-1729 설명 없음

Similar Papers 제목 키워드 기반

Limit Analysis for Symbolic Multi-step Reasoning Tasks with Information Propagation Rules Based on Transformers

2025-09-27 · Tian Qin, Yuhan Chen, Zhiwei Wang, Zhi-Qin John Xu arxiv

Transformers are able to perform reasoning tasks, however the intrinsic mechanism remains widely open. In this paper we propose a set of information propagation rules based on Transformers and utilize symbolic reasoning …

Graph Elimination Networks

2024-01-02 · Shuo Wang, Ge Cheng, Yun Zhang

Graph Neural Networks (GNNs) are widely applied across various domains, yet they perform poorly in deep layers. Existing research typically attributes this problem to node over-smoothing, where node representations becom…

A Study on mm-wave Propagation in and around Buildings

2022-10-13 · Leonardo Possenti, Marina Barbiroli, Enrico M. Vitucci, Franco Fuschini 외

mm-waves are envisaged as key enabler for 5G and 6G wireless communications, thanks to the wider bandwidth and to the possibility of implementing large-scale antenna arrays and new advanced transmission techniques, such …

Learning Representation over Dynamic Graph using Aggregation-Diffusion Mechanism

2021-06-03 · Mingyi Liu, Zhiying Tu, Xiaofei Xu, Zhongjie Wang

Representation learning on graphs that evolve has recently received significant attention due to its wide application scenarios, such as bioinformatics, knowledge graphs, and social networks. The propagation of informati…

Dynamic Link PredictionKnowledge GraphsLink PredictionRepresentation Learning

Efficient Deep Learning with Decorrelated Backpropagation

2024-05-03 · Sander Dalm, Joshua Offergeld, Nasir Ahmad, Marcel van Gerven

The backpropagation algorithm remains the dominant and most successful method for training deep neural networks (DNNs). At the same time, training DNNs at scale comes at a significant computational cost and therefore a h…

Deep Learning