paper-with-me

Papers

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

2020-10-29 · Shunichi Nomura

Sorted $L_1$ penalization estimator (SLOPE) is a regularization technique for sorted absolute coefficients in high-dimensional regression. By arbitrarily setting its regularization weights $\lambda$ 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 $\lambda$ 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.

📄 PDF Abstract BibTeX arXiv:2010.15511

Code (0)

등록된 구현이 없습니다.

Tasks

Clusteringfeature selectionregression

Methods 이 논문이 사용한 방법론

Feature Selection Feature selection, also known as variable selection, attribute selection or variable subset selection, is the process of selecting a subset of relevant features (variables,…

Similar Papers 제목 키워드 기반

Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing

2019-07-17 · NeurIPS 2019 12 · Zhiqi Bu, Jason Klusowski, Cynthia Rush, Weijie Su

SLOPE is a relatively new convex optimization procedure for high-dimensional linear regression via the sorted l1 penalty: the larger the rank of the fitted coefficient, the larger the penalty. This non-separable penalty …

Parallel Quasi-concave set optimization: A new frontier that scales without needing submodularity

2021-08-19 · Praneeth Vepakomma, Yulia Kempner, Ramesh Raskar

Classes of set functions along with a choice of ground set are a bedrock to determine and develop corresponding variants of greedy algorithms to obtain efficient solutions for combinatorial optimization problems. The cla…

Combinatorial OptimizationComputational Efficiency

Nested Model Averaging on Solution Path for High-dimensional Linear Regression

2020-05-16 · Yang Feng, Qing-Feng Liu

We study the nested model averaging method on the solution path for a high-dimensional linear regression problem. In particular, we propose to combine model averaging with regularized estimators (e.g., lasso and SLOPE) o…

regressionVocal Bursts Intensity Prediction

Hybrid Terrain-Aware Path Planning: Integrating VD-RRT* Exploration and VD-D* Lite Repair

2025-10-14 · Akshay Naik, William R. Norris, Dustin Nottage, Ahmet Soylemezoglu arxiv

Autonomous ground vehicles operating off-road must plan curvature-feasible paths while accounting for spatially varying soil strength and slope hazards in real time. We present a continuous state--cost metric that combin…

Slope Consistency of Quasi-Maximum Likelihood Estimator for Binary Choice Models

2025-05-05 · Yoosoon Chang, Joon Y. Park, Guo Yan

This paper revisits the slope consistency of QMLE for binary choice models. Ruud (1983, \emph{Econometrica}) introduced a set of conditions under which QMLE may yield a constant multiple of the slope coefficient of binar…