Online submodular minimization for combinatorial structures

Proceedings of the 28th International Conference on Machine Learning, ICML 2011

Volumn , Issue , 2011, Pages 345-352

  Jegelka, Stefanie ^a   Bilmes, Jeff ^b  

^a MAX PLANCK INSTITUTE FOR INTELLIGENT SYSTEMS   (Germany)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL STRUCTURES; NON-SEPARABILITY; NONSEPARABLE; ONLINE DECISION PROBLEM; OPTIMIZATION PROBLEMS; SUBMODULAR;

LEARNING SYSTEMS;

APPROXIMATION ALGORITHMS;

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

References (32)

1. Atamtürk, A. and Narayanan, V. Polymatroids and meanrisk minimization in discrete optimization. Operations Research Letters, 36(5):618-622, 2008.
2. Awerbuch, B. and Kleinberg, R. D. Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In Proc. of the ACM Symp. on Theory of Computing (STOC), 2004.
3. Balcan, M. F. and Blum, A. Approximation algorithms and online mechanisms for item pricing. Theory of Computing, 3(9):179-195, 2007.
4. Calinescu, G., Kapoor, S., Olshevsky, A., and Zelikovsky, A. Network lifetime and power assignment in ad hoc wireless networks. In Proc. of the European Symp. on Algorithms (ESA), 2003.
5. Cesa-Bianchi, N. and Lugosi, G. Combinatorial bandits. In Proc. of the Int. Conf. on Learning Theory (COLT), 2009.
6. Edmonds, J. Combinatorial Structures and their Applications, chapter Submodular functions, matroids and certain polyhedra, pp. 69-87. Gordon and Breach, 1970.
7. Fujishige, S. Submodular Functions and Optimization. Number 58 in Annals of Discrete Mathematics. Elsevier Science, 2nd edition, 2005.
8. Goel, G., Karande, C., Tripati, P., and Wang, L. Approximability of combinatorial problems with multi-agent submodular cost functions. In Proc. of the Ann. Symp. on Foundations of Computer Science (FOCS), 2009.
9. Goemans, M. X., Harvey, N. J. A., Iwata, A., and Mirrokni, V. S. Approximating submodular functions everywhere. In Proc. of the ACM-SIAM Symp. on Discrete Algorithms (SODA), 2009.
10. Golovin, D. and Krause, A. Adaptive submodularity: A new approach to active learning and stochastic optimization. In Proc. of the Int. Conf. on Learning Theory (COLT), 2010.
11. Hannan, J. Approximation to Bayes risk in repeated play. In Contributions to the Theory of Games, volume III. 1957.
12. Hassin, R., Monnot, J., and Segev, D. Approximation algorithms and hardness results for labeled connectivity problems. Journal of Combinatorial Optimization, 14 (4):437-453, 2007. (Pubitemid 47507472)
13. Hazan, E. and Kale, S. Online submodular minimization. In Proc. of the Ann. Conf. on Neural Information Processing Systems (NIPS), 2009.
14. Iwata, S. and Nagano, K. Submodular function minimization under covering constraints. In Proc. of the Ann. Symp. on Foundations of Computer Science (FOCS), 2009.
15. Jegelka, S. and Bilmes, J. Submodularity beyond submodular energies: coupling edges in graph cuts. In Proc. of the IEEE Conf. on Computer Vision and Pattern recognition (CVPR), 2011a.
16. Jegelka, S. and Bilmes, J. Approximate inference via generalized graph cuts. In Proc. of the Int. Conf. on Machine Learning (ICML), 2011b.
17. Jha, S., Sheyner, O., and Wing, J.M. Two formal analyses of attack graphs. In Proc. of the 15th Computer Security Foundations Workshop, pp. 49-63, 2002.
18. Kakade, S., Kalai, A. T., and Ligett, K. Playing games with approximation algorithms. SIAM Journal on Computing, 39(3):1088-1106, 2009.
19. Kalai, A.T. and Vempala, S. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71:26-40, 2005.
20. Koolen, W.M., Warmuth, M. K., and Kivinen, J. Hedging structured concepts. In Proc. of the Int. Conf. on Learning Theory (COLT), 2010.
21. Koufogiannakis, C. and Young, N. E. Greedy Δ-approximation algorithm for covering with arbitrary constraints and submodular costs. In Proc. of the Int. Colloquium on Automata, Languages and Programming (ICALP), 2009.
22. Lawler, E. L. and Martel, C. U. Computing maximal " Polymatroidal" network flows. Mathematics of Operations Research, 7(3):334-347, 1982.
23. Lovász, L. Mathematical programming - The State of the Art, chapter Submodular Functions and Convexity, pp. 235-257. Springer, 1983.
24. Lugosi, G., Papaspiliopoulos, O., and Stoltz, G. Online multi-task learning with hard constraints. In Proc. of the Int. Conf. on Learning Theory (COLT), 2009.
25. Monnot, J. The labeled perfect matching in bipartite graphs. Information Processing Letters, 96:81-88, 2005. (Pubitemid 41260461)
26. Streeter, M. and Golovin, D. An online algorithm for maximizing submodular functions. In Proc. of the Ann. Conf. on Neural Information Processing Systems (NIPS), 2008.
27. Streeter, M., Golovin, D., and Krause, A. Online learning of assignments. In Proc. of the Ann. Conf. on Neural Information Processing Systems (NIPS), 2009.
28. Supplement. http://ssli.ee.washington.edu/~jegelka/icml/online.pdf.
29. Wolsey, L. An analysis of the greedy set cover algorithm for the submodular set covering problem. Combinatorica, 2 (4), 1982.
30. Yuan, S., Varma, S., and Jue, J. P. Minimum-color path problems for reliability in mesh networks. In Proc. of the IEEE Int. Conf. on Computer Communications (INFOCOM), 2005.
31. Zhang, P., J.-Y, Cai, Tang, L.-Q., and Zhao, W.-B. Approximation and hardness results for label cut and related problems. Journal of Combinatorial Optimization, 2009.
32. Zinkevich, M. Online convex programming and infinitesimal gradient ascent. In Proc. of the Int. Conf. on Machine Learning (ICML), 2003.