{"id":"https://openalex.org/W7165181750","doi":"https://doi.org/10.48550/arxiv.2606.18540","title":"Depth Lower Bounds for ReLU Networks with Binary Inputs","display_name":"Depth Lower Bounds for ReLU Networks with Binary Inputs","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W7165181750","doi":"https://doi.org/10.48550/arxiv.2606.18540"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.18540","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18540","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.18540","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072801399","display_name":"Neil Krishnan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Krishnan, Neil","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5138855857","display_name":"Elchanan Mossel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mossel, Elchanan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7501000165939331,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.7501000165939331,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.0966000035405159,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.04170000180602074,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.603600025177002},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5738000273704529},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5335000157356262},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5231000185012817},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.51910001039505},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.49399998784065247},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4909000098705292},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4593000113964081}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6499000191688538},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.603600025177002},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5738000273704529},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5335000157356262},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5231000185012817},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.51910001039505},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5048999786376953},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.49399998784065247},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4909000098705292},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46239998936653137},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4593000113964081},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.43880000710487366},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4311000108718872},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.40700000524520874},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.4065000116825104},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.40310001373291016},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35989999771118164},{"id":"https://openalex.org/C2776061190","wikidata":"https://www.wikidata.org/wiki/Q7451805","display_name":"Separation (statistics)","level":2,"score":0.34630000591278076},{"id":"https://openalex.org/C153658351","wikidata":"https://www.wikidata.org/wiki/Q746264","display_name":"Constant function","level":3,"score":0.33739998936653137},{"id":"https://openalex.org/C106195933","wikidata":"https://www.wikidata.org/wiki/Q7847935","display_name":"Truncation (statistics)","level":2,"score":0.33399999141693115},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.29679998755455017},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.26969999074935913},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.26030001044273376},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.25769999623298645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.18540","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18540","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.18540","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.18540","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,94,154],"study":[1],"the":[2,51,128,171],"role":[3],"of":[4,20,69,102,110,121,140,170],"depth":[5,26,40,46,87,111,122,141],"in":[6,136,152],"ReLU":[7,38,59,90,108,119],"networks":[8,91],"with":[9,34,149],"discrete":[10],"(Boolean)":[11],"inputs":[12],"and":[13,58,113,124],"real-valued":[14],"outputs,":[15],"complementing":[16],"two":[17,47],"established":[18,44],"lines":[19],"work.":[21],"For":[22],"Boolean":[23],"inputs,":[24],"striking":[25],"separation":[27,41,73,88],"results":[28],"were":[29],"proven":[30],"for":[31,45,54,89],"$\\mathsf{AC}^0$":[32],"but":[33],"threshold":[35],"($\\mathsf{TC}^0$)":[36],"or":[37],"gates":[39],"is":[42,173],"only":[43],"vs.":[48],"three.":[49],"On":[50],"other":[52],"hand,":[53],"{\\em":[55],"real-valued}":[56],"functions":[57,70,103],"networks,":[60],"Telgarsky's":[61],"(2016)":[62],"constructed":[63],"a":[64,107,176],"simple":[65],"one":[66],"variable":[67],"class":[68],"which":[71],"establishes":[72],"at":[74],"higher":[75],"depths.":[76],"In":[77],"this":[78],"paper":[79],"we":[80],"are":[81],"interested":[82],"to":[83],"establish":[84],"an":[85,99,166],"all-depths":[86],"on":[92,161],"$\\{0,1\\}^n$.":[93],"do":[95],"so":[96],"by":[97,106,175],"exhibiting":[98],"explicit":[100],"family":[101],"computable":[104,174],"exactly":[105,130],"network":[109,120,139],"$n+1$":[112],"constant":[114],"width,":[115],"such":[116],"that":[117,156],"any":[118],"$d$":[123],"width":[125,150],"$w$":[126],"computing":[127],"function":[129],"must":[131],"satisfy":[132],"$w^d":[133],"=":[134,143],"\u03a9(2^n)$;":[135],"particular,":[137],"no":[138],"$d":[142],"o(n/\\log":[144],"n)$":[145],"can":[146],"compute":[147],"it":[148],"polynomial":[151],"$n$.":[153],"note":[155],"our":[157],"lower":[158],"bound":[159],"relies":[160],"\\emph{exact,":[162],"infinite-accuracy}":[163],"computation":[164],"as":[165],"exponential":[167],"precision":[168],"truncation":[169],"output":[172],"polynomial-size":[177],"$\\mathsf{TC}^0$":[178],"circuit.":[179]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-19T00:00:00"}