Structured sparsity-inducing norms through submodular functions

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

Volumn , Issue , 2010, Pages

  Bach, Francis ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; SET THEORY;

CARDINALITIES; CONVEX ENVELOPE; CONVEX OPTIMIZATION PROBLEMS; LINEAR PREDICTORS; LOW BOUND; SELECTION PROBLEMS; SET FUNCTION; SPARSE METHODS; STRUCTURED SPARSITIES; SUBMODULAR FUNCTIONS;

SUPERVISED LEARNING;

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

References (27)

1. P. Zhao, G. Rocha, and B. Yu. Grouped and hierarchical model selection through composite absolute penalties. Annals of Statistics, 37(6A):3468-3497, 2009.
2. R. Jenatton, J.Y. Audibert, and F. Bach. Structured variable selection with sparsity-inducing norms. Technical report, arXiv:0904.3523, 2009.
3. J. Huang, T. Zhang, and D. Metaxas. Learning with structured sparsity. In Proc. ICML, 2009.
4. L. Jacob, G. Obozinski, and J.-P. Vert. Group Lasso with overlaps and graph Lasso. In Proc. ICML, 2009.
5. S. Kimand E. Xing. Tree-guided group Lasso formulti-task regressionwith structured sparsity. In Proc. ICML, 2010.
6. R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for sparse hierarchical dictionary learning. In Proc. ICML, 2010.
7. J. Mairal, R. Jenatton, G. Obozinski, and F. Bach. Network flow algorithms for structured sparsity. In Adv. NIPS, 2010.
8. J. Haupt and R. Nowak. Signal reconstruction from noisy random projections. IEEE Transactions on Information Theory, 52(9):4036-4048, 2006.
9. F Bach. Convex analysis and optimization with submodular functions: a tutorial. Technical Report 00527714, HAL, 2010.
10. A. Krause and C. Guestrin. Near-optimal nonmyopic value of information in graphicalmodels. In Proc. UAI, 2005.
11. Y. Kawahara, K. Nagano, K. Tsuda, and J.A. Bilmes. Submodularity cuts and applications. In Adv. NIPS, 2009.
12. S. Fujishige. Submodular Functions and Optimization. Elsevier, 2005.
13. J. Edmonds. Submodular functions, matroids, and certain polyhedra. In Combinatorial optimization - Eureka, you shrink!, pages 11-26. Springer, 2003.
14. ∞-regularization. In Adv. NIPS, 2008.
15. F. Bach. Structured sparsity-inducing norms through submodular functions. Technical Report 00511310, HAL, 2010.
16. S. P. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
17. R. Jenatton, G. Obozinski, and F. Bach. Structured sparse principal component analysis. In Proc. AISTATS, 2009.
18. R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight. Sparsity and smoothness via the fused Lasso. J. Roy. Stat. Soc. B, 67(1):91-108, 2005.
19. R. A. Horn and C. R. Johnson. Matrix analysis. Cambridge Univ. Press, 1990.
20. T. Ando. Concavity of certain maps on positive definite matrices and applications to hadamard products. Linear Algebra and its Applications, 26:203-241, 1979.
21. C. L. Mallows. Some comments on Cp. Technometrics, 15(4):661-675, 1973.
22. D.Wipf and S. Nagarajan. Sparse estimation using general likelihoods and non-factorial priors. In Adv. NIPS, 2009.
23. A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1):183-202, 2009.
24. A. Chambolle and J. Darbon. On total variation minimization and surface evolution using parametric maximum flows. International Journal of Computer Vision, 84(3):288-307, 2009.
25. S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu. A unified framework for highdimensional analysis of M-estimators with decomposable regularizers. In Adv. NIPS, 2009.
26. P. Zhao and B. Yu. On model selection consistency of Lasso. Journal of Machine Learning Research, 7:2541-2563, 2006.
27. A. Krause and V. Cevher. Submodular dictionary selection for sparse representation. In Proc. ICML, 2010.