Learning from satisfying assignments

DOI10.1137/1.9781611973730.33zbMath1371.68131OpenAlexW3136073727MaRDI QIDQ5363037

Ilias Diakonikolas, Anindya De, Rocco A. Servedio

Publication date: 5 October 2017

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

Full work available at URL: http://epubs.siam.org/doi/abs/10.1137/1.9781611973730.33

Mathematics Subject Classification ID

Computational learning theory (68Q32) Boolean functions (06E30)

Related Items (6)

On the Power of Learning from k-Wise Queries ⋮ Efficient parameter estimation of truncated Boolean product distributions ⋮ Robust Estimators in High-Dimensions Without the Computational Intractability ⋮ Unnamed Item ⋮ Proper learning of \(k\)-term DNF formulas from satisfying assignments ⋮ Unnamed Item

This page was built for publication: Learning from satisfying assignments