all AI news
Efficient and passive learning of networked dynamical systems driven by non-white exogenous inputs. (arXiv:2110.00852v3 [cs.LG] UPDATED)
May 9, 2022, 1:11 a.m. | Harish Doddi, Deepjyoti Deka, Saurav Talukdar, Murti Salapaka
cs.LG updates on arXiv.org arxiv.org
We consider a networked linear dynamical system with $p$ agents/nodes. We
study the problem of learning the underlying graph of interactions/dependencies
from observations of the nodal trajectories over a time-interval $T$. We
present a regularized non-casual consistent estimator for this problem and
analyze its sample complexity over two regimes: (a) where the interval $T$
consists of $n$ i.i.d. observation windows of length $T/n$ (restart and
record), and (b) where $T$ is one continuous observation window (consecutive).
Using the theory of …
More from arxiv.org / cs.LG updates on arXiv.org
Jobs in AI, ML, Big Data
Data Scientist (m/f/x/d)
@ Symanto Research GmbH & Co. KG | Spain, Germany
Data Operations Analyst
@ Workday | Poland, Warsaw
Reference Data Specialist - Operations Analyst
@ JPMorgan Chase & Co. | Bengaluru, Karnataka, India
Data Scientist (Redwood City)
@ Anomali | Redwood City, CA
Software Engineer, Database - Languages & Relational Technologies
@ YugabyteDB | United States (Remote) or Sunnyvale, CA
Data Analyst (m/f/d) Online Marketing
@ StepStone Group | Düsseldorf, Germany