On decomposing the proximal map

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Yu, Yaoliang ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLOSED FORM; COMPLICATED FUNCTIONS; HIGH-DIMENSIONAL PROBLEMS; SUMMANDS;

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

References (23)

1. Bernhard Scholköpf and Alexander J. Smola. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press, 2001.
2. Peter Bühlmann and Sara van de Geer. Statistics for High-Dimensional Data. Springer, 2011.
3. Patrick L. Combettes and Valérie R. Wajs. Signal recovery by proximal forward-backward splitting. Multiscale Modeling and Simulation, 4(4):1168-1200, 2005.
4. Amir Beck and Marc Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM Journal on Imaging Sciences, 2(1):183-202, 2009.
5. Yurii Nesterov. Gradient methods for minimizing composite functions. Mathematical Programming, Series B, 140:125-161, 2013.
6. Jerome Friedman, Trevor Hastie, Holger Höfling, and Robert Tibshirani. Pathwise coordinate optimization. The Annals of Applied Statistics, 1(2):302-332, 2007.
7. Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski, and Francis Bach. Proximal methods for hierarchical sparse coding. Journal of Machine Learning Research, 12:2297-2334, 2011.
8. Jiayu Zhou, Jun Liu, Vaibhav A. Narayan, and Jieping Ye. Modeling disease progression via fused sparse group lasso. In Conference on Knowledge Discovery and Data Mining, 2012.
9. Francesco Dinuzzo and Bernhard Schölkopf. The representer theorem for Hilbert spaces: a necessary and sufficient condition. In NIPS, 2012.
10. Yao-Liang Yu, Hao Cheng, Dale Schuurmans, and Csaba Szepesvári. Characterizing the representer theorem. In ICML, 2013.
11. Jean J. Moreau. Proximité et dualtité dans un espace Hilbertien. Bulletin de la Société Mathématique de France, 93:273-299, 1965.
12. Patrick L. Combettes, Dinh Dũng, and Bǎ́ng Công Vũ. Proximity for sums of composite functions. Journal of Mathematical Analysis and Applications, 380(2):680-688, 2011.
13. André F. T. Martins, Noah A. Smith, Eric P. Xing, Pedro M. Q. Aguiar, and Mário A. T. Figueiredo. Online learning of structured predictors with multiple kernels. In Conference on Artificial Intelligence and Statistics, 2011.
14. Patrick L. Combettes and Jean-Christophe Pesquet. Proximal thresholding algorithm for minimization over orthonormal bases. SIAM Journal on Optimization, 18(4):1351-1376, 2007.
15. Yaoliang Yu. Fast Gradient Algorithms for Stuctured Sparsity. PhD thesis, University of Alberta, 2013.
16. Heinz H. Bauschke, Rafal Goebel, Yves Lucet, and Xianfu Wang. The proximal average: Basic theory. SIAM Journal on Optimization, 19(2):766-785, 2008.
17. Hui Zou and Trevor Hastie. Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society B, 67:301-320, 2005.
18. Art B. Owen. A robust hybrid of lasso and ridge regression. In Prediction and Discovery, pages 59-72. AMS, 2007.
19. V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky. The convex geometry of linear inverse problems. Foundations of Computational Mathematics, 12(6):805-849, 2012.
20. Xinhua Zhang, Yaoliang Yu, and Dale Schuurmans. Polar operators for structured sparse estimation. In NIPS, 2013.
21. Howard Bondell and Brian Reich. Simultaneous regression hrinkage, variable selection, and supervised clustering of predictors with oscar. Biometrics, 64(1):115-123, 2008.
22. Leon Wenliang Zhong and James T. Kwok. Efficient sparse modeling with automatic feature grouping. In ICML, 2011.
23. John Duchi and Yoram Singer. Efficient online and batch learning using forward backward splitting. Journal of Machine Learning Research, 10:2899-2934, 2009.