SearcharxivSearch

arXiv subjects

Erfan Nozari

Publications and source records attributed to Erfan Nozari.

18 recordsLinked to original sources

Causal Discovery in Structural VAR Models Under Equal Noise Variance

Causal discovery from multivariate time series is challenging when causal effects may occur both across time and within the same sampling interval. This issue is especially important in applications such as neuroscience, where the sampling rate may be coarse relative to the underlying dynamics and contemporaneous effects need not form an acyclic graph. We study causal discovery in linear Gaussian structural VAR models under an equal noise variance assumption, meaning that the structural noise terms have a common variance. Unlike the DAG-based cross-sectional equal noise variance setting, the time-series setting considered here does not generally yield point identification of a unique causal graph. Instead, multiple structural VAR parameterizations can induce the same stationary observed process law. We introduce a notion of observational equivalence tailored to this setting and show that the corresponding equivalence class is characterized by orthogonal transformations of the structural equations together with a global positive scale. This characterization leads to an equivalence-aware model discrepancy, the observational alignment discrepancy, which compares structural models modulo transformations that preserve the observed law. Building on this theory, we propose ENVAR, a sparsity-based procedure that searches over the induced observational equivalence class for a sparse normalized structural representative. We evaluate the proposed methodology on synthetic structural VAR data and on an fMRI dataset.

stat.ME

Passivity-Based Control of Electrographic Seizures in a Neural Mass Model of Epilepsy

Recent advances in neurotechnologies and decades of scientific and clinical research have made closed-loop electrical neuromodulation one of the most promising avenues for the treatment of drug-resistant epilepsy (DRE), a condition that affects over 15 million individuals globally. Yet, with the existing clinical state of the art, only 18% of patients with DRE who undergo closed-loop neuromodulation become seizure-free. In a recent study, we demonstrated that a simple proportional feedback policy based on the framework of passivity-based control (PBC) can significantly outperform the clinical state of the art. However, this study was purely numerical and lacked rigorous mathematical analysis. The present study addresses this gap and provides the first rigorous analysis of PBC for the closed-loop control of epileptic seizures. Using the celebrated Epileptor neural mass model of epilepsy, we analytically demonstrate that (i) seizure dynamics are, in their standard form, neither passive nor passivatable, (ii) epileptic dynamics, despite their lack of passivity, can be stabilized by sufficiently strong passive feedback, and (iii) seizure dynamics can be passivated via proper output redesign. To our knowledge, our results provide the first rigorous passivity-based analysis of epileptic seizure dynamics, as well as a theoretically-grounded framework for sensor placement and feedback design for a new form of closed-loop neuromodulation with the potential to transform seizure management in DRE.

eess.SY

On the Emergence of Linear Behavior in Large-Scale Dynamical Systems via Spatial Averaging

Various natural and engineered systems, from urban traffic flow to the human brain, can be described by large-scale networked dynamical systems. These systems are similar in being comprised of a large number of microscopic subsystems, each with complex nonlinear dynamics and interactions, that collectively give rise to different forms of macroscopic dynamics. Despite significant research, why and how various forms of macroscopic dynamics emerge from underlying micro-dynamics remains largely unknown. In this work we focus on linearity as one of the most fundamental aspects of system dynamics. By extending the theory of mixing sequences, we show that \textit{in a broad class of autonomous nonlinear networked systems, the dynamics of the average of all subsystems' states becomes asymptotically linear as the number of subsystems grows to infinity, provided that, in addition to technical assumptions, pairwise correlations between subsystems decay to 0 as their pairwise distance grows to infinity}. We prove this result when the latter distance is between subsystems' linear indices or spatial locations, and provide extensions to linear time-invariant (LTI) limit dynamics, finite-sample analysis of rates of convergence, and networks of spatially-embedded subsystems with random locations. To our knowledge, this work is the first rigorous analysis of macroscopic linearity in large-scale heterogeneous networked dynamical systems, and provides a solid foundation for further theoretical and empirical analyses in various domains of science and engineering.

math.DS

Neural Constraints on Cognitive Experience and Mental Health

Understanding how neural dynamics shape cognitive experiences remains a central challenge in neuroscience and psychiatry. Here, we present a novel framework leveraging state-to-output controllability from dynamical systems theory to model the interplay between cognitive perturbations, neural activity, and subjective experience. We demonstrate that large-scale fMRI signals are constrained to low-dimensional manifolds, where affective and cognitive states are naturally organized. Furthermore, we provide a theoretically robust method to estimate the controllability Gramian from steady-state neural responses, offering a direct measure of the energy required to steer cognitive outcomes. In five healthy participants viewing 2,185 emotionally evocative short videos, our analyses reveal a strong alignment between neural activations and affective ratings, with an average correlation of $r \approx 0.7$. In a clinical cohort of 255 patients with major depressive disorder, biweekly Hamilton Rating Scale trajectories over 11 weeks significantly mapped onto these manifolds, explaining approximately 20% more variance than chance ($p < 10^{-10}$, numerically better than chance in 93% reaching statistical significance in one-third of subjects). Our work bridges dynamical systems theory and clinical neuroscience, providing a principled approach to optimize mental health treatments by targeting the most efficient neural pathways for cognitive change.

q-bio.NC

Linear-Threshold Network Models for Describing and Analyzing Brain Dynamics

Over the past two decades, an increasing array of control-theoretic methods have been used to study the brain as a complex dynamical system and better understand its structure-function relationship. This article provides an overview on one such family of methods, based on the linear-threshold rate (LTR) dynamics, which arises when modeling the spiking activity of neuronal populations and their impact on each other. LTR dynamics exhibit a wide range of behaviors based on network topologies and inputs, including mono- and multi-stability, limit cycles, and chaos, allowing it to be used to model many complex brain processes involving fast and slow inhibition, multiple time and spatial scales, different types of neural behavior, and higher-order interactions. Here we investigate how the versatility of LTR dynamics paired with concepts and tools from systems and control can provide a computational theory for explaining the dynamical mechanisms enabling different brain processes. Specifically, we illustrate stability and stabilization properties of LTR dynamics and how they are related to goal-driven selective attention, multistability and its relationship with declarative memory, and bifurcations and oscillations and their role in modeling seizure dynamics in epilepsy. We conclude with a discussion on additional properties of LTR dynamics and an outlook on other brain processess that for which they might be play a similar role.

q-bio.NC

Brain Modeling for Control: A Review

Neurostimulation technologies have seen a recent surge in interest from the neuroscience and controls communities alike due to their proven potential to treat conditions such as Parkinson's Disease, and depression. The provided stimulation can be of different types, such as electric, and optogenetic, and is generally applied to a specific region of the brain in order to drive the local and/or global dynamics to a desired state of (in)activity. However, an underlying theoretical understanding of the efficacy of neurostimulation is still lacking. From a control-theoretic perspective, it is important to understand how each stimulus modality interacts with the complex brain network in order to assess the controllability of the system and develop neurophysiologically relevant computational models that can be used to design the stimulation profile in a closed-loop manner. In this paper, we review the computational modeling studies of (i) deep brain stimulation, (ii) transcranial magnetic stimulation, (iii) direct current stimulation, (iv) transcranial electrical stimulation, and (v) optogenetics as five of the most popular neurostimulation technologies in research and clinical settings. For each technology, we split the reviewed studies into (a)theory-driven biophysical models capturing the low-level physics of the interactions between the stimulation source and neuronal tissue, (b) data-driven stimulus-response models which capture the end-to-end effects of stimulation on various biomarkers of interest and (c) data-driven dynamical system models that extract the precise dynamics of the brain's response to neurostimulation from neural data. While our focus is particularly on the latter category due to their greater utility in control design, we review key works in the former two categories as the basis and context in which dynamical system models have been and will be developed.

eess.SY

Towards a Network Control Theory of Electroconvulsive Therapy Response

Electroconvulsive Therapy (ECT) is arguably the most effective intervention for treatment-resistant depression. While large interindividual variability exists, a theory capable of predicting individual response to ECT remains elusive. To address this, we posit a quantitative, mechanistic framework of ECT response based on Network Control Theory (NCT). Then, we empirically test our approach and employ it to predict ECT treatment response. To this end, we derive a formal association between Postictal Suppression Index (PSI) - an ECT seizure quality index - and whole-brain modal and average controllability, NCT metrics based on white matter brain network architecture, respectively. Exploiting the known association of ECT response and PSI, we then hypothesized an association between our controllability metrics and ECT response mediated by PSI. We formally tested this conjecture in N=50 depressive patients undergoing ECT. We show that whole-brain controllability metrics based on pre-ECT structural connectome data predict ECT response in accordance with our hypotheses. In addition, we show the expected mediation effects via PSI. Importantly, our theoretically motivated metrics are at least on par with extensive machine learning models based on pre-ECT connectome data. In summary, we derived and tested a control-theoretic framework capable of predicting ECT response based on individual brain network architecture. It makes testable, quantitative predictions regarding individual therapeutic response, which are corroborated by strong empirical evidence. Our work might constitute a starting point for a comprehensive, quantitative theory of personalized ECT interventions rooted in control theory.

eess.SY

Is the brain macroscopically linear? A system identification of resting state dynamics

A central challenge in the computational modeling of neural dynamics is the trade-off between accuracy and simplicity. At the level of individual neurons, nonlinear dynamics are both experimentally established and essential for neuronal functioning. An implicit assumption has thus formed that an accurate computational model of whole-brain dynamics must also be highly nonlinear, whereas linear models may provide a first-order approximation. Here, we provide a rigorous and data-driven investigation of this hypothesis at the level of whole-brain blood-oxygen-level-dependent (BOLD) and macroscopic field potential dynamics by leveraging the theory of system identification. Using functional MRI (fMRI) and intracranial EEG (iEEG), we model the resting state activity of 700 subjects in the Human Connectome Project (HCP) and 122 subjects from the Restoring Active Memory (RAM) project using state-of-the-art linear and nonlinear model families. We assess relative model fit using predictive power, computational complexity, and the extent of residual dynamics unexplained by the model. Contrary to our expectations, linear auto-regressive models achieve the best measures across all three metrics, eliminating the trade-off between accuracy and simplicity. To understand and explain this linearity, we highlight four properties of macroscopic neurodynamics which can counteract or mask microscopic nonlinear dynamics: averaging over space, averaging over time, observation noise, and limited data samples. Whereas the latter two are technological limitations and can improve in the future, the former two are inherent to aggregated macroscopic brain activity. Our results, together with the unparalleled interpretability of linear models, can greatly facilitate our understanding of macroscopic neural dynamics and the principled design of model-based interventions for the treatment of neuropsychiatric disorders.

q-bio.NC

Structural Characterization of Oscillations in Brain Networks with Rate Dynamics

Among the versatile forms of dynamical patterns of activity exhibited by the brain, oscillations are one of the most salient and extensively studied, yet are still far from being well understood. In this paper, we provide various structural characterizations of the existence of oscillatory behavior in neural networks using a classical neural mass model of mesoscale brain activity called linear-threshold dynamics. Exploiting the switched-affine nature of this dynamics, we obtain various necessary and/or sufficient conditions on the network structure and its external input for the existence of oscillations in (i) two-dimensional excitatory-inhibitory networks (E-I pairs), (ii) networks with one inhibitory but arbitrary number of excitatory nodes, (iii) purely inhibitory networks with an arbitrary number of nodes, and (iv) networks of E-I pairs. Throughout our treatment, and given the arbitrary dimensionality of the considered dynamics, we rely on the lack of stable equilibria as a system-based proxy for the existence of oscillations, and provide extensive numerical results to support its tight relationship with the more standard, signal-based definition of oscillations in computational neuroscience.

eess.SY

Hierarchical Selective Recruitment in Linear-Threshold Brain Networks, Part I: Single-Layer Dynamics and Selective Inhibition

Goal-driven selective attention (GDSA) refers to the brain's function of prioritizing the activity of a task-relevant subset of its overall network to efficiently process relevant information while inhibiting the effects of distractions. Despite decades of research in neuroscience, a comprehensive understanding of GDSA is still lacking. We propose a novel framework using concepts and tools from control theory as well as insights and structures from neuroscience. Central to this framework is an information-processing hierarchy with two main components: selective inhibition of task-irrelevant activity and top-down recruitment of task-relevant activity. We analyze the internal dynamics of each layer of the hierarchy described as a network with linear-threshold dynamics and derive conditions on its structure to guarantee existence and uniqueness of equilibria, asymptotic stability, and boundedness of trajectories. We also provide mechanisms that enforce selective inhibition using the biologically-inspired schemes of feedforward and feedback inhibition. Despite their differences, both lead to the same conclusion: the intrinsic dynamical properties of the (not-inhibited) task-relevant subnetworks are the sole determiner of the dynamical properties that are achievable under selective inhibition.

eess.SY

Hierarchical Selective Recruitment in Linear-Threshold Brain Networks, Part II: Multi-Layer Dynamics and Top-Down Recruitment

Goal-driven selective attention (GDSA) is a remarkable function that allows the complex dynamical networks of the brain to support coherent perception and cognition. Part I of this two-part paper proposes a new control-theoretic framework, termed hierarchical selective recruitment (HSR), to rigorously explain the emergence of GDSA from the brain's network structure and dynamics. This part completes the development of HSR by deriving conditions on the joint structure of the hierarchical subnetworks that guarantee top-down recruitment of the task-relevant part of each subnetwork by the subnetwork at the layer immediately above, while inhibiting the activity of task-irrelevant subnetworks at all the hierarchical layers. To further verify the merit and applicability of this framework, we carry out a comprehensive case study of selective listening in rodents and show that a small network with HSR-based structure and minimal size can explain the data with remarkable accuracy while satisfying the theoretical requirements of HSR. Our technical approach relies on the theory of switched systems and provides a novel converse Lyapunov theorem for state-dependent switched affine systems that is of independent interest.

eess.SY

Teaching Recurrent Neural Networks to Modify Chaotic Memories by Example

The ability to store and manipulate information is a hallmark of computational systems. Whereas computers are carefully engineered to represent and perform mathematical operations on structured data, neurobiological systems perform analogous functions despite flexible organization and unstructured sensory input. Recent efforts have made progress in modeling the representation and recall of information in neural systems. However, precisely how neural systems learn to modify these representations remains far from understood. Here we demonstrate that a recurrent neural network (RNN) can learn to modify its representation of complex information using only examples, and we explain the associated learning mechanism with new theory. Specifically, we drive an RNN with examples of translated, linearly transformed, or pre-bifurcated time series from a chaotic Lorenz system, alongside an additional control signal that changes value for each example. By training the network to replicate the Lorenz inputs, it learns to autonomously evolve about a Lorenz-shaped manifold. Additionally, it learns to continuously interpolate and extrapolate the translation, transformation, and bifurcation of this representation far beyond the training data by changing the control signal. Finally, we provide a mechanism for how these computations are learned, and demonstrate that a single network can simultaneously learn multiple computations. Together, our results provide a simple but powerful mechanism by which an RNN can learn to manipulate internal representations of complex information, allowing for the principled study and precise design of RNNs.

cond-mat.dis-nn

Models of communication and control for brain networks: distinctions, convergence, and future outlook

Recent advances in computational models of signal propagation and routing in the human brain have underscored the critical role of white matter structure. A complementary approach has utilized the framework of network control theory to better understand how white matter constrains the manner in which a region or set of regions can direct or control the activity of other regions. Despite the potential for both of these approaches to enhance our understanding of the role of network structure in brain function, little work has sought to understand the relations between them. Here, we seek to explicitly bridge computational models of communication and principles of network control in a conceptual review of the current literature. By drawing comparisons between communication and control models in terms of the level of abstraction, the dynamical complexity, the dependence on network attributes, and the interplay of multiple spatiotemporal scales, we highlight the convergence of and distinctions between the two frameworks. Based on the understanding of the intertwined nature of communication and control in human brain networks, this work provides an integrative perspective for the field and outlines exciting directions for future work.

q-bio.NC

Event-Triggered Stabilization of Nonlinear Systems with Time-Varying Sensing and Actuation Delay

This paper studies the problem of stabilization of a nonlinear system with time-varying delays in both sensing and actuation using event-triggered control. Our proposed strategy seeks to opportunistically minimize the number of control updates while guaranteeing stabilization and builds on predictor feedback to compensate for arbitrarily large known time-varying delays. We establish, using a Lyapunov approach, the global asymptotic stability of the closed-loop system as long as the open-loop system is globally input-to-state stabilizable in the absence of time delays and sampling. We further prove that the proposed event-triggered law has inter-event times that are uniformly lower bounded and hence does not exhibit Zeno behavior. For the particular case of a stabilizable linear system, we show global exponential stability of the closed-loop system and analyze the trade-off between the rate of exponential convergence and a bound on the sampling frequency. We illustrate these results in simulation and also examine the properties of the proposed event-triggered strategy beyond the class of systems for which stabilization can be guaranteed.

eess.SY

Heterogeneity of Central Nodes Explains the Benefits of Time-Varying Control in Complex Dynamical Networks

Despite extensive research and remarkable advancements in the control of complex dynamical networks, most studies and practical control methods limit their focus to time-invariant control schedules (TICS). This is both due to their simplicity and the fact that the benefits of time-varying control schedules (TVCS) have remained largely uncharacterized. In this paper we study networks with linear and discrete-time dynamics and analyze the role of network structure in TVCS. First, we show that TVCS can significantly enhance network controllability over TICS, especially when applied to large networks. Through the analysis of a scale-dependent notion of nodal centrality, we then show that optimal TVCS involves the actuation of the most central nodes at appropriate spatial scales at all times. Consequently, it is the scale-heterogeneity of the central-nodes in a network that determine whether, and to what extent, TVCS outperforms conventional policies based on TICS. Here, scale-heterogeneity of a network refers to how diverse the central nodes of the network are at different spatial (local vs. global) scales. Several analytical results and case studies support and illustrate this relationship.

math.OC

Network Identification with Latent Nodes via Auto-Regressive Models

We consider linear time-invariant networks with unknown topology where only a manifest subset of the nodes can be directly actuated and measured while the state of the remaining latent nodes and their number are unknown. Our goal is to identify the transfer function of the manifest subnetwork and determine whether interactions between manifest nodes are direct or mediated by latent nodes. We show that, if there are no inputs to the latent nodes, the manifest transfer function can be approximated arbitrarily well in the H-infinity norm sense by the transfer function of an auto-regressive model and present a least-squares estimation method to construct the auto-regressive model from measured data. We show that the least-squares auto-regressive method guarantees an arbitrarily small H-infinity norm error in the approximation of the manifest transfer function, exponentially decaying once the model order exceeds a certain threshold. Finally, we show that when the latent subnetwork is acyclic, the proposed method achieves perfect identification of the manifest transfer function above a specific model order as the length of the data increases. Various examples illustrate our results.

eess.SY

Differentially Private Average Consensus: Obstructions, Trade-Offs, and Optimal Algorithm Design

This paper studies the multi-agent average consensus problem under the requirement of differential privacy of the agents' initial states against an adversary that has access to all the messages. We first establish that a differentially private consensus algorithm cannot guarantee convergence of the agents' states to the exact average in distribution, which in turn implies the same impossibility for other stronger notions of convergence. This result motivates our design of a novel differentially private Laplacian consensus algorithm in which agents linearly perturb their state-transition and message-generating functions with exponentially decaying Laplace noise. We prove that our algorithm converges almost surely to an unbiased estimate of the average of agents' initial states, compute the exponential mean-square rate of convergence, and formally characterize its differential privacy properties. We show that the optimal choice of our design parameters (with respect to the variance of the convergence point around the exact average) corresponds to a one-shot perturbation of initial states and compare our design with various counterparts from the literature. Simulations illustrate our results.

math.OC

Differentially Private Distributed Convex Optimization via Functional Perturbation

We study a class of distributed convex constrained optimization problems where a group of agents aim to minimize the sum of individual objective functions while each desires that any information about its objective function is kept private. We prove the impossibility of achieving differential privacy using strategies based on perturbing the inter-agent messages with noise when the underlying noise-free dynamics are asymptotically stable. This justifies our algorithmic solution based on the perturbation of individual functions with Laplace noise. To this end, we establish a general framework for differentially private handling of functional data. We further design post-processing steps that ensure the perturbed functions regain the smoothness and convexity properties of the original functions while preserving the differentially private guarantees of the functional perturbation step. This methodology allows us to use any distributed coordination algorithm to solve the optimization problem on the noisy functions. Finally, we explicitly bound the magnitude of the expected distance between the perturbed and true optimizers which leads to an upper bound on the privacy-accuracy trade-off curve. Simulations illustrate our results.

math.OC