A proximal-proximal majorization-minimization algorithm for nonconvex tuning-free robust regression problems

Tang, Peipei; Wang, Chengjing; Jiang, Bo

doi:10.48550/arxiv.2106.13683

Cited by 1 publication

(2 citation statements)

References 30 publications

(45 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The initial value for x l+1 J l+1 is set to 0. Taking into account of numerical rounding errors, we define the number of nonzero elements of a vector x ∈ IR p and the index set of nonzero components of x as follows (see [26,Page 17])…”

Section: Test Problemsmentioning

confidence: 99%

“…To summarize, the above recent efforts have been devoted to dealing with small scale cases, i.e., the ldr-lasso problem. In terms of solving the hdr lasso problem, very recently, Tang et al [26] applied a proximal-proximal majorization-minimization algorithm. It can be seen from the numerical results that this method can efficiently solve the hdr lasso problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem

Bai¹,

Li²

2022

Preprint

View full text Add to dashboard Cite

The high-dimensional rank lasso (hdr lasso) model is an efficient approach to deal with high-dimensional data analysis. It was proposed as a tuning-free robust approach for the high-dimensional regression and was demonstrated to enjoy several statistical advantages over other approaches. The hdr lasso problem is essentially an L 1 -regularized optimization problem whose loss function is Jaeckel's dispersion function with Wilcoxon scores. Due to the nondifferentiability of the above loss function, many classical algorithms for lasso-type problems are unable to solve this model. In this paper, inspired by the adaptive sieving strategy for the exclusive lasso problem [23], we propose an adaptive-sieving-based algorithm to solve the hdr lasso problem. The proposed algorithm makes full use of the sparsity of the solution. In each iteration, a subproblem with the same form as the original model is solved, but in a much smaller size. We apply the proximal point algorithm to solve the subproblem, which fully takes advantage of the two nonsmooth terms. Extensive numerical results demonstrate that the proposed algorithm (AS-PPA) is robust for different types of noises, which verifies the attractive statistical property as shown in [22]. Moreover, AS-PPA is also highly efficient, especially for the case of high-dimensional features, compared with other methods.

show abstract

Section: Test Problemsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%