Skip to content
Sagan

Paper

Tight $L_\infty$ Sample Complexity for Low-Degree and Sparse Boolean Polynomials

Unreadunread

AI summary

arXiv:2606. 17319v1 Announce Type: new Abstract: Motivated by the optimization of bounded binary black-box functions, we study the problem of learning polynomial surrogates over the Boolean hypercube.