Searcharxiv⌕ Search

arXiv subjects

Kazuhiro Sato

Publications and source records attributed to Kazuhiro Sato.

At least 19 recordsLinked to original sources

Robustness of controllability scores for stable linear network systems

Controllability scores quantify node importance in linear network systems by optimizing the allocation of input strength. Although the volumetric controllability score (VCS) and average-energy controllability score (AECS) are uniquely defined for Hurwitz systems, their sensitivity to perturbations of the system matrix remains unclear. In this paper, we investigate the robustness of these scores to such perturbations. We first prove that both scores are locally Lipschitz continuous in the system matrix and establish a robustness bound for Hurwitz comparison matrices. We then characterize the directional derivative of the optimal allocation along a differentiable matrix path as the unique solution of a critical-cone quadratic program, whose linear term is computed using differentiated Lyapunov equations. For single-edge weakening, the norm of the resulting response vector provides a robustness-based measure of edge importance. Numerical experiments show that the response, and hence the edge importance, depends on both the criterion and the dynamics, not only on the network topology.

math.OC↗

Operational Interpretation of Controllability Allocation Scores via Randomized Interventions

Controllability allocation scores (CASs) assign weights to virtual input channels without specifying how interventions should be implemented. This paper provides an operational interpretation through randomized finite-duration interventions with prescribed, possibly candidate-dependent waveforms. Selection probabilities are fixed before a mean-output target is specified, while waveform amplitudes are optimized after the target is revealed. We derive the unique minimum expected-energy amplitude policy and formulate volumetric and weighted average-energy allocation criteria. We also establish a finite-trial mean-output error bound and show that waveform-based weighted AE-CAS minimizes an upper bound on the target-averaged mean-square error. We establish uniform convergence of normalized waveform-response Gramians and show that accumulation points of optimal allocations solve the limiting problem. With uniform timing, equal positive waveform efficiencies recover the original CAS in the short-duration limit, whereas unequal efficiencies yield waveform-weighted limits. Under the former conditions, the limiting error bound is proportional to the original weighted AE-CAS objective. For common waveforms, we further establish an exact finite-duration correspondence with the original full-state V-CAS under uniform timing.

math.OC↗

A Deep State-Space Model Compression Method using Upper Bound on Output Error

We study deep state-space models (Deep SSMs) that contain linear quadratic-output (LQO) systems as internal blocks and present a compression method with a provable output error guarantee. We first derive an upper bound on the output error between two Deep SSMs and show that the bound can be expressed in terms of the $h^2$-error norms between the layerwise LQO systems. In particular, we show that reducing the $h^2$ approximation errors of the LQO systems placed in shallow layers is effective in reducing the derived upper bound on the output error. Next, we formulate an optimization problem for the derived upper bound and develop a gradient-based MOR method. In the numerical experiments, using the IMDb task from the LRA benchmark, we demonstrate the effectiveness of the proposed upper-bound-based compression method. In particular, we show that the number of trainable parameters can be reduced by approximately 60\% without retraining while maintaining the performance of the original model.

eess.SY↗

Controllability-Based Input Allocation in Quantum System

Understanding how local perturbations influence global quantum dynamics is important for analyzing and designing large-scale quantum systems. Existing quantum centrality measures often rely on static correlations or entanglement and do not directly capture perturbation propagation under unitary evolution. We formulate controllability allocation scoring for quantum input-output dynamics governed by the Schrodinger equation. Using the multiobservable quantum-control Gramian, we introduce virtual local Hamiltonian perturbations along a nominal trajectory and decompose the terminal-output response into channel-wise Gramian contributions. A simplex-constrained log-determinant optimization combines these contributions to define a volumetric controllability allocation score (V-CAS), specifying an optimal allocation of virtual input intensities among local Hamiltonian perturbation directions. The score measures their cooperative dynamical influence and depends on the output and trajectory. We characterize the output Gramian's range and minimum-energy properties and derive a drift-independent sufficient condition ensuring score uniqueness for almost every terminal time at which the problem is feasible. For quantum many-body systems, we develop a matrix-product-state and time-evolving-block-decimation implementation that avoids explicitly constructing exponentially large state-transition matrices. We also derive an error bound propagating Trotter and MPS-truncation errors to the discrete output Gramian. Numerical experiments show that the score captures finite-time influence patterns distinct from those identified by static correlation- and entanglement-based measures and can inform target-independent control-channel preselection.

quant-ph↗

Controllability Allocation Scores for Linear Infinite-Dimensional Systems

We define finite-time controllability allocation scores (CASs) as optimal solutions to two convex optimization problems that allocate a fixed actuation budget among prescribed input functions of linear infinite-dimensional continuum systems with selected target outputs. The objectives are expressed using controllability Gramians for the selected outputs and correspond to maximizing the volume of output changes reachable with unit control energy or minimizing the mean energy required for unit output changes. To compute these CASs, we discretize the system in space, construct the resulting Gramians, and solve the resulting allocation problems by a domain-aware projected gradient descent method. We study the behavior of CASs when the actuator-to-target responses of the spatially discretized systems converge to those of the continuum system as the mesh is refined. If the continuum system is target controllable, we show that the spatially discretized systems are also target controllable on sufficiently fine meshes and that the optimal values of the approximate problems converge to the optimal value for the continuum system. If the allocation problem for the continuum system has a unique CAS, we show that the CASs obtained from the spatially discretized problems converge to it. We also derive quantitative bounds on the errors between these CASs when the Gramian map for the continuum system distinguishes allocations. A two-dimensional advection-diffusion example illustrates how transport dynamics affect target controllability and CASs. Spatial refinement reveals apparent controllability caused by numerical diffusion and supports the theoretical convergence results.

math.OC↗

Controllability Allocation Scores for Targeted Network Intervention

We introduce the controllability allocation score (CAS), a framework for determining how intervention intensity should be distributed among prescribed candidate input directions with respect to designated target variables, together with the target controllability score (TCS) as its nodewise specialization. We establish existence of the CASs and develop a general uniqueness theory based on restricted injectivity of the allocation-to-Gramian map, including generic uniqueness with respect to the time horizon. We show that restricting attention to target variables can fundamentally alter the optimal intervention allocation compared with the standard full-state setting. To enable scalability, we develop a general surrogate-Gramian framework and derive objective-performance guarantees from relative Gramian errors without requiring uniqueness or closeness of the CASs. For the TCS specialization, we further construct a target-only reduced virtual system and derive explicit bounds showing how the approximation error depends on the coupling between target and non-target nodes and on the dynamical growth rate. Experiments on human brain networks show that the reduced formulation accurately approximates the TCS at short horizons, whereas the two controllability criteria exhibit markedly different approximation accuracy at long horizons.

math.OC↗

Contraction-Based Model Predictive Control using Bilinear Koopman Realizations with Proportional Error Bounds

Data-driven model predictive control based on Koopman operator theory is a promising approach for constrained control of nonlinear systems with unknown dynamics. This paper proposes a robust model predictive control framework for such systems using bilinear Koopman realizations with state- and input-dependent proportional approximation-error bounds that vanish at the target equilibrium. Since prediction in lifted coordinates with a finite-dimensional Koopman realization need not remain on the manifold of valid lifted states, multi-step prediction may leave the region where one-step error certificates apply. We avoid this difficulty by reprojecting each predicted lifted state onto the original state coordinates and lifting it again, yielding an error-aware discrete-time control-affine predictor in the original state space without assuming invariance of the Koopman dictionary. For this predictor, we develop a homothetic tube construction based on a discrete-time robust control contraction metric whose radius explicitly accounts for the proportional approximation error bounds. The tube tightening handles arbitrary continuously differentiable nonlinear constraints, and the resulting model predictive control problem includes terminal ingredients and a tube-radius penalty that exploits the vanishing uncertainty near the target. We prove robust satisfaction of the original nonlinear constraints, recursive feasibility, and exponential stability of the sampled true closed-loop system with high probability over the training data without requiring a globally optimal solution to the model predictive control problem. Numerical examples, including nonlinear obstacle-avoidance constraints, demonstrate robust stabilization and higher performance of the proposed approach compared to existing Koopman-based model predictive control methods in terms of smaller closed-loop cost and flexibility.

math.OC↗

Infinite-horizon controllability scores for linear time-invariant systems

We formulate infinite-horizon controllability scores for linear time-invariant systems whose conventional controllability Gramians may diverge. A mode-dependent scaling yields finite-horizon volumetric controllability score (VCS) and average energy controllability score (AECS) problems that are exactly equivalent to the original ones, while the scaled Gramians converge as the horizon tends to infinity. Using epi-convergence, we establish convergence of the finite-horizon optimal allocations to the limiting solution set and obtain convergence to a unique limiting score under explicit rank conditions. The limiting VCS retains the stable, center, and unstable components and preserves full-system controllability, whereas the limiting AECS depends only on the stable component and may neglect an input required for a center or unstable mode. The VCS theory allows arbitrary spectral structures, whereas the AECS limit requires a nonempty stable component. The additional restriction on the center spectrum is imposed only for the real-Schur implementation. A directed-Laplacian example verifies the convergence and uniqueness conditions and illustrates the controllability distinction between the two limiting scores.

math.OC↗

Generalized Resistance Geometry from Kron Reduction and Effective Resistance

We develop a generalized resistance geometry for unsigned directed graphs and signed undirected graphs based on Kron reduction and effective resistance. For unsigned strongly connected weight-balanced directed graphs, we establish a generalized Fiedler--Bapat identity involving an associated signed undirected Laplacian constructed from the symmetrized pseudoinverse. We identify this Laplacian as the sum of the symmetrized directed Laplacian and a positive-semidefinite correction induced by graph asymmetry. This decomposition yields an effective-resistance comparison that extends a previous normality-based result, and we prove that the construction commutes with Kron reduction. For general unsigned strongly connected directed graphs satisfying a positivity condition, we define resistance curvature and resistance radius through a weight-balanced representation. Motivated by the associated signed undirected graphs, we introduce a class whose effective resistances form a metric and show that the resulting resistance matrices are precisely the strict negative type metric matrices. Within this framework, we characterize the unique solution of the maximum graph-variance problem and develop generalized resistive embeddings into Euclidean space.

cs.DM↗

Bilinear Koopman-Based Robust Model Predictive Control for Unknown Nonlinear Systems via Contraction Metrics

Data-driven model predictive control (MPC) using Koopman operator theory is a promising approach for constrained control of unknown nonlinear systems. While linear Koopman realizations are commonly used due to their simplicity, bilinear Koopman realizations can provide significantly higher approximation accuracy for nonlinear control systems. However, robust MPC (RMPC) formulations that account for modeling errors in bilinear Koopman realizations remain limited. This paper proposes a RMPC framework for unknown nonlinear systems with general nonlinear constraints based on data-driven bilinear Koopman realizations. A central difficulty is that finite-dimensional Koopman predictors need not preserve the manifold of valid lifted states, so multi-step prediction in lifted coordinates may leave the region where one-step error certificates apply. We address this issue by reprojecting each predicted lifted state back onto the manifold, thereby obtaining an error-aware discrete-time control-affine predictor in the original state space without impractical assumptions. For this predictor, we develop a discrete-time robust control contraction metric based homothetic tube construction, and then formulate a tube-based RMPC problem with terminal ingredients. Under the proposed formulation, we prove robust satisfaction of the original nonlinear constraints by the true closed-loop trajectory, recursive feasibility, and convergence to a neighborhood of the target state. Numerical experiments demonstrate robust stabilization of nonlinear systems and the advantages of the proposed method over existing Koopman-based RMPC approaches in terms of performance.

math.OC↗

Projected-Gradient Analysis for Open-Domain Convex Optimization under Boundary Blow-Up:Application to Controllability Scoring

We study convex optimization over a compact convex set when the objective is smooth and convex only on an open domain. Under a boundary-blow-up condition, every feasible initialization yields a compact invariant sublevel set separated from the complement of the objective domain, and an optimal solution exists. For a domain-aware Armijo projected-gradient method, a safe-neighborhood analysis establishes well-defined objective evaluations, finite backtracking, sufficient decrease, and a run-specific but iteration-independent positive lower bound on the accepted step sizes. These properties yield explicit sublinear objective and stationarity guarantees, together with convergence of the full iterate sequence. Positive curvature restricted to feasible displacement directions further guarantees uniqueness and linear convergence. We apply the framework to controllability scoring with prescribed input directions and compact convex allocation constraints. Feasibility is characterized exactly by controllability of the input directions eligible for positive allocation, while restricted injectivity of the Gramian map guarantees uniqueness of the optimal allocation and provides explicit strong-convexity bounds. A directed-network example illustrates how candidate exclusion can preserve or destroy feasibility and alter the optimal allocation in a criterion- and horizon-dependent manner.

math.OC↗

Relationship Between Controllability Scoring and Optimal Experimental Design

Controllability scores provide control-theoretic centrality measures that quantify the relative importance of state nodes in networked dynamical systems. We establish a structural connection between finite-time controllability scoring and approximate optimal experimental design (OED): the finite-time controllability Gramian decomposes additively across nodes, yielding an affine matrix model of the same form as the information-matrix model in OED. This yields a direct correspondence between the volumetric controllability score (VCS) and D-optimality, and between the average energy controllability score (AECS) and A-optimality, implying that the classical D/A invariance gap has a direct analogue in controllability scoring. By contrast, we point out that controllability scoring generically admits a unique optimizer, unlike approximate-OED formulations. Finally, we uncover a long-horizon phenomenon with no OED counterpart: source-like state nodes without a negative self-loop can be increasingly downweighted by AECS as the horizon grows. Two numerical examples corroborate this long-horizon downweighting behavior.

math.OC↗

Data-Driven Regularized Time-Limited h2 Model Reduction from Noisy Impulse Responses

This paper develops a data-driven time-limited h2 model reduction method for discrete-time linear time-invariant systems. Specifically, we formulate and solve a regularized time-limited h2 model reduction problem using only noisy impulse response data. Furthermore, we show that the objective function and its gradient can be represented using only noisy impulse response data. Numerical experiments using SLICOT benchmarks demonstrate that the proposed regularized method achieves lower relative time-limited h2 errors than the tested alternatives and is effective in situations where the unregularized method may deteriorate under noise.

eess.SY↗

Task-Dependent Weighted Average Energy Controllability Score for Network Intervention

Controllability scores provide principled information on where intervention should be applied in large-scale network systems when explicit control design is difficult. Two representative controllability scores are the volumetric controllability score (VCS) and the average energy controllability score (AECS). While both are important, the standard AECS treats all state-transition directions uniformly. In this paper, we propose the weighted average energy controllability score (W-AECS), a task-dependent extension of AECS that incorporates a prescribed transition of interest through a weighting matrix. We show that the proposed formulation admits a control-theoretic interpretation via expected minimum-energy steering, and establish strict convexity and generic uniqueness. These results support the interpretation of W-AECS as a well-defined node-wise task-dependent intervention score. We also illustrate the proposed method on a structural brain-network dataset, where transition-dependent weighting reshapes the scoring pattern, yielding a VCS-like preference among the highest-ranked regions while preserving an overall structure distinct from both standard AECS and VCS.

math.OC↗

Performance bound analysis of linear consensus algorithm on strongly connected graphs using effective resistance and reversiblization

We study the performance of the linear consensus algorithm on strongly connected directed graphs using the linear quadratic (LQ) cost as a performance measure. In particular, we derive bounds on the LQ cost by leveraging effective resistance and reversiblization. Our results extend previous analyses-which were limited to reversible cases-to the nonreversible setting. To facilitate this generalization, we introduce novel concepts, termed the back-and-forth path and the pivot node, which serve as effective alternatives to traditional techniques that require reversibility. Moreover, we apply our approach to Cayley graphs and random geometric graphs to estimate the LQ cost without the reversibility assumption. The proposed approach provides a framework that can be adapted to other contexts where reversibility is typically assumed.

math.OC↗

NOMADS: Non-Markovian Optimization-based Modeling for Approximate Dynamics with Spatially-homogeneous Memory

We propose a system identification method, Non-Markovian Optimization-based Modeling for Approximate Dynamics with Spatially-homogeneous memory (NOMADS), for identifying linear dynamical systems from a set of multi-dimensional time-series data obtained through multiple partially excited experiments. NOMADS formulates model identification as a convex optimization problem, in which the state-space coefficient matrices and a memory kernel are estimated jointly under physically motivated constraints using projected gradient descent. The proposed framework models memory effects through a spatially homogeneous kernel, enabling scalable identification of non-Markovian dynamics while keeping the number of free parameters moderate. This structure allows NOMADS to integrate information from multiple multi-dimensional time-series data even when no single experiment provides full excitation. In the Markovian setting, physical constraints can be incorporated to enforce conservation laws. Numerical experiments on synthetic data demonstrate that NOMADS achieves substantially improved generalization accuracy compared to existing DMD-based methods even for noisy train data, and reproduces energy conservation in the Markovian case.

math.OC↗

Model-Free Design and Analysis of 2DOF PI Controller for Noisy LTI Systems

Set-point tracking for systems with unknown model parameters is a fundamental problem in control, and two-degree-of-freedom (2DOF) Proportional-Integral (PI) controllers -- consisting of a feedforward controller and PI controller -- are widely employed for this task. In this paper, we propose a model-free design of 2DOF PI controllers, establish its theoretical properties, and compare them with a model-based method from both theoretical and numerical perspectives. For the feedforward design, we extend an existing model-free algorithm to systems subject to Gaussian process and measurement noises. We derive a nonasymptotic lower bound on the required control input/output data length and characterize the resulting estimation error. For PI gain tuning, we formulate a constrained optimization problem and establish sample complexity of a zeroth-order optimization method. Moreover, we quantify how inaccuracies in the feedforward design propagate to the performance of the PI controller, highlighting an interaction that has not been examined in prior work. We further provide a theoretical comparison between the proposed method and the model-based method. In particular, for PI gain tuning, the proposed method is computationally more efficient by avoiding explicit gradient computations. Numerical experiments demonstrate that the 2DOF PI controller designed by the proposed method exhibits better control performance than the model-based method.

math.OC↗

Controllability scores of linear time-varying network systems

For large-scale network systems, network centrality based on control theory plays a crucial role in understanding their properties and controlling them efficiently. The controllability score is such a centrality index and can give a physically meaningful measure. It is originally proposed for linear time-invariant (LTI) systems, and we extend it to linear time-varying (LTV) systems in this paper. Since the controllability score is defined as an optimal solution to some optimization problem, it is not necessarily uniquely determined. Its uniqueness must be guaranteed for reproducibility and interpretability. In this paper, we show its uniqueness in almost all cases, which guarantees its use as a network centrality measure. We also prove its continuity with respect to the time parameters. In addition, we propose a data-driven method to compute it. Finally, we verify the effectiveness of the extension and examine the performance of the data-driven method through numerical experiments.

math.OC↗