SearcharxivSearch

arXiv subjects

Sahand Tangerami

Publications and source records attributed to Sahand Tangerami.

2 recordsLinked to original sources

Optimizing the Network Topology of a Linear Reservoir Computer

Machine learning has become a fundamental approach for modeling, prediction, and control, enabling systems to learn from data and perform complex tasks. Reservoir computing is a machine learning tool that leverages high-dimensional dynamical systems to efficiently process temporal data for prediction and observation tasks. Traditionally, the connectivity of the network that underlies a reservoir computer (RC) is generated randomly, lacking a principled design. Here, we focus on optimizing the connectivity of a linear RC to improve its performance and interpretability, which we achieve by decoupling the RC dynamics into a number of independent modes. We then proceed to optimize each one of these modes to perform a given task, which corresponds to selecting an optimal RC connectivity in terms of a given set of eigenvalues of the RC adjacency matrix. Simulations on networks of varying sizes show that the optimized RC significantly outperforms randomly constructed reservoirs in both training and testing phases and often surpasses nonlinear reservoirs of comparable size. This approach provides both practical performance advantages and theoretical guidelines for designing efficient, task-specific, and analytically transparent RC architectures.

eess.SY

Extreme vulnerability to intruder attacks destabilizes network dynamics

Consensus, synchronization, formation control, and power grid balance are examples of desirable dynamical states that arise in networks. Here we investigate how such states can be destabilized by an intruder agent within an otherwise functioning network. We see that a single adversarial node, coupled through adversarial connections to one or more other nodes, is sufficient to destabilize the entire network. We further show that concentrating the attack on a single low-indegree node induces the greatest instability, challenging the common assumption that hubs are the most critical nodes. This leads to a new characterization of network vulnerability, identifying low-indegree nodes as the most vulnerable components. Although derived for linear systems, our results extend to nonlinear networks, including the Kuramoto model. These findings reveal an intrinsic vulnerability of technological, social, and biological networks.

nlin.AO