Related papers: An entropy-based bound for the computational compl…
For a closed-loop control system with a digital channel between the sensor and the controller, the notion of invariance entropy quantifies the smallest average rate of information transmission above which a given compact subset of the state…
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…
Random reshuffling with momentum (RRM) corresponds to the SGD optimizer with momentum option enabled, as found in many machine learning libraries like PyTorch and TensorFlow. Despite its widespread use, the convergence properties of RRM do…
Nonequilibrium processes break time-reversal symmetry and generate entropy. Living systems are driven out-of-equilibrium at the microscopic level of molecular motors that exploit chemical potential gradients to transduce free energy to…
We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the…
We use ergodic theory to prove a quantitative version of a theorem of M. A. Berger and Y. Wang, which relates the joint spectral radius of a set of matrices to the spectral radii of finite products of those matrices. The proof rests on a…
We derive simplified formulas for analyzing the stability of stochastic parametrically forced linear systems. This extends the results in [T. Blass and L.A. Romero, SIAM J. Control Optim. 51(2):1099--1127, 2013] where, assuming the…
We investigate the uniform stability properties of discrete-time linear switched systems subject to arbitrary switching, focusing on the "marginally unstable" regime in which the system is not Lyapunov stable but in which trajectories…
We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…
Time bounded reachability is a fundamental problem in model checking continuous-time Markov chains (CTMCs) and Markov decision processes (CTMDPs) for specifications in continuous stochastic logics. It can be computed by numerically solving…
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…
We revisit the problem of computing submatrices of the Cram\'er-Rao bound (CRB), which lower bounds the variance of any unbiased estimator of a vector parameter $\vth$. We explore iterative methods that avoid direct inversion of the Fisher…
We obtain nonasymptotic bounds on the spectral norm of random matrices with independent entries that improve significantly on earlier results. If $X$ is the $n\times n$ symmetric matrix with $X_{ij}\sim N(0,b_{ij}^2)$, we show that…
This article presents an extended algorithm for computing the lower spectral radius of finite, non-negative matrix sets. Given a set of matrices $\mathcal{F} = \{A_1, \ldots, A_m\}$, the lower spectral radius represents the minimal growth…
This work presents several improvements to the closed-loop stability verification framework using semialgebraic sets and convex semidefinite programming to examine neural-network-based control systems regulating nonlinear dynamical systems.…
This paper introduces a novel approach to evaluating the asymptotic stability of equilibrium points in both continuous-time (CT) and discrete-time (DT) nonlinear autonomous systems. By utilizing indirect Lyapunov methods and linearizing…
I consider multipartite processes in which there are constraints on each subsystem's rate matrix, restricting which other subsystems can directly affect its dynamics. I derive a strictly nonzero lower bound on the minimal achievable entropy…
We describe new methods for deciding the stability of switching systems. The methods build on two ideas previously appeared in the literature: the polytope norm iterative construction, and the lifting procedure. Moreover, the combination of…
This paper aims to develop the stability theory for singular stochastic Markov jump systems with state-dependent noise, including both continuous- and discrete-time cases. The sufficient conditions for the existence and uniqueness of a…
We expose a functional integration method for the averaging of continuous products $\hat{P}_t$ of $N\times N$ random matrices. As an application, we compute exactly the statistics of the Lyapunov spectrum of $\hat{P}_t$. This problem is…