Affiliation:
1. University of California, Berkeley
2. IBM Almaden Research Center, San Jose, CA
3. Columbia University, New York, NY
Abstract
The
Chow parameters
of a Boolean function
f
:{−1, 1}
n
→ {−1, 1} are its
n
+1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Chow 1961; Tannenbaum 1961] that the (exact values of the) Chow parameters of any linear threshold function
f
uniquely specify
f
within the space of all Boolean functions, but until recently [O'Donnell and Servedio 2011] nothing was known about efficient algorithms for
reconstructing
f
(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
f
, runs in time Õ(
n
2
) ⋅ (1/ϵ)
O
(log
2
(1/ϵ))
and with high probability outputs a representation of an LTF
f
′ that is ϵ-close to
f
in Hamming distance. The only previous algorithm [O'Donnell and Servedio 2011] had running time poly(
n
) ⋅ 2
2
Õ(1/ϵ
2
)
.
As a byproduct of our approach, we show that for any linear threshold function
f
over {-1, 1}
n
, there is a linear threshold function
f
′ which is ϵ-close to
f
and has all weights that are integers of magnitude at most √n ⋅ (1/ϵ)
O
(log
2
(1/ϵ))
. This significantly improves the previous best result of Diakonikolas and Servedio [2009] 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/ϵ))
} [Goldberg 2006; Servedio 2007]. 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
f
any linear threshold function and
g
any bounded function, if the Chow parameters of
f
are close to the Chow parameters of
g
then
f
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
f
.
Funder
Simons Foundation
Division of Computing and Communication Foundations
Division of Computer and Network Systems
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference56 articles.
1. Weighted voting doesn't work: A mathematical analysis;Banzhaf J.;Rutgers Law Rev.,1965
2. Chow parameters in pseudothreshold logic
3. Learning with Restricted Focus of Attention
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献