An $O(n\log(n))$ Algorithm for Projecting Onto the Ordered Weighted $\ell_1$ Norm Ball
نویسنده
چکیده
The ordered weighted `1 (OWL) norm is a newly developed generalization of the Octogonal Shrinkage and Clustering Algorithm for Regression (OSCAR) norm. This norm has desirable statistical properties and can be used to perform simultaneous clustering and regression. In this paper, we show how to compute the projection of an n-dimensional vector onto the OWL norm ball in O(n log(n)) operations. In addition, we illustrate the performance of our algorithm on a synthetic regression test.
منابع مشابه
An O(nlog(n)) Algorithm for Projecting Onto the Ordered Weighted ℓ1 Norm Ball
The ordered weighted `1 (OWL) norm is a newly developed generalization of the Octogonal Shrinkage and Clustering Algorithm for Regression (OSCAR) norm. This norm has desirable statistical properties and can be used to perform simultaneous clustering and regression. In this paper, we show how to compute the projection of an n-dimensional vector onto the OWL norm ball in O(n log(n)) operations. I...
متن کاملAn $\mathcal{O}(n\log n)$ projection operator for weighted $\ell_1$-norm regularization with sum constraint
We provide a simple and efficient algorithm for the projection operator for weighted l1-norm regularization subject to a sum constraint, together with an elementary proof. The implementation of the proposed algorithm can be downloaded from the author’s homepage. 1 The problem In this report, we consider the following optimization problem: min x 1 2 ‖x− y‖ 2 + n
متن کاملThe Ordered Weighted $\ell_1$ Norm: Atomic Formulation, Projections, and Algorithms
The ordered weighted `1 norm (OWL) was recently proposed, with two different motivations: because of its good statistical properties as a sparsity promoting regularizer, and as generalization of the so-called octagonal shrinkage and clustering algorithm for regression (OSCAR). The OSCAR is a convex groupsparsity inducing regularizer, which does not require the prior specification of the group s...
متن کاملDecreasing Weighted Sorted $\ell_1$ Regularization
We consider a new family of regularizers, termed weighted sorted `1 norms (WSL1), which generalizes the recently introduced octagonal shrinkage and clustering algorithm for regression (OSCAR) and also contains the `1 and `∞ norms as particular instances. We focus on a special case of the WSL1, the decreasing WSL1 (DWSL1), where the elements of the argument vector are sorted in non-increasing or...
متن کاملSome inequalities involving lower bounds of operators on weighted sequence spaces by a matrix norm
Let A = (an;k)n;k1 and B = (bn;k)n;k1 be two non-negative ma-trices. Denote by Lv;p;q;B(A), the supremum of those L, satisfying the followinginequality:k Ax kv;B(q) L k x kv;B(p);where x 0 and x 2 lp(v;B) and also v = (vn)1n=1 is an increasing, non-negativesequence of real numbers. In this paper, we obtain a Hardy-type formula forLv;p;q;B(H), where H is the Hausdor matrix and 0 < q p 1. Also...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015