Learning Pseudo-Boolean k-DNF and Submodular Functions

DOI10.1137/1.9781611973105.98zbMath1422.68206arXiv1208.2294OpenAlexW1519426874MaRDI QIDQ5741807

Grigory Yaroslavtsev, Sofya Raskhodnikova

Publication date: 15 May 2019

Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.2294

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (5)

Submodular Functions: Learnability, Structure, and Optimization ⋮ Testing convexity of figures under the uniform distribution ⋮ Approximate F_2-Sketching of Valuation Functions ⋮ Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions ⋮ Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas

This page was built for publication: Learning Pseudo-Boolean k-DNF and Submodular Functions