arXiv subjects

Sérgio Pequito

Publications and source records attributed to Sérgio Pequito.

At least 19 recordsLinked to original sources

arXiv2025

A Linear Generative Framework for Structure-Function Coupling in the Human Brain

Brain function emerges from coordinated activity across anatomically connected regions, where structural connectivity (SC) -- the network of white matter pathways - provides the physical substrate for functional connectivity (FC) -- the correlated neural activity between brain areas. While these structural and functional networks exhibit substantial overlap, their relationship involves complex, indirect mechanisms, including the dynamic interplay of direct and indirect pathways, recurrent network interactions, and neuromodulatory influences. To systematically untangle how structural architecture shapes functional patterns, this work aims to establish a set of rules that decode how direct and indirect structural connections and motifs give rise to FC between brain regions. Specifically, using a generative linear model, we derive explicit rules that predict an individual's resting-state fMRI FC from diffusion-weighted imaging (DWI)-derived SC, validated against topological null models. Examining the rules reveals distinct classes of brain regions, with integrator hubs acting as structural linchpins promoting synchronization and mediator hubs serving as structural fulcrums orchestrating competing dynamics. Through virtual lesion experiments, we demonstrate how different cortical and subcortical systems distinctively contribute to global functional organization. Together, this framework disentangles the mechanisms by which structural architecture drives functional dynamics, enabling the prediction of how pathological or surgical disruptions to brain connectivity cascade through functional networks, potentially leading to cognitive and behavioral impairments.

q-bio.NC↗

arXiv2025

Average consensus with resilience and privacy guarantees without losing accuracy

This paper addresses the challenge of achieving private and resilient average consensus among a group of discrete-time networked agents without compromising accuracy. State-of-the-art solutions to attain privacy and resilient consensus entail an explicit trade-off between the two with an implicit compromise on accuracy. In contrast, in the present work, we propose a methodology that avoids trade-offs between privacy, resilience, and accuracy. We design a methodology that, under certain conditions, enables non-faulty agents, i.e., agents complying with the established protocol, to reach average consensus in the presence of faulty agents, while keeping the non-faulty agents' initial states private. For privacy, agents strategically add noise to obscure their original state, while later withdrawing a function of it to ensure accuracy. Besides, and unlikely many consensus methods, our approach does not require each agent to compute the left-eigenvector of the dynamics matrix associated with the eigenvalue one. Moreover, the proposed framework has a polynomial time complexity relative to the number of agents and the maximum quantity of faulty agents. Finally, we illustrate our method with examples covering diverse faulty agents scenarios.

math.OC↗

arXiv2024

Distributed Graph Augmentation Protocols to Achieve Strong Connectivity in Multi-Agent Networks

In multi-agent systems, strong connectivity of the communication network is often crucial for establishing consensus protocols, which underpin numerous applications in decision-making and distributed optimization. However, this connectivity requirement may not be inherently satisfied in geographically distributed settings. Consequently, we need to find the minimum number of communication links to add to make the communication network strongly connected. To date, such problems have been solvable only through centralized methods. This paper introduces a fully distributed algorithm that efficiently identifies an optimal set of edge additions to achieve strong connectivity, using only local information. The majority of the communication between agents is local (according to the digraph structure), with only a few steps requiring communication among non-neighboring agents to establish the necessary additional communication links. A comprehensive empirical analysis of the algorithm's performance on various random communication networks reveals its efficiency and scalability.

math.OC↗

arXiv2024

Logarithmically Quantized Distributed Optimization over Dynamic Multi-Agent Networks

Distributed optimization finds many applications in machine learning, signal processing, and control systems. In these real-world applications, the constraints of communication networks, particularly limited bandwidth, necessitate implementing quantization techniques. In this paper, we propose distributed optimization dynamics over multi-agent networks subject to logarithmically quantized data transmission. Under this condition, data exchange benefits from representing smaller values with more bits and larger values with fewer bits. As compared to uniform quantization, this allows for higher precision in representing near-optimal values and more accuracy of the distributed optimization algorithm. The proposed optimization dynamics comprise a primary state variable converging to the optimizer and an auxiliary variable tracking the objective function's gradient. Our setting accommodates dynamic network topologies, resulting in a hybrid system requiring convergence analysis using matrix perturbation theory and eigenspectrum analysis.

eess.SY↗

arXiv2024

Shifts in Brain Dynamics and Drivers of Consciousness State Transitions

Understanding the neural mechanisms underlying the transitions between different states of consciousness is a fundamental challenge in neuroscience. Thus, we investigate the underlying drivers of changes during the resting-state dynamics of the human brain, as captured by functional magnetic resonance imaging (fMRI) across varying levels of consciousness (awake, light sedation, deep sedation, and recovery). We deploy a model-based approach relying on linear time-invariant (LTI) dynamical systems under unknown inputs (UI). Our findings reveal distinct changes in the spectral profile of brain dynamics - particularly regarding the stability and frequency of the system's oscillatory modes during transitions between consciousness states. These models further enable us to identify external drivers influencing large-scale brain activity during naturalistic auditory stimulation. Our findings suggest that these identified inputs delineate how stimulus-induced co-activity propagation differs across consciousness states. Notably, our approach showcases the effectiveness of LTI models under UI in capturing large-scale brain dynamic changes and drivers in complex paradigms, such as naturalistic stimulation, which are not conducive to conventional general linear model analysis. Importantly, our findings shed light on how brain-wide dynamics and drivers evolve as the brain transitions towards conscious states, holding promise for developing more accurate biomarkers of consciousness recovery in disorders of consciousness.

q-bio.NC↗

arXiv2021

Distributed design of deterministic discrete-time privacy preserving average consensus for multi-agent systems through network augmentation

Average consensus protocols emerge with a central role in distributed systems and decision-making such as distributed information fusion, distributed optimization, distributed estimation, and control. A key advantage of these protocols is that agents exchange and reveal their state information only to their neighbors. Yet, it can raise privacy concerns in situations where the agents' states contain sensitive information. In this paper, we propose a novel (noiseless) privacy preserving distributed algorithms for multi-agent systems to reach an average consensus. The main idea of the algorithms is that each agent runs a (small) network with a crafted structure and dynamics to form a network of networks (i.e., the connection between the newly created networks and their interconnections respecting the initial network connections). Together with a re-weighting of the dynamic parameters dictating the inter-agent dynamics and the initial states, we show that it is possible to ensure that the value of each node converges to the consensus value of the original network. Furthermore, we show that, under mild assumptions, it is possible to craft the dynamics such that the design can be achieved in a distributed fashion. Finally, we illustrate the proposed algorithm with examples.

math.OC↗

arXiv2021

Fractional cyber-neural systems -- a brief survey

Neurotechnology has made great strides in the last 20 years. However, we still have a long way to go to commercialize many of these technologies as we lack a unified framework to study cyber-neural systems (CNS) that bring the hardware, software, and the neural system together. Dynamical systems play a key role in developing these technologies as they capture different aspects of the brain and provide insight into their function. Converging evidence suggests that fractional-order dynamical systems are advantageous in modeling neural systems because of their compact representation and accuracy in capturing the long-range memory exhibited in neural behavior. In this brief survey, we provide an overview of fractional CNS that entails fractional-order systems in the context of CNS. In particular, we introduce basic definitions required for the analysis and synthesis of fractional CNS, encompassing system identification, state estimation, and closed-loop control. Additionally, we provide an illustration of some applications in the context of CNS and draw some possible future research directions. Ultimately, advancements in these three areas will be critical in developing the next generation of CNS, which will, ultimately, improve people's quality of life.

math.OC↗

arXiv2021

Minimum jointly structural input and output selection for strongly connected networks

In this paper, given a linear time-invariant strongly connected network, we study the problem of determining the minimum number of state variables that need to be simultaneously actuated and measured to ensure structural controllability and observability, respectively. This problem is fundamental in the design of multi-agent systems, where there are economic constraints in the decision of which agents to equip with a more costly on-board system that will allow the agent to have both actuation and sensing capabilities. Despite the combinatorial nature of this problem, we present a solution that couples the design of both structural controllability and structural observability counterparts to address it with polynomial-time complexity.

math.OC↗

arXiv2021

On Learning Discrete-Time Fractional-Order Dynamical Systems

Discrete-time fractional-order dynamical systems (DT-FODS) have found innumerable applications in the context of modeling spatiotemporal behaviors associated with long-term memory. Applications include neurophysiological signals such as electroencephalogram (EEG) and electrocorticogram (ECoG). Although learning the spatiotemporal parameters of DT-FODS is not a new problem, when dealing with neurophysiological signals we need to guarantee performance standards. Therefore, we need to understand the trade-offs between sample complexity and estimation accuracy of the system parameters. Simply speaking, we need to address the question of how many measurements we need to collect to identify the system parameters up to an uncertainty level. In this paper, we address the problem of identifying the spatial and temporal parameters of DT-FODS. The main result is the first result on non-asymptotic finite-sample complexity guarantees of identifying DT-FODS. Finally, we provide evidence of the efficacy of our method in the context of forecasting real-life intracranial EEG time series collected from patients undergoing epileptic seizures.

math.OC↗

arXiv2021

Discrete-Time Fractional-Order Dynamical Networks Minimum-Energy State Estimation

Fractional-order dynamical networks are increasingly being used to model and describe processes demonstrating long-term memory or complex interlaced dependencies amongst the spatial and temporal components of a wide variety of dynamical networks. Notable examples include networked control systems or neurophysiological networks which are created using electroencephalographic (EEG) or blood-oxygen-level-dependent (BOLD) data. As a result, the estimation of the states of fractional-order dynamical networks poses an important problem. To this effect, this paper addresses the problem of minimum-energy state estimation for discrete-time fractional-order dynamical networks (DT-FODN), where the state and output equations are affected by an additive noise that is considered to be deterministic, bounded, and unknown. Specifically, we derive the corresponding estimator and show that the resulting estimation error is exponentially input-to-state stable with respect to the disturbances and to a signal that is decreasing with the increase of the accuracy of the adopted approximation model. An illustrative example shows the effectiveness of the proposed method on real-world neurophysiological networks.

math.OC↗

arXiv2021

Minimum Structural Sensor Placement for Switched Linear Time-Invariant Systems and Unknown Inputs

In this paper, we study the structural state and input observability of continuous-time switched linear time-invariant systems and unknown inputs. First, we provide necessary and sufficient conditions for their structural state and input observability that can be efficiently verified in $O((m(n+p))^2)$, where $n$ is the number of state variables, $p$ is the number of unknown inputs, and $m$ is the number of modes. Moreover, we address the minimum sensor placement problem for these systems by adopting a feed-forward analysis and by providing an algorithm with a computational complexity of $ O((m(n+p)+α)^{2.373})$, where $α$ is the number of target strongly connected components of the system's digraph representation. Lastly, we explore different assumptions on both the system and unknown inputs (latent space) dynamics that add more structure to the problem, and thereby, enable us to render algorithms with lower computational complexity, which are suitable for implementation in large-scale systems.

eess.SY↗

arXiv2021

A scalable distributed dynamical systems approach to compute the strongly connected components and diameter of networks

Finding strongly connected components (SCCs) and the diameter of a directed network play a key role in a variety of discrete optimization problems, and subsequently, machine learning and control theory problems. On the one hand, SCCs are used in solving the 2-satisfiability problem, which has applications in clustering, scheduling, and visualization. On the other hand, the diameter has applications in network learning and discovery problems enabling efficient internet routing and searches, as well as identifying faults in the power grid. In this paper, we leverage consensus-based principles to find the SCCs in a scalable and distributed fashion with a computational complexity of $\mathcal{O}\left(Dd_{\text{in-degree}}^{\max}\right)$, where $D$ is the (finite) diameter of the network and $d_{\text{in-degree}}^{\max}$ is the maximum in-degree of the network. Additionally, we prove that our algorithm terminates in $D+1$ iterations, which allows us to retrieve the diameter of the network. We illustrate the performance of our algorithm on several random networks, including Erdős-Rényi, Barabási-Albert, and \mbox{Watts-Strogatz} networks.

math.OC↗

arXiv2021

Analysis of a Generalized Expectation-Maximization Algorithm for Gaussian Mixture Models: A Control Systems Perspective

The Expectation-Maximization (EM) algorithm is one of the most popular methods used to solve the problem of parametric distribution-based clustering in unsupervised learning. In this paper, we propose to analyze a generalized EM (GEM) algorithm in the context of Gaussian mixture models, where the maximization step in the EM is replaced by an increasing step. We show that this GEM algorithm can be understood as a linear time-invariant (LTI) system with a feedback nonlinearity. Therefore, we explore some of its convergence properties by leveraging tools from robust control theory. Lastly, we explain how the proposed GEM can be designed, and present a pedagogical example to understand the advantages of the proposed approach.

math.OC↗

arXiv2021

A Dynamical Systems Approach for Convergence of the Bayesian EM Algorithm

Out of the recent advances in systems and control (S\&C)-based analysis of optimization algorithms, not enough work has been specifically dedicated to machine learning (ML) algorithms and its applications. This paper addresses this gap by illustrating how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based. The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM). Following first principles from dynamical systems stability theory, conditions for convergence of MAP-EM are developed. Furthermore, if additional assumptions are met, we show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S\&C approach. The convergence guarantees in this paper effectively expand the set of sufficient conditions for EM applications, thereby demonstrating the potential of similar S\&C-based convergence analysis of other ML algorithms.

cs.LG↗

arXiv2020

Equilibrium Propagation for Complete Directed Neural Networks

Artificial neural networks, one of the most successful approaches to supervised learning, were originally inspired by their biological counterparts. However, the most successful learning algorithm for artificial neural networks, backpropagation, is considered biologically implausible. We contribute to the topic of biologically plausible neuronal learning by building upon and extending the equilibrium propagation learning framework. Specifically, we introduce: a new neuronal dynamics and learning rule for arbitrary network architectures; a sparsity-inducing method able to prune irrelevant connections; a dynamical-systems characterization of the models, using Lyapunov theory.

cs.LG↗

arXiv2020

Network Design for Controllability Metrics

In this paper, we consider the problem of tuning the edge weights of a networked system described by linear time-invariant dynamics. We assume that the topology of the underlying network is fixed and that the set of feasible edge weights is a given polytope. In this setting, we first consider a feasibility problem consisting of tuning the edge weights such that certain controllability properties are satisfied. The particular controllability properties under consideration are (i) a lower bound on the smallest eigenvalue of the controllability Gramian, which is related to the worst-case energy needed to control the system, and (ii) an upper bound on the trace of the Gramian inverse, which is related to the average control energy. In both cases, the edge-tuning problem can be stated as a feasibility problem involving bilinear matrix equalities, which we approach using a sequence of convex relaxations. Furthermore, we also address a design problem consisting of finding edge weights able to satisfy the aforementioned controllability constraints while seeking to minimize a cost function of the edge weights, which we assume to be convex. In particular, we consider a sparsity-promoting cost function aiming to penalize the number of edges whose weights are modified. Finally, we verify our results with numerical simulations over many random network realizations as well as with an IEEE 14-bus power system topology.

math.OC↗

arXiv2019

Fractional-Order Model Predictive Control for Neurophysiological Cyber-Physical Systems: A Case Study using Transcranial Magnetic Stimulation

Fractional-order dynamical systems are used to describe processes that exhibit temporal long-term memory and power-law dependence of trajectories. There has been evidence that complex neurophysiological signals like electroencephalogram (EEG) can be modeled by fractional-order systems. In this work, we propose a model-based approach for closed-loop Transcranial Magnetic Stimulation (TMS) to regulate brain activity through EEG data. More precisely, we propose a model predictive control (MPC) approach with an underlying fractional-order system (FOS) predictive model. Furthermore, MPC offers, by design, an additional layer of robustness to compensate for system-model mismatch, which the more traditional strategies lack. To establish the potential of our framework, we focus on epileptic seizure mitigation by computational simulation of our proposed strategy upon seizure-like events. We conclude by empirically analyzing the effectiveness of our method, and compare it with event-triggered open-loop strategies.

math.OC↗

arXiv2019

Resilient Structural Stabilizability of Undirected Networks

In this paper, we consider the structural stabilizability problem of undirected networks. More specifically, we are tasked to infer the stabilizability of an undirected network from its underlying topology, where the undirected networks are modeled as continuous-time linear time-invariant (LTI) systems involving symmetric state matrices. Firstly, we derive a graph-theoretic necessary and sufficient condition for structural stabilizability of undirected networks. Then, we propose a method to infer the maximum dimension of stabilizable subspace solely based on the network structure. Based on these results, on one hand, we study the optimal actuator-disabling attack problem, i.e., removing a limited number of actuators to minimize the maximum dimension of stabilizable subspace. We show this problem is NP-hard. On the other hand, we study the optimal recovery problem with respect to the same kind of attacks, i.e., adding a limited number of new actuators such that the maximum dimension of stabilizable subspace is maximized. We prove the optimal recovery problem is also NP-hard, and we develop a (1-1/e) approximation algorithm to this problem.

math.OC↗