Linear Time-Invariant
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Trajectory-Aware Node Contributions and the Limits of Static Controllability
arXiv:2606.03067v1 Announce Type: cross Abstract: 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 controllability Gramians, which assume linear, time-invariant dynamics. Estimated systems, however, are typically nonlinear and time-varying.
Trajectory-Aware Node Contributions and the Limits of Static Controllability
Announce Type: replace-cross Abstract: 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 controllability Gramians, which assume linear, time-invariant dynamics. Estimated systems, however, are typically nonlinear and time-varying.
State Observers for Linear Systems with Prescribed Residual Bounds
Announce Type: new Abstract: This paper presents a state observer design for continuous linear time-invariant (LTI) systems subject to unknown bounded disturbances, that enforces a prescribed bound on the observer residual. The proposed observer augments a continuous-time Luenberger observer with state resets, triggered when the norm of the residual equals a pre-specified bound. The reset map guarantees contraction of the residual at jump instants while preserving the uniform boundedness...
CART: Context-Anchored Recurrent Transformer -- A Parameter-Efficient Architecture with Learned Stability
arXiv:2606.01495v2 Announce Type: replace Abstract: We present CART (Context-Anchored Recurrent Transformer), a parameter-efficient language model that reuses a single shared core block R times across depth. Unlike prior looped transformers that recompute key-value tensors at every iteration, CART computes K and V once from a multi-layer prelude and has the recurrent core cross-attend to those frozen tensors via multi-head latent attention. A learned Linear Time-Invariant (LTI) gate keeps...
CART: Context-Anchored Recurrent Transformer -- A Parameter-Efficient Architecture with Learned Stability
new Abstract: We present CART (Context-Anchored Recurrent Transformer), a parameter-efficient language model that reuses a single shared core block R times across depth. Unlike prior looped transformers that recompute key-value tensors at every iteration, CART computes K and V once from a multi-layer prelude and has the recurrent core cross-attend to those frozen tensors via multi-head latent attention. A learned Linear Time-Invariant (LTI) gate keeps the recurrence stable: its spectral...
Robust and efficient data-driven predictive control
arXiv:2409.18867v2 Announce Type: replace Abstract: We propose a robust and efficient data-driven predictive control (eDDPC) scheme which is more sample efficient (requires less offline data) compared to existing schemes, and is also computationally efficient. This scheme employs a recently proposed data-based representation of linear time-invariant (LTI) systems as a predictor. Such a representation serves as an alternative to Hankel-based predictors obtained from, e.g., the so-called...
R2DN: Scalable Parameterization of Contracting and Lipschitz Recurrent Deep Networks
arXiv:2504.01250v2 Announce Type: replace Abstract: This paper presents the Robust Recurrent Deep Network (R2DN), a scalable parameterization of robust recurrent neural networks for machine learning and data-driven control. We construct R2DNs as the feedback interconnection of a linear time-invariant system and a 1-Lipschitz deep feedforward network, and directly parameterize the weights so that our models are stable (contracting) and robust to small input perturbations (Lipschitz) by...
Model-free LQG Control with Chance Constraints
arXiv:2605.31310v1 Announce Type: new Abstract: This paper studies model-free optimal control design and its convergence properties for linear time-invariant systems subject to probabilistic risk or chance constraints. In particular, we study a natural policy gradient (NPG)-based actor-critic (AC) algorithm with two timescales, using a Lagrangian primal-dual framework to enforce the constraint.
Synthesizing Neural Network Controllers with Closed-Loop Dissipativity Guarantees
arXiv:2404.07373v2 Announce Type: replace Abstract: This paper presents a method to synthesize neural network controllers to maximize reward subject to the hard constraint that the feedback system of plant and controller be dissipative, certifying requirements such as stability and $L_2$ gain bounds. It considers nonlinear and uncertain plants, modeled as the interconnection of a linear time-invariant (LTI) system and an uncertainty block, which incorporates nonlinearities. The uncertainty...
Gradient-Flow Optimization as Dynamic Random-Effects Inference: Testing and Early Stopping with Applications to Deep Learning
arXiv:2605.27991v2 Announce Type: replace-cross Abstract: Gradient-flow optimization is usually viewed as an algorithmic procedure for minimizing empirical loss, with training duration selected by validation or heuristic early-stopping rules. We develop a statistical inference framework for the gradient-flow training trajectory itself. The central object is fixed-operator squared-error gradient flow: whenever the fitted value evolves through a time-invariant positive semidefinite training...