18 September 2020 in IEEE Transactions on Cybernetics
This article develops an identification algorithm for nonlinear systems. Specifically, the nonlinear system identification problem is formulated as a sparse recovery problem of a homogeneous variant searching for the sparsest vector in the null subspace. An augmented Lagrangian function is utilized to relax the nonconvex optimization. Thereafter, an algorithm based on the alternating direction method and a regularization technique is proposed to solve the sparse recovery problem. The convergence of the proposed algorithm can be guaranteed through theoretical analysis. Moreover, by the proposed sparse identification method, redundant terms in nonlinear functional forms are removed and the computational efficiency is thus substantially enhanced. Numerical simulations are presented to verify the effectiveness and superiority of the present algorithm.
6 May 2022 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Sparse representation has been widely applied to image classification, where the key issue is to extract a suitable discriminative dictionary. To this end, we propose a joint dictionary and classifier learning algorithm based on a parameterized Bayesian model. Therein, the Gaussian priors of a dictionary endow it with the capability of discrimination and representation. Moreover, we introduce a multivariate Gaussian prior for the sparse codes to achieve group sparsity, thereby substantially improving the classification performance. Furthermore, the sparse codes are estimated by a group-sparse Bayesian learning (GSBL) method, and the dictionary atoms are updated sequentially by maximizing a posterior. Moreover, to avoid manual parameter adjustment, the hyperparameters are optimized by an evidence maximization method. Accordingly, we develop a classification scheme via GSBL. Finally, extensive experiments are conducted on six benchmark datasets of face classification, object recognition, handwritten recognition, and scene categorization to substantiate the effectiveness and superiority of the proposed method.
18 September 2023 in IEEE Transactions on Signal Processing
In this paper, we consider a broad class of nonconvex and nonsmooth composition optimization problems that can be used to model many applications in signal processing and image processing, such as sparse signal recovery and image restoration. However, due to the nonconvex nonsmooth properties of the objective function, solving this class of problems using classical methods like alternating minimization will face challenges in theoretical analysis and numerical calculation. For this, we propose a proximal alternating partially linearized minimization (PAPLM) algorithm by linearizing the nonconvex term and combining it with the traditional proximal algorithm. This algorithm enjoys simple and well-defined updates. By leveraging the Kurdyka-Łojasiewicz property, we prove that any sequence generated by the PAPLM algorithm globally converges to a critical point of the objective function under weaker assumptions. Numerical experiments on perturbed compressed sensing problems suggest that the proposed algorithm can achieve superior performance.
17 September 2025 in IEEE Transactions on Consumer Electronics
Unmanned systems are advancing rapidly, driving widespread attention to multi-agent systems composed of clustered consumer electronic devices. Accurately and timely estimating component states of multi-agent systems during signal transmission is critical for performance. However, existing studies primarily focus on observability in scalar-weighted networks, neglecting matrix-weighted alternatives. These matrix-weighted networks provide greater structural complexity and enhanced modeling capabilities for real-world discrete-time communication models. This paper addresses the observability gap in discrete-time multi-agent systems over matrix-weighted networks, a domain neglected in existing scalar-weighted studies. The observability conditions for systems with fixed weights are first established. The observability criteria are established via spectral decomposition and graph theory, analyzing two eigenvalue distribution cases of the system state matrix. Subsequently, observability criteria for systems with time-varying weights are derived. The criteria are derived using algebraic graph theory, yielding graphical and algebraic conditions based on specific topological configurations. Computational studies validate the effectiveness of the proposed conditions.
17 November 2020 in Communications in Statistics - Theory and Methods
This note presents a unified analysis of the identification of dynamical systems with low-rank constraints under high-dimensional scaling. This identification problem for dynamic systems is challenging due to the intrinsic dependency of the data. To alleviate this problem, we first formulate this identification problem into a multivariate linear regression problem with a row-sub-Gaussian measurement matrix using the more general input designs and the independently repeated sampling schemes. We then propose a nuclear norm heuristic method that estimates the parameter matrix of a dynamic system from a few input-state data samples. Based on this, we can extend the existing results. In this article, we consider two scenarios. (i) In the noiseless scenario, nuclear-norm minimization is introduced for promoting low-rank. We define the notion of weak restricted isometry property, which is weaker than the ordinary restricted isometry property, and show it holds with high probability for the row-sub-Gaussian measurement matrix. Thereby, the rank-minimization matrix can be exactly recovered from a finite number of data samples. (ii) In the noisy scenario, a regularized framework involving the nuclear norm penalty is established. We give the notion of operator norm curvature condition for the loss function and show it holds for the row-sub-Gaussian measurement matrix with high probability. Consequently, when specifying the suitable choice of the regularization parameter, the operator norm error of the optimal solution of this program has a sharp bound given a finite amount of data samples. This operator norm error bound is always smaller than the ordinary Frobenius norm error bound obtained in the existing work.
1 August 2018 in Chaos, Solitons & Fractals