paper-with-me

Papers

LINOCS: Lookahead Inference of Networked Operators for Continuous Stability

2024-04-28 · Noga Mudrik, Eva Yezerets, Yenho Chen, Christopher Rozell, Adam Charles

Identifying latent interactions within complex systems is key to unlocking deeper insights into their operational dynamics, including how their elements affect each other and contribute to the overall system behavior. For instance, in neuroscience, discovering neuron-to-neuron interactions is essential for understanding brain function; in ecology, recognizing the interactions among populations is key for understanding complex ecosystems. Such systems, often modeled as dynamical systems, typically exhibit noisy high-dimensional and non-stationary temporal behavior that renders their identification challenging. Existing dynamical system identification methods often yield operators that accurately capture short-term behavior but fail to predict long-term trends, suggesting an incomplete capture of the underlying process. Methods that consider extended forecasts (e.g., recurrent neural networks) lack explicit representations of element-wise interactions and require substantial training data, thereby failing to capture interpretable network operators. Here we introduce Lookahead-driven Inference of Networked Operators for Continuous Stability (LINOCS), a robust learning procedure for identifying hidden dynamical interactions in noisy time-series data. LINOCS integrates several multi-step predictions with adaptive weights during training to recover dynamical operators that can yield accurate long-term predictions. We demonstrate LINOCS' ability to recover the ground truth dynamical operators underlying synthetic time-series data for multiple dynamical systems models (including linear, piece-wise linear, time-changing linear systems' decomposition, and regularized linear time-varying systems) as well as its capability to produce meaningful operators with robust reconstructions through various real-world examples.

📄 PDF Abstract BibTeX arXiv:2404.18267

Code (0)

등록된 구현이 없습니다.

Tasks

Time Series

Similar Papers 제목 키워드 기반

Neural Network Approximation of Graph Fourier Transforms for Sparse Sampling of Networked Flow Dynamics

2020-02-11 · Alessio Pagani, Zhuangkun Wei, Ricardo Silva, Weisi Guo

Infrastructure monitoring is critical for safe operations and sustainability. Water distribution networks (WDNs) are large-scale networked critical systems with complex cascade dynamics which are difficult to predict. Ub…

Practical Two-Step Lookahead Bayesian Optimization

2019-12-01 · NeurIPS 2019 12 · Jian Wu, Peter Frazier

Expected improvement and other acquisition functions widely used in Bayesian optimization use a "one-step" assumption: they value objective function evaluations assuming no future evaluations will be performed. Because w…

Bayesian OptimizationVocal Bursts Valence Prediction

Stable Nonconvex-Nonconcave Training via Linear Interpolation

2023-10-20 · NeurIPS 2023 11 · Thomas Pethick, Wanyun Xie, Volkan Cevher

This paper presents a theoretical analysis of linear interpolation as a principled method for stabilizing (large-scale) neural network training. We argue that instabilities in the optimization process are often caused by…

Uncertainty Quantification for Inferring Hawkes Networks

2020-06-12 · NeurIPS 2020 12 · Haoyun Wang, Liyan Xie, Alex Cuozzo, Simon Mak 외

Multivariate Hawkes processes are commonly used to model streaming networked event data in a wide variety of applications. However, it remains a challenge to extract reliable inference from complex datasets with uncertai…

Uncertainty Quantification

Unconstrained learning of networked nonlinear systems via free parametrization of stable interconnected operators

2023-11-23 · Leonardo Massai, Danilo Saccani, Luca Furieri, Giancarlo Ferrari-Trecate

This paper characterizes a new parametrization of nonlinear networked incrementally $L_2$-bounded operators in discrete time. The distinctive novelty is that our parametrization is \emph{free} -- that is, a sparse large-…