Multi-Task Learning STAP via Spatial Smoothness and Group Sparsity Regularizations

Abstract

In practical applications, limited independent and identically distributed training snapshots brings a serious challenge in space-time adaptive processing (STAP), especially in the nonhomogeneous environments. Motivated by the significant spatial smoothness and sparsity commonality of weight vectors among related STAP tasks, we propose a novel STAP algorithm based on multi-task learning. In the proposed algorithm, the weight vectors corresponding to neighboring range bins of interest are kept consistent, and all weight vectors are constrained to share a common feature. Then, an alternating direction method of multipliers (ADMM) is used to solve the proposed algorithm, and the convergence of the algorithm is guaranteed. In addition, in case that the feature matrix is unknown or we want to learn a better feature matrix so that the associations among STAP tasks can be enhanced, we also provide an extension of the proposed algorithm to jointly optimize the feature matrix and weight matrix. Simulation results demonstrate the effectiveness of the proposed strategies.

Keywords

• ADMM
• convex optimization
• group-sparsity
• multi-task learning
• STAP