Related papers: Decomposition Method for Lipschitz Stability of Ge…
Many studies have been carried out in order to increase the search efficiency of constraint satisfaction problems; among them, some make use of structural properties of the constraint network; others take into account semantic properties of…
This paper aims to provide various applications for second-order variational analysis of extended-real-valued piecewise liner functions recently obtained in [1]. We mainly focus here on establishing relationships between full stability of…
The Lasso is a prominent algorithm for variable selection. However, its instability in the presence of correlated variables in the high-dimensional setting is well-documented. Although previous research has attempted to address this issue…
When solving rank-deficient or discrete ill-posed problems by regularization methods, the choice of the regularization parameter is crucial. It is also of interest, the regularization norm used in the selection of the solution. In this…
Beside the minimization of the prediction error, two of the most desirable properties of a regression scheme are stability and interpretability. Driven by these principles, we propose continuous-domain formulations for one-dimensional…
The Lipschitz constant of the map between the input and output space represented by a neural network is a natural metric for assessing the robustness of the model. We present a new method to constrain the Lipschitz constant of dense deep…
We establish interior Lipschitz regularity for continuous viscosity solutions of fully nonlinear, conformally invariant, degenerate elliptic equations. As a by-product of our method, we also prove a weak form of the strong comparison…
Using uniform global Carleman estimates for discrete elliptic and semi-discrete hyperbolic equations, we study Lipschitz and logarithmic stability for the inverse problem of recovering a potential in a semi-discrete wave equation,…
The analysis of gradient descent-type methods typically relies on the Lipschitz continuity of the objective gradient. This generally requires an expensive hyperparameter tuning process to appropriately calibrate a stepsize for a given…
Answering a question left open in \cite{MZ2}, we show for general symmetric hyperbolic boundary problems with constant coefficients, including in particular systems with characteristics of variable multiplicity, that the uniform Lopatinski…
This paper analyzes the Lipschitz behavior of the feasible set in two parametric settings, associated with linear and convex systems in R^n. To start with, we deal with the parameter space of linear (finite/semi-infinite) systems identified…
In this paper, we focus on the rapid boundary stabilization of 1D nonlinear parabolic equations via the modal decomposition method. The nonlinear term is assumed to satisfy certain local Lipschitz continuity and global growth conditions.…
This paper presents two direct parameterizations of stable and robust linear parameter-varying state-space (LPV-SS) models. The model parametrizations guarantee a priori that for all parameter values during training, the allowed models are…
The Lipschitz constant is a key measure for certifying the robustness of neural networks to input perturbations. However, computing the exact constant is NP-hard, and standard approaches to estimate the Lipschitz constant involve solving a…
We consider the Vlasov--Poisson system both in the repulsive (electrostatic potential) and in the attractive (gravitational potential) cases. In our first main theorem, we prove the uniqueness and the quantitative stability of Lagrangian…
Recently there were proposed some innovative convex optimization concepts, namely, relative smoothness [1] and relative strong convexity [2,3]. These approaches have significantly expanded the class of applicability of gradient-type methods…
Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…
We propose a generalized debiased Lasso estimator based on a stability principle. When a single column of the design matrix is perturbed, the estimator admits a simple update formula that can be computed from the original solution. Under…
In this paper we consider the stability for a type of stochastic McKean-Vlasov equations with non-Lipschitz coefficients. First, sufficient conditions are given for the exponential stability of the second moments for their solutions in…
In this paper local Lipschitz regularity of weak solutions to certain singular elliptic equations involving one-Laplacian is studied. Equations treated here also contains another well-behaving elliptic operator such as $p$-Laplacian with…