Parameter Convex Neural Networks
Not on the map. Why?
Abstract (arXiv)
Deep learning utilizing deep neural networks (DNNs) has achieved a lot of success recently in many important areas such as computer vision, natural language processing, and recommendation systems. The lack of convexity for DNNs has been seen as a major disadvantage of many optimization methods, such as stochastic gradient descent, which greatly reduces the genelization of neural network applications. We realize that the convexity make sense in the neural network and propose the exponential multilayer neural network (EMLP), a class of parameter convex neural network (PCNN) which is convex with regard to the parameters of the neural network under some conditions that can be realized. Besides, we propose the convexity metric for the two-layer EGCN and test the accuracy when the convexity metric changes. For late experiments, we use the same architecture to make the exponential graph convolutional network (EGCN) and do the experiment on the graph classificaion dataset in which our model EGCN performs better than the graph convolutional network (GCN) and the graph attention network (GAT).
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 27 references that are in the map. First posted on arXiv 11 Jun 2022.
Builds on
21 of 27 references.
References · 21
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 784
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 673
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2016Geometric deep learning on graphs and manifolds using mixture model CNNscited by 468
- 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
9 more
- 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
- 2017The loss surface of deep and wide neural networkscited by 74
- 2020The Global Landscape of Neural Networks: An Overviewcited by 57
- 2021A Local Convergence Theory for Mildly Over-Parameterized Two-Layer Neural Networkcited by 47
- 2018Exponential Convergence of the Deep Neural Network Approximation for Analytic Functionscited by 38
- 2017Global optimality conditions for deep neural networkscited by 31
- 2019Gradient Descent Finds Global Minima for Generalizable Deep Neural Networks of Practical Sizescited by 29
- 2019Global Convergence of Adaptive Gradient Methods for An Over-parameterized Neural Networkcited by 27
- 2017Theoretical properties of the global optimizer of two layer neural networkcited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.