Interpreting Basis Path Set in Neural Networks

10/18/2019
by   Juanping Zhu, et al.
0

Based on basis path set, G-SGD algorithm significantly outperforms conventional SGD algorithm in optimizing neural networks. However, how the inner mechanism of basis paths work remains mysterious. From the aspect of graph theory, this paper defines basis path, investigates structure properties of basis paths in regular fully connected neural network and interprets the graph representation of basis path set. Moreover, we propose hierarchical algorithm HBPS to find basis path set B in fully connected neural network by decomposing the network into several independent and parallel substructures. Algorithm HBPS demands that there doesn't exist shared edges between any two independent substructure paths.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2020

Constructing Basis Path Set by Eliminating Path Dependency

The way the basis path set works in neural network remains mysterious, a...
research
09/19/2018

Capacity Control of ReLU Neural Networks by Basis-path Norm

Recently, path norm was proposed as a new capacity measure for neural ne...
research
12/31/2018

Path-Invariant Map Networks

Optimizing a network of maps among a collection of objects/domains (or m...
research
06/08/2015

Path-SGD: Path-Normalized Optimization in Deep Neural Networks

We revisit the choice of SGD for training deep neural networks by recons...
research
01/26/2022

Combining optimal path search with task-dependent learning in a neural network

Finding optimal paths in connected graphs requires determining the small...
research
07/16/2019

What is... a Markov basis?

This short piece defines a Markov basis. The aim is to introduce the sta...
research
02/10/2022

Coded ResNeXt: a network for designing disentangled information paths

To avoid treating neural networks as highly complex black boxes, the dee...

Please sign up or login with your details

Forgot password? Click here to reset