Sparse Reduced Rank Regression With Nonconvex Regularization
원문 초록
In this paper, the estimation problem for sparse reduced rank regression (SRRR) model is considered. The SRRR model is widely used for dimension reduction and variable selection with applications in signal processing, econometrics, etc. The problem is formulated to minimize the least squares loss with a sparsity-inducing penalty considering an orthogonality constraint. Convex sparsity-inducing functions have been used for SRRR in literature. In this work, a nonconvex function is proposed for better sparsity inducing. An efficient algorithm is developed based on the alternating minimization (or projection) method to solve the nonconvex optimization problem. Numerical simulations show that the proposed algorithm is much more efficient compared to the benchmark methods and the nonconvex function can result in a better estimation accuracy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Active Learning for Manifold Gaussian Process Regression
Handling bounded response in high dimensions: a Horseshoe prior Bayesian Beta regression approach
AKRMap: Adaptive Kernel Regression for Trustworthy Visualization of Cross-Modal Embeddings
Bayesian Hybrid Machine Learning of Gallstone Risk
Gradient Boosting for Spatial Regression Models with Autoregressive Disturbances
Learning Treatment Representations for Downstream Instrumental Variable Regression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.