License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2022.18
URN: urn:nbn:de:0030-drops-168161
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16816/
Bhargav, C. S. ;
Dutta, Sagnik ;
Saxena, Nitin
Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits
Abstract
We show that any product-depth Δ algebraic circuit for the Iterated Matrix Multiplication Polynomial IMM_{n,d} (when d = O(log n/log log n)) must be of size at least n^Ω(d^{1/(φ²)^Δ}) where φ = 1.618… is the golden ratio. This improves the recent breakthrough result of Limaye, Srinivasan and Tavenas (FOCS'21) who showed a super polynomial lower bound of the form n^Ω(d^{1/4^Δ}) for constant-depth circuits.
One crucial idea of the (LST21) result was to use set-multilinear polynomials where each of the sets in the underlying partition of the variables could be of different sizes. By picking the set sizes more carefully (depending on the depth we are working with), we first show that any product-depth Δ set-multilinear circuit for IMM_{n,d} (when d = O(log n)) needs size at least n^Ω(d^{1/φ^Δ}). This improves the n^Ω(d^{1/2^Δ}) lower bound of (LST21). We then use their Hardness Escalation technique to lift this to general circuits.
We also show that our lower bound cannot be improved significantly using these same techniques. For the specific two set sizes used in (LST21), they showed that their lower bound cannot be improved. We show that for any d^o(1) set sizes (out of maximum possible d), the scope for improving our lower bound is minuscule: there exists a set-multilinear circuit that has product-depth Δ and size almost matching our lower bound such that the value of the measure used to prove the lower bound is maximum for this circuit. This results in a barrier to further improvement using the same measure.
BibTeX - Entry
@InProceedings{bhargav_et_al:LIPIcs.MFCS.2022.18,
author = {Bhargav, C. S. and Dutta, Sagnik and Saxena, Nitin},
title = {{Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits}},
booktitle = {47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-256-3},
ISSN = {1868-8969},
year = {2022},
volume = {241},
editor = {Szeider, Stefan and Ganian, Robert and Silva, Alexandra},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16816},
URN = {urn:nbn:de:0030-drops-168161},
doi = {10.4230/LIPIcs.MFCS.2022.18},
annote = {Keywords: polynomials, lower bounds, algebraic circuits, proof barrier, fibonacci numbers}
}
|
Keywords: |
|
polynomials, lower bounds, algebraic circuits, proof barrier, fibonacci numbers |
|
Collection: |
|
47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
22.08.2022 |
