Related papers: Certifying unstability of Switched Systems using S…
We consider the method of Reduction of Dissipativity Domain to prove global Lyapunov stability of Discrete Time Recurrent Neural Networks. The standard and advanced criteria for Absolute Stability of these essentially nonlinear systems…
This paper deals with the stability analysis problem of discrete-time switched linear systems with ranged dwell time. A novel concept called L-switching-cycle is proposed, which contains sequences of multiple activation cycles satisfying…
We propose the first general and practical framework to design certifiable algorithms for robust geometric perception in the presence of a large amount of outliers. We investigate the use of a truncated least squares (TLS) cost function,…
Iterative first-order methods such as gradient descent and its variants are widely used for solving optimization and machine learning problems. There has been recent interest in analytic or numerically efficient methods for computing…
Randomized subspace embedding methods have had a great impact on the solution of a linear least squares (LS) problem by reducing its row dimension, leading to a randomized or sketched LS (sLS) problem, and use the solution of the sLS…
Intelligent reflecting surfaces (IRSs) have emerged as a promising wireless technology for the dynamic configuration and control of electromagnetic waves, thus creating a smart (programmable) radio environment. In this context, we study a…
We study the sample complexity of the Sign-Perturbed Sums (SPS) method, which constructs exact, non-asymptotic confidence regions for the true system parameters under mild statistical assumptions, such as independent and symmetric noise…
Markov parameters play a key role in system identification. There exists many algorithms where these parameters are estimated using least-squares in a first, pre-processing, step, including subspace identification and multi-step…
We consider two problems that arise in machine learning applications: the problem of recovering a planted sparse vector in a random linear subspace and the problem of decomposing a random low-rank overcomplete 3-tensor. For both problems,…
We study the quantitative simplicity of the Lyapunov spectrum of $d$-dimensional bounded matrix cocycles subjected to additive random perturbations. In dimensions 2 and 3, we establish explicit lower bounds on the gaps between consecutive…
A linear time-invariant dissipative Hamiltonian (DH) system x' = (J-R)Q x, with a skew-Hermitian J, an Hermitian positive semi-definite R, and an Hermitian positive definite Q, is always Lyapunov stable and under weak further conditions…
We consider a stochastic process in which independent identically distributed random matrices are multiplied and where the Lyapunov exponent of the product is positive. We continue multiplying the random matrices as long as the norm,…
The structured singular value (SSV), or mu, is used to assess the robust stability and performance of an uncertain linear time-invariant system. Existing algorithms compute upper and lower bounds on the SSV for structured uncertainties that…
This paper presents a synthesis approach aiming to guarantee a minimum upper-bound for the time taken to reach a target set of non-zero measure that encompasses the origin, while taking into account uncertainties and input and state…
Hybrid systems exhibit phenomena which do not occur in systems with continuous vector fields. One such phenomenon - Zeno executions - is characterized by an infinite number of discrete events or transitions occurring over a finite interval…
We give a succinct and self-contained description of the synchronized motion on networks of mutually coupled oscillators. Usually, the stability criterion for the stability of synchronized motion is obtained in terms of Lyapunov exponents.…
Learning for control of dynamical systems with formal guarantees remains a challenging task. This paper proposes a learning framework to simultaneously stabilize an unknown nonlinear system with a neural controller and learn a neural…
The degree-$4$ Sum-of-Squares (SoS) SDP relaxation is a powerful algorithm that captures the best known polynomial time algorithms for a broad range of problems including MaxCut, Sparsest Cut, all MaxCSPs and tensor PCA. Despite being an…
In this paper we introduce a method that allows one to prove uniform local results for one-dimensional discrete Schr\"odinger operators with Sturmian potentials. We apply this method to the transfer matrices in order to study the Lyapunov…
This paper deals with input/output-to-state stability (IOSS) of switched nonlinear systems whose switching signals obey pre-specified restrictions on admissible switches between the subsystems and admissible dwell times on the subsystems.…