A primal-dual algorithm for group sparse regularization with overlapping groups

Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010, NIPS 2010

Volumn , Issue , 2010, Pages

  Mosci, Sofia ^a   Villa, Silvia ^a   Verri, Alessandro ^a   Rosasco, Lorenzo ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b Department of Architecture   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

DATA DUPLICATION; DUAL SPACES; GROUP LASSOS; GROUP SPARSE REGULARIZATIONS; OPTIMIZATION PROCEDURES; OVERLAPPING GROUPS; PRIMAL-DUAL ALGORITHMS; PROJECTED NEWTON METHODS; PROXIMAL METHODS; VARIABLES SELECTIONS;

NEWTON-RAPHSON METHOD;

EID: 85161965237     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. F. Bach. Consistency of the group lasso and multiple kernel learning. Journal of Machine Learning Research, 9:1179-1225, 2008.
2. F. Bach. High-dimensional non-linear variable selection through hierarchical kernel learning. Technical Report HAL 00413473, INRIA, 2009.
3. F. R. Bach, G. Lanckriet, and M. I. Jordan. Multiple kernel learning, conic duality, and the smo algorithm. In ICML, volume 69 of ACM International Conference Proceeding Series, 2004.
4. A. Beck and Teboulle. M. Fast gradient-based algorithms for constrained total variation image denoising and deblurring problems. IEEE Transactions on Image Processing, 18(11):2419-2434, 2009.
5. A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci., 2(1):183-202, 2009.
6. S. Becker, J. Bobin, and E. Candes. Nesta: A fast and accurate first-order method for sparse recovery, 2009.
7. D. Bertsekas. Projected newton methods for optimization problems with simple constraints. SIAM Journal on Control and Optimization, 20(2):221-246, 1982.
8. R. Brayton and J. Cullum. An algorithm for minimizing a differentiable function subject to. J. Opt. Th. Appl., 29:521-558, 1979.
9. J. Duchi and Y. Singer. Efficient online and batch learning using forward backward splitting. Journal of Machine Learning Research, 10:28992934, December 2009.
10. O. Guler. New proximal point algorithm for convex minimization. SIAM J. on Optimization, 2(4):649-664, 1992.
11. E. T. Hale, W. Yin, and Y. Zhang. Fixed-point continuation for l1-minimization: Methodology and convergence. SIOPT, 19(3):1107-1130, 2008.
12. L. Jacob, G. Obozinski, and J.-P. Vert. Group lasso with overlap and graph lasso. In ICML, page 55, 2009.
13. R. Jenatton, J.-Y. Audibert, and F. Bach. Structured variable selection with sparsity-inducing norms. Technical report, INRIA, 2009.
14. R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In Proceeding of ICML 2010, 2010.
15. 1-penalized functionals. Inverse Problems, 25(3):035008, 16, 2009.
16. L. Meier, S. van de Geer, and P. Buhlmann. The group lasso for logistic regression. J. R. Statist. Soc, B(70):53-71, 2008.
17. S. Mosci, S. Villa, Verri A., and L. Rosasco. A fast algorithm for structured gene selection. presented at MLSB 2010, Edinburgh.
18. 2). Doklady AN SSSR, 269(3):543-547, 1983.
19. Y. Nesterov. Smooth minimization of non-smooth functions. Math. Prog. Series A, 103(1):127-152, 2005.
20. M. Y. Park and T. Hastie. L1-regularization path algorithm for generalized linear models. J. R. Statist. Soc. B, 69:659-677, 2007.
21. L. Rosasco, M. Mosci, S. Santoro, A. Verri, and S. Villa. Iterative projection methods for structured sparsity regularization. Technical Report MIT-CSAIL-TR-2009-050, MIT, 2009.
22. J. Rosen. The gradient projection method for nonlinear programming, part i: linear constraints. J. Soc. Ind. Appl. Math., 8:181-217, 1960.
23. V. Roth and B. Fischer. The group-lasso for generalized linear models: uniqueness of solutions and efficient algorithms. In Proceedings of 25th ICML, 2008.
24. P. Zhao, G. Rocha, and B. Yu. The composite absolute penalties family for grouped and hierarchical variable selection. Annals of Statistics, 37(6A):3468-3497, 2009.