| | |
| | |
Stat |
Members: 3645 Articles: 2'503'724 Articles rated: 2609
23 April 2024 |
|
| | | |
|
Article overview
| |
|
Fast Saddle-Point Algorithm for Generalized Dantzig Selector and FDR Control with the Ordered $ell_1$-Norm | Sangkyun Lee
; Damian Brzyski
; Malgorzata Bogdan
; | Date: |
18 Nov 2015 | Abstract: | In this paper we propose a primal-dual proximal extragradient algorithm to
solve the generalized Dantzig selector (GDS) estimation, based on a new
convex-concave saddle-point (SP) formulation of the GDS and a simple gradient
extrapolation technique. Our reformulation makes it possible to adapt recent
developments in saddle-point optimization, to achieve the optimal $O(1/k)$ rate
of convergence. Compared to the optimal non-SP algorithms, ours do not require
specification of sensitive parameters that affect algorithm performance or
solution quality. We also provide a new analysis showing a possibility of
acceleration in special cases even without strong convexity or strong
smoothness. As an application, we propose a GDS equipped with the ordered
$ell_1$-norm, showing its false discovery rate control properties in variable
selection. Algorithm performance is compared between ours and other
alternatives, including the linearized ADMM, Nesterov’s smoothing, Nemirovski’s
mirror-prox, and the accelerated hybrid proximal extragradient techniques. | Source: | arXiv, 1511.5864 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |