scientific article; zbMATH DE number 5485565

zbMath1231.68156MaRDI QIDQ5302076

Adam R. Klivans, Parikshit Gopalan, Adam Tauman Kalai

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Related Items (9)

Upper bounds on Fourier entropy ⋮ Upper Bounds on Fourier Entropy ⋮ Reliable agnostic learning ⋮ Towards a proof of the Fourier-entropy conjecture? ⋮ Agnostic Learning from Tolerant Natural Proofs ⋮ The Fourier Entropy–Influence Conjecture for Certain Classes of Boolean Functions ⋮ Tight bounds on \(\ell_1\) approximation and learning of self-bounding functions ⋮ Optimal Bounds on Approximation of Submodular and XOS Functions by Juntas ⋮ Agnostically Learning Boolean Functions with Finite Polynomial Representation

This page was built for publication: