An Exact Solution Path Algorithm for SLOPE and Quasi-Spherical OSCAR

10/29/2020
by   Shunichi Nomura, et al.
0

Sorted L_1 penalization estimator (SLOPE) is a regularization technique for sorted absolute coefficients in high-dimensional regression. By arbitrarily setting its regularization weights λ under the monotonicity constraint, SLOPE can have various feature selection and clustering properties. On weight tuning, the selected features and their clusters are very sensitive to the tuning parameters. Moreover, the exhaustive tracking of their changes is difficult using grid search methods. This study presents a solution path algorithm that provides the complete and exact path of solutions for SLOPE in fine-tuning regularization weights. A simple optimality condition for SLOPE is derived and used to specify the next splitting point of the solution path. This study also proposes a new design of a regularization sequence λ for feature clustering, which is called the quasi-spherical and octagonal shrinkage and clustering algorithm for regression (QS-OSCAR). QS-OSCAR is designed with a contour surface of the regularization terms most similar to a sphere. Among several regularization sequence designs, sparsity and clustering performance are compared through simulation studies. The numerical observations show that QS-OSCAR performs feature clustering more efficiently than other designs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/16/2020

Efficient Path Algorithms for Clustered Lasso and OSCAR

In high dimensional regression, feature clustering by their effects on o...
research
04/24/2014

Solution Path Clustering with Adaptive Concave Penalty

Fast accumulation of large amounts of complex data has created a need fo...
research
01/06/2019

Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization

Convex clustering is a promising new approach to the classical problem o...
research
01/06/2019

Dynamic Visualization and Fast Computation for Convex Clustering and Bi-Clustering

Convex clustering is a promising new approach to the classical problem o...
research
02/23/2014

Path Thresholding: Asymptotically Tuning-Free High-Dimensional Sparse Regression

In this paper, we address the challenging problem of selecting tuning pa...
research
07/10/2019

Sparse Unit-Sum Regression

This paper considers sparsity in linear regression under the restriction...
research
09/03/2015

Bayesian Masking: Sparse Bayesian Estimation with Weaker Shrinkage Bias

A common strategy for sparse linear regression is to introduce regulariz...

Please sign up or login with your details

Forgot password? Click here to reset