{"id":"https://openalex.org/W7118474100","doi":"https://doi.org/10.48550/arxiv.2601.01417","title":"A Depth Hierarchy for Computing the Maximum in ReLU Networks via Extremal Graph Theory","display_name":"A Depth Hierarchy for Computing the Maximum in ReLU Networks via Extremal Graph Theory","publication_year":2026,"publication_date":"2026-01-04","ids":{"openalex":"https://openalex.org/W7118474100","doi":"https://doi.org/10.48550/arxiv.2601.01417"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2601.01417","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01417","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2601.01417","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5003730402","display_name":"Itay Safran","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Safran, Itay","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003730402"],"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.8628000020980835,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.8628000020980835,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04560000076889992,"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/T11273","display_name":"Advanced Graph Neural Networks","score":0.026900000870227814,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.538100004196167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5182999968528748},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.49619999527931213},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4909000098705292},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47099998593330383},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.46399998664855957},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41990000009536743},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4072999954223633}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6504999995231628},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.538100004196167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5182999968528748},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.49619999527931213},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","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.4871000051498413},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47099998593330383},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.46399998664855957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42250001430511475},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41990000009536743},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4072999954223633},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.400299996137619},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.38429999351501465},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.3765999972820282},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.3546999990940094},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.32199999690055847},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.29429998993873596},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.28360000252723694},{"id":"https://openalex.org/C2984842247","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep neural networks","level":3,"score":0.26339998841285706},{"id":"https://openalex.org/C98184364","wikidata":"https://www.wikidata.org/wiki/Q1780131","display_name":"Argument (complex analysis)","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C2779227376","wikidata":"https://www.wikidata.org/wiki/Q6505497","display_name":"Layer (electronics)","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2601.01417","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01417","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2601.01417","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2601.01417","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":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,19],"consider":[1],"the":[2,8,31,41,59,75,79,88,93,112,115,124,134],"problem":[3],"of":[4,7,78,92,114,137],"exact":[5],"computation":[6],"maximum":[9,32,80,125],"function":[10,126],"over":[11],"$d$":[12],"real":[13],"inputs":[14],"using":[15],"ReLU":[16],"neural":[17,152],"networks.":[18,153],"prove":[20],"a":[21,70,84,106,143],"depth":[22,35,60],"hierarchy,":[23],"wherein":[24],"width":[25],"$\u03a9\\big(d^{1+\\frac{1}{2^{k-2}-1}}\\big)$":[26],"is":[27,40,67],"necessary":[28],"to":[29,103],"represent":[30],"for":[33,47,146,150],"any":[34],"$3\\le":[36],"k\\le":[37],"\\log_2(\\log_2(d))$.":[38],"This":[39,117],"first":[42,89],"unconditional":[43],"super-linear":[44],"lower":[45,148],"bound":[46],"this":[48],"fundamental":[49],"operator":[50],"at":[51],"depths":[52],"$k\\ge3$,":[53],"and":[54,73,141],"it":[55],"holds":[56],"even":[57],"if":[58],"scales":[61],"with":[62,81],"$d$.":[63],"Our":[64],"proof":[65],"technique":[66],"based":[68],"on":[69],"combinatorial":[71],"argument":[72],"associates":[74],"non-differentiable":[76,139],"ridges":[77],"cliques":[82],"in":[83],"graph":[85,101],"induced":[86],"by":[87],"hidden":[90],"layer":[91],"computing":[94],"network,":[95],"utilizing":[96],"Tur\u00e1n's":[97],"theorem":[98],"from":[99,133],"extremal":[100],"theory":[102],"show":[104],"that":[105,119,131],"sufficiently":[107],"narrow":[108],"network":[109],"cannot":[110],"capture":[111],"non-linearities":[113],"maximum.":[116],"suggests":[118],"despite":[120],"its":[121,138],"simple":[122],"nature,":[123],"possesses":[127],"an":[128],"inherent":[129],"complexity":[130],"stems":[132],"geometric":[135],"structure":[136],"hyperplanes,":[140],"provides":[142],"novel":[144],"approach":[145],"proving":[147],"bounds":[149],"deep":[151]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}