Learning submodular functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7524 LNAI, Issue PART 2, 2012, Pages 846-849

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

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC APPLICATIONS; DISCRETE FUNCTIONS; EXTREMAL; LEARNABILITY; LOWER BOUNDS; SUBMODULAR FUNCTIONS;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; ECONOMICS;

LEARNING SYSTEMS;

EID: 84866860287     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33486-3_61     Document Type: Conference Paper

References (14)

1. NIPS workshop on discrete optimization in machine learning: Submodularity, sparsity & polyhedra, DISCML (2009), http://www.discml.cc/
2. NIPS workshop on discrete optimization in machine learning (discml): Uncertainty, generalization and feedback (2011), http://las.ethz.ch/discml/
3. Balcan, M.F., Blum, A., Mansour, Y.: Item pricing for revenue maxmimization. In: ACM Conference on Electronic Commerce (2009)
4. Blum, A., Burch, C., Langford, J.: On learning monotone boolean functions. In: FOCS (1998)
5. Dachman-Soled, D., Lee, H.K., Malkin, T., Servedio, R.A., Wan, A., Wee, H.M.: Optimal Cryptographic Hardness of Learning Monotone Functions. In: Aceto, L., Damg° ard, I., Goldberg, L.A., Halld́orsson, M.M., Ingólfsdot́tir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 36-47. Springer, Heidelberg (2008)
6. Dobzinski, S., Nisan, N., Schapira, M.: Truthful Randomized Mechanisms for Combinatorial Auctions. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 644-652 (2006)
7. Goemans, M., Harvey, N., Iwata, S., Mirrokni, V.: Approximating submodular functions everywhere. In: ACM-SIAM Symposium on Discrete Algorithms (2009)
8. Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1993)
9. Krause, A., Guestrin, C.: Beyond convexity: Submodularity in machine learning (2008), http://www.select.cs.cmu.edu/tutorials/icml08submodularity.html
10. Krause, A., Guestrin, C.: Intelligent information gathering and submodular function optimization (2009), http://submodularity.org/ijcai09/index. html
11. Krause, A., Guestrin, C.: Near-optimal nonmyopic value of information in graphical models. In: UAI (2005)
12. Lehmann, B., Lehmann, D.J., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. Games and Economic Behavior 55, 270-296 (2006)
13. Narasimhan, M., Bilmes, J.: Local search for balanced submodular clusterings. In: Twentieth International Joint Conference on Artificial Intelligence (2007)
14. Vondrák, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC (2008)