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

Alexandros Eskenazis; Paata Ivanisvili

doi:10.1145/3519935.3519981

STOC2022Top-tier venue

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

Alexandros Eskenazis, Paata Ivanisvili

arXiv DOI Publisher

2022Year

10Citations

2Top-tier citations

Abstract

We prove that every bounded function f:−1,1n→[−1,1] of degree at most d can be learned with L2-accuracy ε and confidence 1−δ from log(n/δ) ε−d−1 Cd3/2√logd random queries, where C>1 is a universal finite constant.

Ask about this paper

Your agent reads all of it.

Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.

What it claims
Who builds on it
How it compares
Where it falls short

You ask

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

Terminal

Install the CLI

$ lune papers fulltext 2cd4b29b-46a5-4b00-a9c0-6be2aa7ae151

Cited by top-tier papers2

Ask how each one uses it

Abstract

Ask about this paper

Your agent reads all of it.

Cited by top-tier papers2

Related papers