Learning low-degree functions from a logarithmic number of random queries

DOI10.1145/3519935.3519981arXiv2109.10162WikidataQ130966998 ScholiaQ130966998MaRDI QIDQ6083477

Alexandros Eskenazis, Paata Ivanisvili

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

learning theoryBohnenblust-Hille inequalitydiscrete hypercube

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Quantum Talagrand, KKL and Friedgut's theorems and the learnability of quantum Boolean functions

This page was built for publication: Learning low-degree functions from a logarithmic number of random queries