Your Network May Need to Be Rewritten: Network Adversarial Based on High-Dimensional Function Graph Decomposition
Xiaoyan Su, Yinghao Zhu, Run Li

TL;DR
This paper introduces a novel network adversarial method using different activation functions and high-dimensional function graph decomposition to improve training efficiency and accuracy in neural networks.
Contribution
It is the first to utilize different activation functions adversarially and proposes HD-FGD for decomposing complex functions, enhancing neural network performance.
Findings
Improved training efficiency over traditional methods
Enhanced predictive accuracy with the proposed approach
Effective replacement of standard activation functions
Abstract
In the past, research on a single low dimensional activation function in networks has led to internal covariate shift and gradient deviation problems. A relatively small research area is how to use function combinations to provide property completion for a single activation function application. We propose a network adversarial method to address the aforementioned challenges. This is the first method to use different activation functions in a network. Based on the existing activation functions in the current network, an adversarial function with opposite derivative image properties is constructed, and the two are alternately used as activation functions for different network layers. For complex situations, we propose a method of high-dimensional function graph decomposition(HD-FGD), which divides it into different parts and then passes through a linear layer. After integrating the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Adversarial Robustness in Machine Learning · Graph Theory and Algorithms
