Reference : Robust network reconstruction in polynomial time
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Multidisciplinary, general & others
Robust network reconstruction in polynomial time
Hayden, D. [> >]
Yuan, Y. mailto [> >]
Goncalves, Jorge mailto [University of Luxembourg > Luxembourg Centre for Systems Biomedicine (LCSB) > >]
The proceedings of the 51st IEEE Conference on Decision and Control
51st IEEE Conference on Decision and Control
10-13 December 2012
[en] This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work [1] on robust reconstruction to provide a practical implementation with polynomial computational complexity. Following the same experimental protocol, the algorithm obtains a set of structurally-related candidate solutions spanning every level of sparsity. We prove the existence of a magnitude bound on the noise, which if satisfied, guarantees that one of these structures is the correct solution. A problem-specific model-selection procedure then selects a single solution from this set and provides a measure of confidence in that solution. Extensive simulations quantify the expected performance for different levels of noise and show that significantly more noise can be tolerated in comparison to the original method.

File(s) associated to this reference

Fulltext file(s):

Limited access
Robust network reconstruction in polynomial time.pdfPublisher postprint172.61 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.