arXiv subjects

Yu Kawano

Publications and source records attributed to Yu Kawano.

At least 19 recordsLinked to original sources

arXiv2026

Input-to-State Stability Implications in Contraction Theory

For nonlinear control systems on normed vector spaces, we characterize an incremental input-to-state stability (ISS) type property in which the overshoot constant multiplies both the initial-condition and the input terms. Working through the associated variational system, we show that two properties are equivalent: an ISS-type bound on the variational system, and the incremental ISS-type bound on the original system. We further establish the equivalence between an infinitesimal contraction condition, expressed through a Lyapunov-type function, and an incremental Lyapunov condition. Each of these equivalent conditions yields a necessary condition and a sufficient condition for the ISS-type bounds, differing only in the input Lipschitz constant of the vector field. When the overshoot constant equals one, the infinitesimal contraction condition reduces to the standard norm-based contraction conditions. We establish these implications under mere continuous differentiability of the vector field, and we illustrate the results through sensitivity matrices and Lyapunov characteristic exponents. Moreover, we develop similar implications for discrete-time systems.

eess.SY↗

arXiv2026

Contraction Analysis of Time-Delay Systems

In this paper, we investigate contraction analysis for nonlinear time-delay systems described by functional differential equations. We first extend the concept of Lyapunov-Krasovskii functionals within the differential framework. We then show that its existence is equivalent to that of an incremental Lyapunov-Krasovskii functional and guarantees uniform incremental exponential stability. Next, we extend the concept of Lyapunov-Razumikhin functions within the differential framework, whose existence also ensures uniform incremental exponential stability. As an application of our results, we formulate stabilizing feedback control design for nonlinear time-delay systems with single delays in terms of linear matrix inequalities.

eess.SY↗

arXiv2026

A Nonlinear Separation Principle via Contraction Theory: Applications to Neural Networks, Control, and Learning

This paper establishes a nonlinear separation principle based on contraction theory and derives sharp stability conditions for recurrent neural networks (RNNs). First, we introduce a nonlinear separation principle that guarantees global exponential stability for the interconnection of a contracting state-feedback controller and a contracting observer, alongside parametric extensions for robustness and equilibrium tracking. Second, we derive sharp linear matrix inequality (LMI) conditions that guarantee the contractivity of both firing rate and Hopfield neural network architectures. We establish structural relationships among these certificates-demonstrating that continuous-time models with monotone non-decreasing activations maximize the admissible weight space-and extend these stability guarantees to interconnected systems and Graph RNNs. Third, we combine our separation principle and LMI framework to solve the output reference tracking problem for RNN-modeled plants. We provide LMI synthesis methods for feedback controllers and observers, and rigorously design a low-gain integral controller to eliminate steady-state error. Finally, we derive an exact, unconstrained algebraic parameterization of our contraction LMIs to design highly expressive implicit neural networks, achieving competitive accuracy and parameter efficiency on standard image classification benchmarks.

eess.SY↗

arXiv2026

Contracting Neural Networks: Sharp LMI Conditions with Applications to Integral Control and Deep Learning

This paper studies contractivity of firing-rate and Hopfield recurrent neural networks. We derive sharp LMI conditions on the synaptic matrices that characterize contractivity of both architectures, for activation functions that are either non-expansive or monotone non-expansive, in both continuous and discrete time. We establish structural relationships among these conditions, including connections to Schur diagonal stability and the recovery of optimal contraction rates for symmetric synaptic matrices. We demonstrate the utility of these results through two applications. First, we develop an LMI-based design procedure for low-gain integral controllers enabling reference tracking in contracting firing rate networks. Second, we provide an exact parameterization of weight matrices that guarantee contraction and use it to improve the expressivity of Implicit Neural Networks, achieving competitive performance on image classification benchmarks with fewer parameters.

eess.SY↗

arXiv2026

Contractivity of Multi-Stage Runge-Kutta Dynamics

Many control, optimization, and learning algorithms rely on discretizations of continuous-time contracting systems, where preservation of contractivity under numerical integration is key for stability, robustness, and reliable fixed-point computation. In this paper, we establish conditions under which multi-stage Runge-Kutta methods preserve strong contractivity when discretizing infinitesimally contractive continuous-time systems. For explicit Runge-Kutta methods, preservation conditions are derived by bounding Lipschitz constants of the associated composite stage mappings, leading to coefficient-dependent criteria. For implicit methods, the algebraic structure of the stage equations enables explicit conditions on the Runge-Kutta coefficients that guarantee preservation of strong contractivity. In the implicit case, these results extend classical guarantees, typically limited to weak contractivity in the Euclidean metric, to strong contractivity with respect to the $\ell_1$-, $\ell_2$-, and $\ell_\infty$-norms. In addition, we study well-definedness of implicit methods through an auxiliary continuous-time system associated with the stage equations. We show that strong infinitesimal contractivity of this auxiliary system is sufficient to guarantee unique solvability of the stage equations. This analysis generalizes standard well-definedness conditions and provides a dynamic implementation approach that avoids direct solution of the implicit algebraic equations.

eess.SY↗

arXiv2026

Incremental Input-to-State Stability and Equilibrium Tracking for Stochastic Contracting Dynamics

In this paper, we study the contractivity of nonlinear stochastic differential equations (SDEs) driven by deterministic inputs and Brownian motions. Given a weighted $\ell_2$-norm for the state space, we show that an SDE is incrementally noise- and input-to-state stable if its vector field is uniformly contracting in the state and uniformly Lipschitz in the input. This result is applied to error estimation for time-varying equilibrium tracking in the presence of noise affecting both the system dynamics and the input signals. We consider both Ornstein-Uhlenbeck processes modeling unbounded noise and Jacobi diffusion processes modeling bounded noise. Finally, we turn our attention to the associated Fokker-Planck equation of an SDE. For this context, we prove incremental input-to-state stability with respect to an arbitrary $p$-Wasserstein metric when the drift vector field is uniformly contracting in the state and uniformly Lipschitz in the input with respect to an arbitrary norm.

eess.SY↗

arXiv2025

A Randomized Scheduling Framework for Privacy-Preserving Multi-robot Rendezvous given Prior Information

Privacy has become a critical concern in modern multi-robot systems, driven by both ethical considerations and operational constraints. As a result, growing attention has been directed toward privacy-preserving coordination in dynamical multi-robot systems. This work introduces a randomized scheduling mechanism for privacy-preserving robot rendezvous. The proposed approach achieves improved privacy even at lower communication rates, where privacy is quantified via pointwise maximal leakage. We show that lower transmission rates provide stronger privacy guarantees and prove that rendezvous is still achieved under the randomized scheduling mechanism. Numerical simulations are provided to demonstrate the effectiveness of the method.

eess.SY↗

arXiv2025

Privacy protection under the exposure of systems' prior information

For systems whose states implicate sensitive information, their privacy is of great concern. While notions like differential privacy have been successfully introduced to dynamical systems, it is still unclear how a system's privacy can be properly protected when facing the challenging yet frequently-encountered scenario where an adversary possesses prior knowledge, e.g., the steady state, of the system. This paper presents a new systematic approach to protect the privacy of a discrete-time linear time-invariant system against adversaries knowledgeable of the system's prior information. We employ a tailored \emph{pointwise maximal leakage (PML) privacy} criterion. PML characterizes the worst-case privacy performance, which is sharply different from that of the better-known mutual-information privacy. We derive necessary and sufficient conditions for PML privacy and construct tractable design procedures. Furthermore, our analysis leads to insight into how PML privacy, differential privacy, and mutual-information privacy are related. We then revisit Kalman filters from the perspective of PML privacy and derive a lower bound on the steady-state estimation-error covariance in terms of the PML parameters. Finally, the derived results are illustrated in a case study of privacy protection for distributed sensing in smart buildings.

eess.SY↗

arXiv2025

Fluid-structure interaction analysis with interface control principle

An interface control principle is proposed for unsteady fluid-structure in- teraction (FSI) analyses. This principle introduces a method of explicitly controlling the interface motion in the temporal direction to minimize the residual force on the interface, which is defined as the discrepancy between the fluid and structural forces. The interface model is constructed using a data-driven approach that involves sparse identification of nonlinear dy- namics with control to evaluate the residual force. The interface model is subsequently subjected to control theory in order to minimize the residual force. Following the convergence of the residual force, the interface state is controlled to be that of the original unsteady FSI system. The fluid and structural simulations can be conducted independently without communication, as the interface state information is predetermined as inputs for each system. The proposed method is applied to the vortex-induced vibration (VIV) of a cylinder at a Reynolds number of 150 under several reduced velocity conditions corresponding to the lock-in regime with limit-cycle oscillations. The results demonstrate that the residual force is sufficiently minimized in time, and when the residual force is close to zero, the predicted fluid force and structural displacement of the VIV show good agreement with the reference FSI simulation.

physics.flu-dyn↗

arXiv2025

Partial Eigenvalue Assignment for Nonlinear Systems

In this paper, we study control design methods for assigning a subset of nonlinear right or left eigenvalues to a specified set of scalar-valued functions via nonlinear Sylvester equations. This framework can be viewed as a generalization of partial linear eigenvalue assignment (also referred to as partial pole placement) for linear systems. First, we propose a method for partial nonlinear right eigenvalue assignment via state feedback using a nonlinear Sylvester equation and a condition for preserving an open-loop nonlinear right eigenvalue. This method can be applied to partial stabilization of nonlinear systems. Then, as the dual problem, we present a method for partial nonlinear left eigenvalue assignment via the dual nonlinear Sylvester equation and a condition for preserving an open-loop nonlinear left eigenvalue, which can be applied to partial observer design for nonlinear system.

math.OC↗

arXiv2025

Design of MIMO Lur'e oscillators via dominant system theory with application in multi-agent rhythm synchronization

This paper presents a new design framework for dynamic output-feedback controllers for Lur'e oscillation in a multiple-input multiple-output setting. We first revisit and extend dominant system theory to state-dependent rates, with the goal of deriving conditions based on linear matrix inequalities. Then, we introduce a separation principle for Lur'e oscillator design, which allows for the independent design of a state-feedback oscillator and an observer. Our proposed control synthesis is demonstrated through the rhythm synchronization in multi-agent systems, illustrating how networks of stable, heterogeneous linear agents can be driven into phase-locked rhythmic behavior.

eess.SY↗

arXiv2025

Dynamical models for distributed social power perception in Friedkin-Johnsen influence networks

Social power quantifies the ability of individuals to influence others and plays a central role in social influence networks. Yet, computing social power typically requires global knowledge and significant computational or storage capability, especially in large-scale networks with stubborn individuals. In this paper, we propose a distributed perception mechanism based on the Friedkin-Johnsen opinion dynamics that enables individuals to estimate their true social power through local interactions. The mechanism starts from independent initial perceptions and relies only on local information: each individual only needs to know its neighbors' stubbornness and the influence weights they accord. We provide rigorous dynamical system analysis that characterizes equilibria, invariant sets, and convergence. Conditions are established for convergence to the true social power in both the static setting with fixed influence weights and the reflected-appraisal setting where influence weights coevolve with perceptions. The proposed mechanism remains reliable under extreme initial perceptions, disconnected influence networks, reflected-appraisal coupling, and variations in timescales. Numerical examples illustrate our results.

eess.SY↗

arXiv2025

Virtual Contraction Approach to Decentralized Adaptive Stabilization of Nonlinear Time-Delayed Networks

In this paper, we exploit a diagonally dominant structure for the decentralized stabilization of unknown nonlinear time-delayed networks. To this end, we first introduce a novel generalization of virtual contraction analysis to diagonally dominant time-delayed control systems. We then show that nonlinear time-delayed networks can be stabilized using diagonal high-gains, provided that the input matrices satisfy certain generalized (column/row) diagonally dominant conditions. To enable stabilization of unknown networks, we further propose a distributed adaptive tuning rule for each individual gain function, guaranteeing that all closed-loop trajectories converge to the origin while the gains converge to finite values. The effectiveness of the proposed decentralized adaptive control is illustrated through a case study on epidemic spreading control in SIS networks with transmission delays.

eess.SY↗

arXiv2025

On Differential Controllability and Observability Functions

Differential balancing theory for nonlinear model reduction relies on differential controllability and observability functions. In this paper, we further investigate them from two different perspectives. First, we establish novel connections between these differential energy functions and their incremental counterparts by assuming the existence of the corresponding optimal state feedback for each controllability function. Specifically, an upper bound on the incremental controllability/observability function is provided by the corresponding differential energy function. Conversely, an upper bound on the differential controllability function can be estimated from the incremental controllability function. Furthermore, the differential observability function can be constructed from the incremental observability function. Second, we explore the positive definiteness of the differential controllability/observability function in the context of controllability/observability and stability.

eess.SY↗

arXiv2025

Privacy Preservation for Statistical Input in Dynamical Systems

This paper addresses the challenge of privacy preservation for statistical inputs in dynamical systems. Motivated by an autonomous building application, we formulate a privacy preservation problem for statistical inputs in linear time-invariant systems. What makes this problem widely applicable is that the inputs, rather than being assumed to be deterministic, follow a probability distribution, inherently embedding privacy-sensitive information that requires protection. This formulation also presents a technical challenge as conventional differential privacy mechanisms are not directly applicable. Through rigorous analysis, we develop strategy to achieve $(0, \delta)$ differential privacy through adding noise. Finally, the effectiveness of our methods is demonstrated by revisiting the autonomous building application.

eess.SY↗

arXiv2025

Initial State Privacy of Nonlinear Systems on Riemannian Manifolds

In this paper, we investigate initial state privacy protection for discrete-time nonlinear closed systems. By capturing Riemannian geometric structures inherent in such privacy challenges, we refine the concept of differential privacy through the introduction of an initial state adjacency set based on Riemannian distances. A new differential privacy condition is formulated using incremental output boundedness, enabling the design of time-varying Laplacian noise to achieve specified privacy guarantees. The proposed framework extends beyond initial state protection to also cover system parameter privacy, which is demonstrated as a special application.

eess.SY↗

arXiv2025

Distributionally Robust Model Order Reduction for Linear Systems

In this paper, we investigate distributionally robust model order reduction for linear, discrete-time, time-invariant systems. The external input is assumed to follow an uncertain distribution within a Wasserstein ambiguity set. We begin by considering the case where the distribution is certain and formulate an optimization problem to obtain the reduced model. When the distribution is uncertain, the interaction between the reduced-order model and the distribution is modeled by a Stackelberg game. To ensure solvability, we first introduce the Gelbrich distance and demonstrate that the Stackelberg game within a Wasserstein ambiguity set is equivalent to that within a Gelbrich ambiguity set. Then, we propose a nested optimization problem to solve the Stackelberg game. Furthermore, the nested optimization problem is relaxed into a nested convex optimization problem, ensuring computational feasibility. Finally, a simulation is presented to illustrate the effectiveness of the proposed method.

math.OC↗

arXiv2024

Design of Stochastic Quantizers for Privacy Preservation

In this paper, we examine the role of stochastic quantizers for privacy preservation. We first employ a static stochastic quantizer and investigate its corresponding privacy-preserving properties. Specifically, we demonstrate that a sufficiently large quantization step guarantees $(0, \delta)$ differential privacy. Additionally, the degradation of control performance caused by quantization is evaluated as the tracking error of output regulation. These two analyses characterize the trade-off between privacy and control performance, determined by the quantization step. This insight enables us to use quantization intentionally as a means to achieve the seemingly conflicting two goals of maintaining control performance and preserving privacy at the same time; towards this end, we further investigate a dynamic stochastic quantizer. Under a stability assumption, the dynamic stochastic quantizer can enhance privacy, more than the static one, while achieving the same control performance. We further handle the unstable case by additionally applying input Gaussian noise.

eess.SY↗