May 26, 2022, 1:11 a.m. | Stefanie J.M. Fonken, Karthik R. Ramaswamy, Paul M.J. Van den Hof

stat.ML updates on arXiv.org arxiv.org

Identification methods for dynamic networks typically require prior knowledge
of the network and disturbance topology, and often rely on solving poorly
scalable non-convex optimization problems. While methods for estimating network
topology are available in the literature, less attention has been paid to
estimating the disturbance topology, i.e., the (spatial) noise correlation
structure and the noise rank in a filtered white noise representation of the
disturbance signal. In this work we present an identification method for
dynamic networks, in which an …

arxiv identification least network scalable squares topology

More from arxiv.org / stat.ML updates on arXiv.org

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Data Management Assistant

@ World Vision | Amman Office, Jordan

Cloud Data Engineer, Global Services Delivery, Google Cloud

@ Google | Buenos Aires, Argentina