l0-norm Based Centers Selection for Failure Tolerant RBF Networks

05/30/2018
by   Hao Wang, et al.
0

The aim of this paper is to select the RBF neural network centers under concurrent faults. It is well known that fault tolerance is a very attractive property for neural network algorithms. And center selection is an important procedure during the training process of RBF neural network. In this paper, we will address these two issues simultaneously and devise two novel algorithms. Both of them are based on the framework of ADMM and utilize the technique of sparse approximation. For both two methods, we first define a fault tolerant objective function. After that, the first method introduces the MCP function (an approximate l0-norm function) and combine it with ADMM framework to select the RBF centers. While the second method utilize ADMM and IHT to solve the problem. The convergence of both two methods is proved. Simulation results show that the proposed algorithms are superior to many existing center selection algorithms under concurrent fault.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2020

Fault-Tolerant Center Problems with Robustness and Fairness

We study a family of clustering problems that require fault-tolerant sol...
research
05/01/2019

Fault-Tolerant Routing in Hypercube Networks by Avoiding Faulty Nodes

Next to the high performance, the essential feature of the multiprocesso...
research
07/06/2019

Adversarial Fault Tolerant Training for Deep Neural Networks

Deep Learning Accelerators are prone to faults which manifest in the for...
research
10/05/2018

Fault-Tolerant Consensus with an Abstract MAC Layer

In this paper, we study fault-tolerant distributed consensus in wireless...
research
10/29/2019

Disaggregation and the Application

This paper examines disaggregated data center architectures from the per...
research
09/05/2020

Structured Sparsity Modeling for Improved Multivariate Statistical Analysis based Fault Isolation

In order to improve the fault diagnosis capability of multivariate stati...
research
05/30/2018

Fast L1-Minimization Algorithm for Sparse Approximation Based on an Improved LPNN-LCA framework

The aim of sparse approximation is to estimate a sparse signal according...

Please sign up or login with your details

Forgot password? Click here to reset