Learning submodular functions

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2011, Pages 793-802

  Balcan, Maria Florina ^a   Harvey, Nicholas J A ^b  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

learning theory; matroids; submodular functions

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; ECONOMICS; GAME THEORY; MACHINE LEARNING; MATRIX ALGEBRA; PROBABILITY DISTRIBUTIONS;

ALGORITHMIC GAME THEORY; CONSTANT FACTOR APPROXIMATION; DISTRIBUTIONAL LEARNING; LEARNING THEORY; MULTIPLICATIVE FACTORS; PRODUCT DISTRIBUTIONS; SUBMODULAR FUNCTIONS; UNDERLYING DISTRIBUTION;

LEARNING ALGORITHMS;

EID: 79959757277     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1993636.1993741     Document Type: Conference Paper

References (40)

1. NIPS workshop on discrete optimization in machine learning: Submodularity, sparsity & polyhedra (DISCML), 2009. http://www.discml.cc/.
2. N. Alon and J. Spencer. The Probabilistic Method. Wiley, 2000.
3. K. Amano and A. Maruoka. On learning monotone boolean functions under the uniform distribution. TCS, 350(5):3-12, 2006. (Pubitemid 41817576)
4. M. Anthony and P. Bartlett. Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999.
5. Y. Bakos and E. Brynjolfsson. Bundling information goods: Pricing, profits, and efficiency. Management Science, 45(12), 1999.
6. M. F. Balcan, A. Blum, and Y. Mansour. Item pricing for revenue maxmimization. In ACM EC, 2009.
7. M.-F. Balcan and Nicholas J. A. Harvey. Learning submodular functions, August 2010. arXiv:1008.2159.
8. E. Baum and K. Lang. Query learning can work poorly when a human oracle is used. In IJCNN, 1993.
9. A. Blum, C. Burch, and J. Langford. On learning monotone boolean functions. In FOCS, 1998.
10. S. Boucheron, G. Lugosi, and P. Massart. On concentration of self-bounding functions. Electronic Journal of Probability, 14:1884-1899, 2009.
11. N. H. Bshouty and C. Tamon. On the Fourier spectrum of monotone functions. Journal of the ACM, 43(4):747-770, 1996. (Pubitemid 126582612)
12. C. Chekuri and J. Vondrák. Randomized pipage rounding for matroid polytopes and applications, September 2009. arXiv:0909.4348v1.
13. J. Edmonds. Submodular functions, matroids, and certain polyhedra. In R. Guy, H. Hanani, N. Sauer, and J. Schönheim, editors, Combinatorial Structures and Their Applications, pages 69-87. Gordon and Breach, 1970.
14. S. Fujishige. Submodular Functions and Optimization. Elsevier, 2005.
15. M. Goemans, N. Harvey, S. Iwata, and V. Mirrokni. Approximating submodular functions everywhere. In SODA, 2009.
16. V. Guruswami, C. Umans, and S. P. Vadhan. Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes. Journal of the ACM, 56(4), 2009.
17. M. T. Hajiaghayi, J. H. Kim, T. Leighton, and H. Räcke. Oblivious routing in directed graphs with random demands. In STOC, 2005.
18. W. Hanson and R. K. Martin. Optimal bundle pricing. Management Science, 36(2), 1990.
19. T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, 2009.
20. S. Hoory, N. Linial, and A. Wigderson. Expander graphs and their applications. Bulletin of the AMS, 43:439-561, 2006. (Pubitemid 44448254)
21. S. Janson, T. Łuczak, and A. Ruciński. Random Graphs. Wiley-Interscience, 2000.
22. F. John. Extremum problems with inequalities as subsidiary conditions. In Studies and Essays, presented to R. Courant on his 60th Birthday, January 8, 1948, 1948.
23. M. Kearns and U. Vazirani. An Introduction to Computational Learning Theory. MIT Press, 1994.
24. A. Krause and C. Guestrin. Near-optimal nonmyopic value of information in graphical models. In UAI, 2005.
25. A. Krause and C. Guestrin. Intelligent information gathering and submodular function optimization, 2009. http://submodularity.org/ijcai09/index. html.
26. B. Lehmann, D. J. Lehmann, and N. Nisan. Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior, 55:270-296, 2006. (Pubitemid 43585597)
27. L. Lovász. Submodular functions and convexity. Mathematical Programmming: The State of the Art, 1983.
28. M. Molloy and B. Reed. Graph Colouring and the Probabilistic Method. Springer, 2001.
29. M. Narasimhan and J. Bilmes. Local search for balanced submodular clusterings. In IJCAI, 2007.
30. J. G. Oxley. Matroid Theory. Oxford University Press, 1992.
31. P. Rusmevichientong, B. Van Roy, and P. W. Glynn. A nonparametric approach to multiproduct pricing. Operations Research, 54(1), 2006.
32. A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2004.
33. C. Seshadhri and J. Vondrák. Is submodularity testable? In ICS, 2011.
34. Z. Svitkina and L. Fleischer. Submodular approximation: Sampling-based algorithms and lower bounds. In FOCS, 2008.
35. D. M. Topkis. Supermodularity and Complementarity. Princeton University Press, 1998.
36. S. P. Vadhan. Pseudorandomness I. Foundations and Trends in Theoretical Computer Science. To Appear.
37. L.G. Valiant. A theory of the learnable. Commun. ACM, 27(11):1134-1142, 1984.
38. V. N. Vapnik. Statistical Learning Theory. Wiley and Sons, 1998.
39. J. Vondrák. A note on concentration of submodular functions, May 2010. arXiv:1005.2791.
40. R. B. Wilson. Nonlinear Pricing. Oxford University Press, 1997.