Degree-๐‘‘ chow parameters robustly determine degree-๐‘‘ PTFs (and algorithmic applications)

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pp. 804-815, 2019.

Cited by: 0|Bibtex|Views18|Links
EI
Keywords:
Chow parameters Fourier analysis polynomial threshold functions robust learning

Abstract:

The degree-d Chow parameters of a Boolean function are its degree at most d Fourier coefficients. It is well-known that degree-d Chow parameters uniquely characterize degree-d polynomial threshold functions (PTFs) within the space of all bounded functions. In this paper, we prove a robust version of this theorem: For f any Boolean degree-...More

Code:

Data:

Your rating :
0

ย 

Tags
Comments