Papers › SMU: smooth activation function for deep networks using smoothing maximum technique

SMU: smooth activation function for deep networks using smoothing maximum technique

8 Nov 2021arXiv:2111.04682archive 2025-07-28

Koushik Biswas, Sandeep Kumar, Shilpak Banerjee, Ashish Kumar Pandey

Deep learning researchers have a keen interest in proposing two new novel activation functions which can boost network performance. A good choice of activation function can have significant consequences in improving network performance. A handcrafted activation is the most common choice in neural network models. ReLU is the most common choice in the deep learning community due to its simplicity though ReLU has some serious drawbacks. In this paper, we have proposed a new novel activation function based on approximation of known activation functions like Leaky ReLU, and we call this function Smooth Maximum Unit (SMU). Replacing ReLU by SMU, we have got 6.22% improvement in the CIFAR100 dataset with the ShuffleNet V2 model.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

iFe1er/SMU mentioned on GitHubtfSyntology: not harvested report
iFe1er/SMU_pytorch mentioned on GitHubpytorchSyntology: not harvested report
lk18322280259/SMU mentioned on GitHubpytorchSyntology: not harvested report
MindCode-4/code-13 mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Randomized Quantization: A Generic Augmentation for Data Agnostic Self-supervised Learning (arXiv:2212.08663; that paper's own run record: 4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified); nothing checks that they implement this paper's method. report
pwc-1/Paper-9 mindsporeSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to RandAugment: Practical automated data augmentation with a reduced search space (arXiv:1909.13719; that paper's own run record: 58 ran (of which 1 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 51 where Syntology's instrument failed) · 7 unverified); nothing checks that they implement this paper's method. report
reeered/SMU-MindSpore mindsporeSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Deep Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

1x1 ConvolutionAverage PoolingBatch NormalizationChannel ShuffleConvolutionDense ConnectionsDepthwise ConvolutionGlobal Average PoolingGrouped ConvolutionGroupwise Point ConvolutionMax PoolingPointwise ConvolutionReLUResidual ConnectionShuffleNetShuffleNet BlockShuffleNet V2 BlockShuffleNet V2 Downsampling BlockShuffleNet v2Softmax

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections