The reviewed record of science sign in
Pith

arxiv: 2111.08888 · v2 · pith:MJR3NSNZ · submitted 2021-11-17 · cs.LG · cs.CE· cs.NE

Random Graph-Based Neuromorphic Learning with a Layer-Weaken Structure

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:MJR3NSNZrecord.jsonopen to challenge →

classification cs.LG cs.CEcs.NE
keywords randomstructuretheylearningarchitecturecostgraph-basedgraphs
0
0 comments X
read the original abstract

Unified understanding of neuro networks (NNs) gets the users into great trouble because they have been puzzled by what kind of rules should be obeyed to optimize the internal structure of NNs. Considering the potential capability of random graphs to alter how computation is performed, we demonstrate that they can serve as architecture generators to optimize the internal structure of NNs. To transform the random graph theory into an NN model with practical meaning and based on clarifying the input-output relationship of each neuron, we complete data feature mapping by calculating Fourier Random Features (FRFs). Under the usage of this low-operation cost approach, neurons are assigned to several groups of which connection relationships can be regarded as uniform representations of random graphs they belong to, and random arrangement fuses those neurons to establish the pattern matrix, markedly reducing manual participation and computational cost without the fixed and deep architecture. Leveraging this single neuromorphic learning model termed random graph-based neuro network (RGNN) we develop a joint classification mechanism involving information interaction between multiple RGNNs and realize significant performance improvements in supervised learning for three benchmark tasks, whereby they effectively avoid the adverse impact of the interpretability of NNs on the structure design and engineering practice.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.