We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination, that is...
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...
Abstract—We present a motion planning algorithm that computes rough trajectories used by a contact-points planner as a guide to grow its search graph. We adapt collision-free mot...
In this paper we present various algorithms both for stability and performance analysis of discrete-time Piece-Wise Affine (PWA) systems. For stability, different classes of Lyapu...
Giancarlo Ferrari-Trecate, Francesco Alessandro Cu...
We consider the problem of numerical stability and model density growth when training a sparse linear model from massive data. We focus on scalable algorithms that optimize certain...