Learning pseudo-Boolean k-DNF and Submodular Functions

@inproceedings{Raskhodnikova2013LearningPK,
  title={Learning pseudo-Boolean k-DNF and Submodular Functions},
  author={Sofya Raskhodnikova and Grigory Yaroslavtsev},
  booktitle={SODA},
  year={2013}
}
We prove that any submodular function f : {0, 1}n → {0, 1, ..., k} can be represented as a pseudoBoolean2k-DNF formula. Pseudo-Boolean DNFs are a natural generaliza tion of DNF representation for functions with integer range. Each term in such a formula has an associated integral constant. We show that an analog of Håstad’s switching lemma holds for pseudo -Bo leank-DNFs if all constants associated with the terms of the formula are bounded. This allows us to generalize Mansour’s PAC-learning… CONTINUE READING
Highly Cited
This paper has 19 citations. REVIEW CITATIONS
13 Citations
33 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 33 references

Question 2: Testing submodularity

  • C. Seshadhri
  • Downloaded July
  • 2009
Highly Influential
5 Excerpts

A switching lemma primer

  • P. Beame
  • In Unpublished notes: http://www.cs.washington…
  • 1994
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…