Optimal robust exact first-order differentiators with Lipschitz continuous output
The signal differentiation problem involves the development of algorithms that allow to recover a signal's derivatives from noisy measurements. This paper develops a first-order differentiator with the following combination of properties: robustness to measurement noise, exactness in the absence of noise, optimal worst-case differentiation error, and Lipschitz continuous output where the output's Lipschitz constant is a tunable parameter. This combination of advantageous properties is not shared by any existing differentiator. Both continuous-time and sample-based versions of the differentiator are developed and theoretical guarantees are established for both. The continuous-time version of the differentiator consists in a regularized and sliding-mode-filtered linear adaptive differentiator. The sample-based, implementable version is then obtained through appropriate discretization. An illustrative example is provided to highlight the features of the developed differentiator.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Optimal Robust Exact Differentiation via Linear Adaptive Techniques
The problem of differentiating a function with bounded second derivative in the presence of bounded measurement noise is considered in both continuous-time and sampled-data settings. Fundamental performance limitations o…
Robust exact differentiators with predefined convergence time
The problem of exactly differentiating a signal with bounded second derivative is considered. A class of differentiators is proposed, which converge to the derivative of such a signal within a fixed, i.e., a finite and u…
Minimizing the Homogeneous $\mathcal{L}_2$-Gain of Homogeneous Differentiators
The differentiation of noisy signals using the family of homogeneous differentiators is considered. It includes the high-gain (linear) as well as robust exact (discontinuous) differentiator. To characterize the effect of…
Local Lipschitz Constant Computation of ReLU-FNNs: Upper Bound Computation with Exactness Verification
This paper is concerned with the computation of the local Lipschitz constant of feedforward neural networks (FNNs) with activation functions being rectified linear units (ReLUs). The local Lipschitz constant of an FNN fo…
Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization
We study the deterministic first-order oracle complexity of finding \(ε\)-stationary points in smooth nonconvex optimization when the objective satisfies higher-order smoothness assumptions. While the classical \(ε^{-2}\…