## Abstract

The Chow parameters of a Boolean function f : {-1, 1}

Our main result is a new algorithm for the Chow Parameters Problem which, given (sufficiently accurate approximations to) the Chow parameters of any linear threshold function

As a byproduct of our approach, we show that for any linear threshold function

In addition to being significantly stronger than previous work, our results are obtained using conceptually simpler proofs. The two main ingredients underlying our results are (1) a new structural result showing that for

^{n}→ {-1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that the (exact values of the) Chow parameters of any linear threshold function*ƒ*uniquely specify*ƒ*within the space of all Boolean functions, but until recently [OS11] nothing was known about efficient algorithms for*reconstructing**ƒ*(exactly or approximately) from exact or approximate values of its Chow parameters. We refer to this reconstruction problem as the Chow Parameters Problem.Our main result is a new algorithm for the Chow Parameters Problem which, given (sufficiently accurate approximations to) the Chow parameters of any linear threshold function

*ƒ*, runs in time Õ(n^{2})·(1=ε)^{O(log2(1/ε))}and with high probability outputs a representation of an LTF*ƒ'*that is ε-close to*ƒ*. Theonly previous algorithm [OS11] had running time poly(n) · 2^{2Õ(1=ε2).}As a byproduct of our approach, we show that for any linear threshold function

*ƒ*over {-1, 1}^{n}, there is a linear threshold function*ƒ'*which is ε-close to*ƒ*and has all weights that are integers at most √n·(1=ε)^{O(log2(1=ε))}. This significantly improves the best previous result of [DS09] which gave a poly (n) ·2^{Õ(1=ε2/3)}weight bound, and is close to the known lower bound of max{√n, (1=ε)^{Ω(log log(1=ε))}} [Gol06, Ser07]. Our techniques also yield improved algorithms for related problems in learning theory.In addition to being significantly stronger than previous work, our results are obtained using conceptually simpler proofs. The two main ingredients underlying our results are (1) a new structural result showing that for

*ƒ*any linear threshold function and*g*any bounded function, if the Chow parameters of*ƒ*are close to the Chow parameters of*g*then*ƒ*is close to*g*; (2) a new boosting-like algorithm that given approximations to the Chow parameters of a linear threshold function outputs a bounded function whose Chow parameters are close to those of*ƒ*.Original language | English |
---|---|

Pages (from-to) | 72 |

Number of pages | 1 |

Journal | Electronic Colloquium on Computational Complexity (ECCC) |

Volume | 19 |

Publication status | Published - 2012 |