Random coordinate descent methods for minimizing decomposable submodular functions

32nd International Conference on Machine Learning, ICML 2015

Volumn 1, Issue , 2015, Pages 787-795

  Ene, Alina ^a   Nguyen, Huy L ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER VISION; CONVEX OPTIMIZATION; LEARNING SYSTEMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

ALTERNATING PROJECTION METHOD; CONVEX OPTIMIZATION TECHNIQUES; COORDINATE DESCENT METHODS; DIMENSIONAL VECTORS; LINEAR CONVERGENCE RATE; OPTIMIZATION PROBLEMS; SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS;

ITERATIVE METHODS;

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

References (19)

1. Bach, Francis. Learning with submodular functions: A convex optimization perspective. ArXiv preprint arXiv:l 111.6453, 2011.
2. Fercoq, Olivier and Richtarik, Peter. Accelerated, parallel and proximal coordinate descent. ArXiv preprint arXiv.1312.5799, 2013.
3. Fleischer, Lisa and Iwata, Satoru. A push-relabel framework for submodular function minimization and applications to parametric optimization. Discrete Applied Mathematics, 131(2):311-322, 2003.
4. Grotschel, Martin, Lovasz, Laszlo, and Schrijver, Alexander. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2): 169-197, 1981.
5. Iwata, Satoru. A faster scaling algorithm for minimizing submodular functions. S1AM Journal on Computing, 32 (4):833-840, 2003.
6. Jegelka, Stefanie and Bilmes, Jeff. Submodularity beyond submodular energies: coupling edges in graph cuts. In Computer Vision and Pattern Recognition (CVPR), pp. 1897-1904. IEEE, 2011.
7. Jegelka, Stefanie, Bach, Francis, and Sra, Suvrit. Reflection methods for user-friendly submodular optimization. In Advances in Neural Information Processing Systems (NIPS), pp. 1313-1321,2013.
8. Kolmogorov, Vladimir. Minimizing a sum of submodular functions. Discrete Applied Mathematics, 160(15): 2246-2258, 2012.
9. Lovasz, Laszlo. Submodular functions and convexity. In Mathematical Programming The State of the Art, pp. 235-257. Springer, 1983.
10. Nesterov, Yurii. Introductory lectures on convex optimization: A basic course, volume 87. Springer, 2004.
11. Nesterov, Yurii. Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM Journal on Optimization, 22(2):341-362, 2012.
12. Nishihara, Robert, Jegelka, Stefanie, and Jordan, Michael I. On the convergence rate of decomposable submodular function minimization. In Advances in Neural Information Processing Systems (NIPS), pp. 640-648, 2014a.
13. Nishihara, Robert, Jegelka, Stefanie, and Jordan, Michael I. On the convergence rate of decomposable submodular function minimization. ArXiv preprint arXiv: 1406.6474, 2014b.
14. Orlin, James B. A faster strongly polynomial time algorithm for submodular function minimization. Mathematical Programming, 118(2):237-251, 2009.
15. Rockafellar, R Tyrrell. Convex analysis. Number 28 in Princeton Mathematical Series. Princeton university press, 1970.
16. Rother, Carsten, Kolmogorov, Vladimir, and Blake, Andrew. Grabcut: Interactive foreground extraction using iterated graph cuts. ACM Transactions on Graphics (TOG), 23(3):309-314, 2004.
17. Schrijver, Alexander. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. Journal of Combinatorial Theory, Series B, 80(2):346-355, 2000.
18. Schrijver, Alexander. Combinatorial optimization: poly-hedra and efficiency, volume 24. Springer Science & Business Media, 2003.
19. Stobbe, Peter and Krause, Andreas. Efficient minimization of decomposable submodular functions. In Advances in Neural Information Processing Systems (NIPS), pp. 2208-2216,2010.