Generalized Iterative Thresholding for Sparsity-Aware Online Volterra System Identification
نویسندگان
چکیده
The present paper explores the link between thresholding, one of the key enablers in sparsity-promoting algorithms, and Volterra system identification in the context of time-adaptive or online learning. A connection is established between the recently developed generalized thresholding operator and optimization theory via the concept of proximal mappings which are associated with non-convex penalizing functions. Based on such a variational analytic ground, two iterative thresholding algorithms are provided for the sparsity-cognizant Volterra system identification task: (i) a set theoretic estimation one by using projections onto hyperslabs, and (ii) a Landweber-type one. Numerical experimentation is provided to validate the proposed algorithms with respect to state-ofthe-art, sparsity-aware online learning techniques.
منابع مشابه
Generalized Thresholding Sparsity-Aware Online Learning in a Union of Subspaces
This paper studies a non-convexly constrained, sparse inverse problem in time-varying environments from a set theoretic estimation perspective. A new theory is developed that allows for the incorporation, in a unifying way, of different thresholding rules to promote sparsity, that may be even related to non-convex penalty functions. The resulted generalized thresholding operator is embodied in ...
متن کاملLinear convergence of iterative soft-thresholding
In this article, the convergence of the often used iterative softthresholding algorithm for the solution of linear operator equations in infinite dimensional Hilbert spaces is analyzed in detail. We formulate the algorithm in the framework of generalized gradient methods and present a new convergence analysis. The analysis bases on new techniques like the Bregman-Taylor distance. As main result...
متن کاملA Convergent Iterative Hard Thresholding for Nonnegative Sparsity Optimization
The iterative hard thresholding (IHT) algorithm is a popular greedy-type method in (linear and nonlinear) compressed sensing and sparse optimization problems. In this paper, we give an improved iterative hard thresholding algorithm for solving the nonnegative sparsity optimization (NSO) by employing the Armijo-type stepsize rule, which automatically adjusts the stepsize and support set and lead...
متن کاملSparse Covariance Matrix Estimation With Eigenvalue Constraints.
We propose a new approach for estimating high-dimensional, positive-definite covariance matrices. Our method extends the generalized thresholding operator by adding an explicit eigenvalue constraint. The estimated covariance matrix simultaneously achieves sparsity and positive definiteness. The estimator is rate optimal in the minimax sense and we develop an efficient iterative soft-thresholdin...
متن کاملSparsity-Aware Adaptive Algorithms Based on Alternating Optimization with Shrinkage
This letter proposes a novel sparsity-aware adaptive filtering scheme and algorithms based on an alternating optimization strategy with shrinkage. The proposed scheme employs a two-stage structure that consists of an alternating optimization of a diagonally-structured matrix that speeds up the convergence and an adaptive filter with a shrinkage function that forces the coefficients with small m...
متن کامل