On the convergence rate of decomposable submodular function minimization

Advances in Neural Information Processing Systems

Volumn 1, Issue January, 2014, Pages 640-648

  Nishihara, Robert ^a   Jegelka, Stefanie ^a   Jordan, Michael I ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; GRAPH THEORY; INFORMATION SCIENCE; LEARNING SYSTEMS; SIGNAL PROCESSING;

CONVERGENCE RATES; DISCRETE PROBLEMS; RATE OF CONVERGENCE; SPECTRAL GRAPH THEORY; SUBMODULAR; SUBMODULAR FUNCTION MINIMIZATION; SUBMODULAR FUNCTIONS; UPPER AND LOWER BOUNDS;

ALGORITHMS;

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

References (38)

1. F. Bach. Structured sparsity-inducing norms through submodular functions. In Advances in Neural Information Processing Systems, 2011.
2. F. Bach. Learning with submodular functions: A convex optimization perspective. Foundations and Trends in Machine Learning, 6(2-3):145-373, 2013.
3. H. H. Bauschke and J. M. Borwein. On the convergence of von Neumann's alternating projection algorithm for two sets. Set-Valued Analysis, 1(2):185-212, 1993.
4. H. H. Bauschke and J. M. Borwein. Dykstra's alternating projection algorithm for two sets. Journal of Approximation Theory, 79(3):418-443, 1994.
5. H. H. Bauschke and J. M. Borwein. On projection algorithms for solving convex feasibility problems. SIAM Review, 38(3):367-426, 1996.
6. H. H. Bauschke, J. B. Cruz, T. T. Nghia, H. M. Phan, and X. Wang. The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle. Journal of Approximation Theory, 185:63-79, 2014.
7. A. Beck and L. Tetruashvili. On the convergence of block coordinate descent type methods. SIAM Journal on Optimization, 23(4):2037-2060, 2013.
8. J. V. Burke and J. J. Moré. On the identification of active constraints. SIAM Journal on Numerical Analysis, 25(5):1197-1211, 1988.
9. F. R. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
10. F. Deutsch. The method of alternating orthogonal projections. In Approximation Theory, Spline Functions and Applications, pages 105-121. Springer, 1992.
11. F. Deutsch. Best Approximation in Inner Product Spaces, Volume 7. Springer, 2001.
12. F. Deutsch and H. Hundal. The rate of convergence of Dykstra's cyclic projections algorithm: The polyhedral case. Numerical Functional Analysis and Optimization, 15(5-6):537-565, 1994.
13. F. Deutsch and H. Hundal. The rate of convergence for the cyclic projections algorithm I: angles between convex sets. Journal of Approximation Theory, 142(1):36-55, 2006.
14. P. Diaconis, K. Khare, and L. Saloff-Coste. Stochastic alternating projections. Illinois Journal of Mathematics, 54(3):963-979, 2010.
15. J. Edmonds. Combinatorial Structures and Their Applications, chapter Submodular Functions, Matroids and Certain Polyhedra, pages 69-87. Gordon and Breach, 1970.
16. A. Fix, T. Joachims, S. Park, and R. Zabih. Structured learning of sum-of-submodular higher order energy functions. In Int. Conference on Computer Vision (ICCV), 2013.
17. S. Fujishige and S. Isotani. A submodular function minimization algorithm based on the minimum-norm base. Pacific Journal of Optimization, 7:3-17, 2011.
18. R. M. Gray. Toeplitz and circulant matrices: A review. Foundations and Trends in Communications and Information Theory, 2(3):155-239, 2006.
19. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981.
20. L. Gubin, B. Polyak, and E. Raik. The method of projections for finding the common point of convex sets. USSR Computational Mathematics and Mathematical Physics, 7(6):1-24, 1967.
21. I. Halperin. The product of projection operators. Acta Sci. Math. (Szeged), 23:96-99, 1962.
22. D. Hochbaum and V. Singh. An efficient algorithm for co-segmentation. In Int. Conference on Computer Vision (ICCV), 2009.
23. S. Iwata. A faster scaling algorithm for minimizing submodular functions. SIAM J. on Computing, 32: 833-840, 2003.
24. S. Jegelka, H. Lin, and J. Bilmes. On fast approximate sumodular minimization. In Advances in Neural Information Processing Systems, 2011.
25. S. Jegelka, F. Bach, and S. Sra. Reflection methods for user-friendly submodular optimization. In Advances in Neural Information Processing Systems, pages 1313-1321, 2013.
26. R. Jenatton, J. Mairal, G. Obozinski, and F. Bach. Proximal methods for hierarchical sparse coding. JMLR, page 2297-2334, 2011.
27. A. V. Knyazev and M. E. Argentati. Principal angles between subspaces in an A-based scalar product: algorithms and perturbation estimates. SIAM Journal on Scientific Computing, 23(6):2008-2040, 2002.
28. P. Kohli, L. Ladický, and P. Torr. Robust higher order potentials for enforcing label consistency. Int. Journal of Computer Vision, 82, 2009.
29. V. Kolmogorov. Minimizing a sum of submodular functions. Discrete Applied Mathematics, 160(15): 2246-2258, 2012.
30. N. Komodakis, N. Paragios, and G. Tziritas. MRF energy minimization and beyond via dual decomposition. IEEE Trans. Pattern Analysis and Machine Intelligence, 2011.
31. H. Lin and J. Bilmes. Optimal selection of limited vocabulary speech corpora. In Proc. Interspeech, 2011.
32. S. McCormick. Handbook on Discrete Optimization, chapter Submodular Function Minimization, pages 321-391. Elsevier, 2006.
33. M. Narasimhan and J. Bilmes. Local search for balanced submodular clusterings. In IJCAI, pages 981-986, 2007.
34. J. Orlin. A faster strongly polynomial time algorithm for submodular function minimization. Math. Programming, 118:237-251, 2009.
35. P. Stobbe and A. Krause. Efficient minimization of decomposable submodular functions. In Advances in Neural Information Processing Systems, 2010.
36. P. Tseng. Alternating projection-proximal methods for convex programming and variational inequalities. SIAM Journal on Optimization, 7(4):951-965, 1997.
37. S. Vicente, V. Kolmogorov, and C. Rother. Joint optimization of segmentation and appearance models. In Int. Conference on Computer Vision (ICCV), 2009.
38. J. Von Neumann. Functional Operators: The Geometry of Orthogonal Spaces. Princeton University Press, 1950.