Optimal bounds on approximation of submodular and XOS functions by juntas

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2013, Pages 227-236

  Feldman, Vitaly ^a   Vondrak, Jan ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Approximation; Fractionally subadditive; Junta; Pac learning; Submodular; Testing

Indexed keywords

APPROXIMATION; FRACTIONALLY-SUBADDITIVE; JUNTA; PAC LEARNING; SUBMODULAR;

AC MOTORS; BOOLEAN FUNCTIONS; COMPUTER SCIENCE; LEARNING ALGORITHMS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; TESTING;

APPROXIMATION ALGORITHMS;

EID: 84893440008     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2013.32     Document Type: Conference Paper

References (35)

1. V. Feldman, P. Kothari, and J. Vondrák, "Representation, approximation and learning of submodular functions using low-rank decision trees, " COLT, 2013.
2. M. Balcan and N. Harvey, "Submodular functions: Learnability, structure, and optimization, " CoRR, vol. abs/1008.2159, 2012, earlier version in STOC 2011.
3. J. Edmonds, "Matroids, submodular functions and certain polyhedra, " Combinatorial Structures and Their Application.
4. L. Lovász, "Submodular functions and convexity, " Mathematical Programmming: The State of the Art, pp. 235-257, 1983.
5. A. Frank, "Matroids and submodular functions, " Annotated Biblographies in Combinatorial Optimization, pp. 65-80, 1997.
6. C. Guestrin, A. Krause, and A. Singh, "Near-optimal sensor placements in gaussian processes, " in ICML, 2005, pp. 265- 272.
7. A. Krause, C. Guestrin, A. Gupta, and J. Kleinberg, "Nearoptimal sensor placements: maximizing information while minimizing communication cost, " in IPSN, 2006, pp. 2-10.
8. D. J. L. B. Lehmann and N. Nisan, "Combinatorial auctions with decreasing marginal utilities, " Games and Economic Behavior, vol. 55, pp. 1884-1899, 2006.
9. S. Boucheron, G. Lugosi, and P. Massart, "A sharp concentration inequality with applications, " Random Struct. Algorithms, vol. 16, no. 3, pp. 277-292, 2000.
10. N. Nisan and M. Szegedy, "On the degree of boolean functions as real polynomials, " Computational Complexity, vol. 4, pp. 462-467, 1992.
11. E. Friedgut, "Boolean functions with low average sensitivity depend on few coordinates, " Combinatorica, vol. 18, no. 1, pp. 27-35, 1998.
12. J. Bourgain, "On the distribution of the fourier spectrum of boolean functions, " Israel Journal of Mathematics, vol. 131(1), pp. 269-276, 2002.
13. E. Friedgut, G. Kalai, and A. Naor, "Boolean functions whose Fourier transform is concentrated on the first two levels, " Adv. in Appl. Math, vol. 29, 2002.
14. I. Dinur and S. Safra, "On the hardness of approximating minimum vertex cover, " Annals of Mathematics, vol. 162, 2005.
15. R. Krauthgamer and Y. Rabani, "Improved lower bounds for embeddings into L1, " in SODA, 2006, pp. 1010-1017.
16. R. O'Donnell and R. Servedio, "Learning monotone decision trees in polynomial time, " SIAM J. Comput., vol. 37, no. 3, pp. 827-844, 2007.
17. P. Gopalan, R. Meka, and O. Reingold, "DNF sparsification and a faster deterministic counting algorithm, " in CCC, 2012, pp. 126-135.
18. E. Blais, K. Onak, R. Servedio, and G. Yaroslavtsev, "Concise representations of discrete submodular functions, " 2013, personal communication.
19. M. Goemans, N. Harvey, S. Iwata, and V. Mirrokni, "Approximating submodular functions everywhere, " in SODA, 2009, pp. 535-544.
20. A. Gupta, M. Hardt, A. Roth, and J. Ullman, "Privately releasing conjunctions and the statistical query barrier, " in STOC, 2011, pp. 803-812.
21. C. Seshadhri and J. Vondrák, "Is submodularity testable?" in Innovations in computer science, 2011, pp. 195-210.
22. M. Cheraghchi, A. Klivans, P. Kothari, and H. Lee, "Submodular functions are noise stable, " in SODA, 2012, pp. 1586- 1592.
23. A. Badanidiyuru, S. Dobzinski, H. Fu, R. Kleinberg, N. Nisan, and T. Roughgarden, "Sketching valuation functions, " in SODA, 2012, pp. 1025-1035.
24. M. Balcan, F. Constantin, S. Iwata, and L. Wang, "Learning valuation functions, " COLT, vol. 23, pp. 4.1-4.24, 2012.
25. S. Raskhodnikova and G. Yaroslavtsev, "Learning pseudoboolean k-DNF and submodular functions, " in SODA, 2013.
26. M. Goemans and J. Vondrák, "Covering minimum spanning trees of random subgraphs, " Random Struct. Algorithms, vol. 29, no. 3, pp. 257-276, 2006.
27. V. Feldman and J. Vondrák, "Optimal bounds on approximation of submodular and xos functions by juntas, " CoRR, vol. abs/1307.3301, 2013.
28. V. Feldman and P. Kothari, "Learning coverage functions, " arXiv, CoRR, vol. abs/1304.2079, 2013.
29. R. Servedio, "On learning monotone DNF under product distributions, " Information and Computation, vol. 193, no. 1, pp. 57-74, 2004.
30. C. McDiarmid and B. Reed, "Concentration for self-bounding functions and an inequality of talagrand, " Random structures and algorithms, vol. 29, pp. 549-557, 2006.
31. J. Vondrák, "A note on concentration of submodular functions, " 2010, arXiv:1005.2791v1.
32. M. Ben-Or and N. Linial, "Collective coin flipping, robust voting schemes and minima of banzhaf values, " in FOCS, 1985, pp. 408-416.
33. J. Kahn, G. Kalai, and N. Linial, "The influence of variables on Boolean functions, " in FOCS, 1988, pp. 68-80.
34. I. Dinur, E. Friedgut, G. Kindler, and R. O'Donnell, "On the Fourier tails of bounded functions over the discrete cube, " in STOC, 2006, pp. 437-446.
35. I. Dinur and E. Friedgut, "Lecture notes for analytical methods in combinatorics and computer-science (lect 5), " 2005, available at http://www.cs.huji.ac.il/̃analyt/.