eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2022-07-11
32:1
32:23
10.4230/LIPIcs.CCC.2022.32
article
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials
Limaye, Nutan
1
Srinivasan, Srikanth
2
3
Tavenas, Sébastien
4
Computer Science Department, IT University of Copenhagen, Denmark
Department of Computer Science, Aarhus University, Denmark
On leave from Department of Mathematics, IIT Bombay, India
Univ. Grenoble Alpes, Univ. Savoie Mont Blanc, CNRS, LAMA, France
We make progress on understanding a lower bound technique that was recently used by the authors to prove the first superpolynomial constant-depth circuit lower bounds against algebraic circuits.
More specifically, our previous work applied the well-known partial derivative method in a new setting, that of lopsided set-multilinear polynomials. A set-multilinear polynomial P ∈ 𝔽[X_1,…,X_d] (for disjoint sets of variables X_1,…,X_d) is a linear combination of monomials, each of which contains one variable from X_1,…,X_d. A lopsided space of set-multilinear polynomials is one where the sets X_1,…,X_d are allowed to have different sizes (we use the adjective "lopsided" to stress this feature). By choosing a suitable lopsided space of polynomials, and using a suitable version of the partial-derivative method for proving lower bounds, we were able to prove constant-depth superpolynomial set-multilinear formula lower bounds even for very low-degree polynomials (as long as d is a growing function of the number of variables N). This in turn implied lower bounds against general formulas of constant-depth.
A priori, there is nothing stopping these techniques from giving us lower bounds against algebraic formulas of any depth. We investigate the extent to which this lower bound can extend to greater depths. We prove the following results.
1) We observe that our choice of the lopsided space and the kind of partial-derivative method used can be modeled as the choice of a multiset W ⊆ [-1,1] of size d. Our first result completely characterizes, for any product-depth Δ, the best lower bound we can prove for set-multilinear formulas of product-depth Δ in terms of some combinatorial properties of W, that we call the depth-Δ tree bias of W.
2) We show that the maximum depth-3 tree bias, over multisets W of size d, is Θ(d^{1/4}). This shows a stronger formula lower bound of N^{Ω(d^{1/4})} for set-multilinear formulas of product-depth 3, and also puts a non-trivial constraint on the best lower bounds we can hope to prove at this depth in this framework (a priori, we could have hoped to prove a lower bound of N^{Ω(Δ d^{1/Δ})} at product-depth Δ).
3) Finally, we show that for small Δ, our proof technique cannot hope to prove lower bounds of the form N^{Ω(d^{1/poly(Δ)})}. This seems to strongly hint that new ideas will be required to prove lower bounds for formulas of unbounded depth.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol234-ccc2022/LIPIcs.CCC.2022.32/LIPIcs.CCC.2022.32.pdf
Partial Derivative Method
Barriers to Lower Bounds