Learning and Lower Bounds for AC0 with Threshold Gates

In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this question affirmatively by showing that such circuits have fairly strong Fourier concentration; hence the low-degree algorithm of Linial, Mansour and Nisan [LMN93] learns such circuits in sub-exponential time. Under a conjecture of Gotsman and Linial [GL94] which upper bounds the total influence of low-degree polynomial threshold functions, the running time is quasi-polynomial. Our results extend to AC0 circuits augmented with a small super-constant number of threshold gates at arbitrary locations in the circuit. We also establish some new structural properties of AC0 circuits augmented with threshold gates, which allow us to prove a range of separation results and lower bounds.

• Type: Conference
• Year: 2010
• Where: APPROX
• Authors: Parikshit Gopalan, Rocco A. Servedio
• Keywords: Algorithms, APPROX 2010, Low-degree Polynomial Threshold, Threshold Gates, Uniform Random Examples