Lower Bounds for Linear Decision Lists

We demonstrate a lower bound technique for linear decision lists, which are decision lists where the queries are arbitrary linear threshold functions. We use this technique to prove an explicit lower bound by showing that any linear decision list computing the function $MAJ \circ XOR$ requires size $2^{0.18 n}$. This completely answers an open question of Tur{a}n and Vatan [FoCM'97]. We also show that the spectral classes $PL_1, PL_\infty$, and the polynomial threshold function classes $\widehat{PT}_1, PT_1$, are incomparable to linear decision lists.

[1]  Jehoshua Bruck,et al.  Harmonic Analysis of Polynomial Threshold Functions , 1990, SIAM J. Discret. Math..

[2]  B. Bollobás.  Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability , 1986 .

[3]  Arkadev Chattopadhyay,et al.  The log-approximate-rank conjecture is false , 2018, Electron. Colloquium Comput. Complex..

[4]  Kristoffer Arnsfelt Hansen,et al.  Exact Threshold Circuits , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[5]  L. H. Harper.  Optimal numberings and isoperimetric problems on graphs , 1966 .

[6]  György Turán,et al.  On Linear Decision Trees Computing Boolean Functions , 1991, ICALP.

[7]  Farrokh Vatan,et al.  Linear decision lists and partitioning algorithms for the construction of neural networks , 1997 .

[8]  Ronald L. Rivest,et al.  Learning decision lists , 2004, Machine Learning.

[9]  Zoltán Füredi,et al.  A short proof for a theorem of Harper about Hamming-spheres , 1981, Discret. Math..

[10]  Alexander A. Razborov,et al.  On Small Depth Threshold Circuits , 1992, SWAT.

[11]  Matthias Krause.  On the Computational Power of Boolean Decision Lists , 2002, STACS.

[12]  Harry Buhrman,et al.  On Computation and Communication with Small Bias , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[13]  Alexander A. Razborov,et al.  Majority gates vs. general weighted threshold gates , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[14]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[15]  Eiji Takimoto,et al.  Lower Bounds for Linear Decision Trees with Bounded Weights , 2015, SOFSEM.

[16]  Eiji Takimoto,et al.  Lower Bounds for Linear Decision Trees via an Energy Complexity Argument , 2011, MFCS.

[17]  Arkadev Chattopadhyay,et al.  A Short List of Equalities Induces Large Sign Rank , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[18]  J. Radhakrishnan.  Entropy and Counting ∗ , 2001 .

[19]  Russell Impagliazzo,et al.  Communication Complexity with Synchronized Clocks , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[20]  Pavel Pudlák,et al.  Threshold circuits of bounded depth , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).