127 citations · 207 across the 11 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
eess.SY2021★ 4 cited
Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices
Shiyong Zhu, Jianquan Lu, Daniel W. C. Ho +1
The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begi…
cs.LG2021
A SOM-based Gradient-Free Deep Learning Method with Convergence Analysis
Shaosheng Xu, Jinde Cao, Yichao Cao +1
As gradient descent method in deep learning causes a series of questions, this paper proposes a novel gradient-free deep learning structure. By adding a new module into traditional…