paper-with-me

Papers

Controllability Issues of Linear Ensemble Systems over Multi-dimensional Parameterization Spaces

2020-03-10 · Xudong Chen

We address an open problem in ensemble control: Whether there exist controllable linear ensemble systems over multi-dimensional parameterization spaces? We provide a negative result: Any real-analytic linear ensemble system is not $\mathrm{L}^p$-controllable, for $2\leq p \leq \infty$, if its parameterization space contains an open set in $\mathbb{R}^d$ for $d \geq 2$.

📄 PDF Abstract BibTeX arXiv:2003.04529

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Sparse Linear Ensemble Systems and Structural Controllability

2020-04-06 · Xudong Chen

The paper introduces and solves a structural controllability problem for continuum ensembles of linear time-invariant systems. All the individual linear systems of an ensemble are sparse, governed by the same sparsity pa…

Controllability and Tracking of Ensembles: An Optimal Transport Theory Viewpoint

2024-12-17 · Reza Hadadi

This paper explores the controllability and state tracking of ensembles from the perspective of optimal transport theory. Ensembles, characterized as collections of systems evolving under the same dynamics but with varyi…

Universal Approximation Power of Deep Residual Neural Networks via Nonlinear Control Theory

2020-07-12 · ICLR 2021 1 · Paulo Tabuada, Bahman Gharesifard

In this paper, we explain the universal approximation capabilities of deep residual neural networks through geometric nonlinear control. Inspired by recent work establishing links between residual networks and control sy…

Trajectory-Aware Node Contributions and the Limits of Static Controllability

2026-06-02 · Valentina Kuskova, Dmitry Zaytsev, Michael Coppedge arxiv

A recurring data mining task in complex networks is to determine how individual nodes contribute to system behavior. Existing approaches rely on either static-graph centralities or control-theoretic quantities such as co…

Linear Systems can be Hard to Learn

2021-04-02 · Anastasios Tsiamis, George J. Pappas

In this paper, we investigate when system identification is statistically easy or hard, in the finite sample regime. Statistically easy to learn linear system classes have sample complexity that is polynomial with the sy…