{"id":"https://openalex.org/W4416779119","doi":"https://doi.org/10.48550/arxiv.2511.20888","title":"Deep Learning as a Convex Paradigm of Computation: Minimizing Circuit Size with ResNets","display_name":"Deep Learning as a Convex Paradigm of Computation: Minimizing Circuit Size with ResNets","publication_year":2025,"publication_date":"2025-11-25","ids":{"openalex":"https://openalex.org/W4416779119","doi":"https://doi.org/10.48550/arxiv.2511.20888"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2511.20888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.20888","pdf_url":"https://arxiv.org/pdf/2511.20888","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.20888","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102318017","display_name":"Arthur Paul Jacot","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jacot, Arthur","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102318017"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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.6690999865531921,"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.6690999865531921,"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/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.06069999933242798,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.039900001138448715,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.6571000218391418},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5828999876976013},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5221999883651733},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5135999917984009},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4593999981880188},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4510999917984009},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.4429999887943268},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44290000200271606},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.40849998593330383}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6571000218391418},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6226999759674072},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5828999876976013},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5616999864578247},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5221999883651733},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5135999917984009},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4593999981880188},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4510999917984009},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.4429999887943268},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44290000200271606},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4226999878883362},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.40849998593330383},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4074000120162964},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31279999017715454},{"id":"https://openalex.org/C2944601119","wikidata":"https://www.wikidata.org/wiki/Q43744058","display_name":"Residual neural network","level":3,"score":0.2985000014305115},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.29330000281333923},{"id":"https://openalex.org/C2777168461","wikidata":"https://www.wikidata.org/wiki/Q42196253","display_name":"Set operations","level":3,"score":0.29100000858306885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.289000004529953},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.2840999960899353},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2759000062942505},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.26669999957084656},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2624000012874603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26100000739097595},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.2563000023365021},{"id":"https://openalex.org/C134912446","wikidata":"https://www.wikidata.org/wiki/Q5166516","display_name":"Convex body","level":4,"score":0.25529998540878296},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C160920958","wikidata":"https://www.wikidata.org/wiki/Q7662746","display_name":"Synthetic data","level":2,"score":0.2529999911785126}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2511.20888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.20888","pdf_url":"https://arxiv.org/pdf/2511.20888","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.20888","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.20888","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":"pmh:oai:arXiv.org:2511.20888","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.20888","pdf_url":"https://arxiv.org/pdf/2511.20888","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4416779119.pdf","grobid_xml":"https://content.openalex.org/works/W4416779119.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"argues":[2],"that":[3,15,21,40,47,136],"DNNs":[4],"implement":[5],"a":[6,52,77,87,94,105,134,148],"computational":[7],"Occam's":[8],"razor":[9],"--":[10,19],"finding":[11,133],"the":[12,17,38,41,63,74,91,101,138,170],"`simplest'":[13],"algorithm":[14],"fits":[16,137],"data":[18,139],"and":[20,27,112,173],"this":[22,127],"could":[23],"explain":[24],"their":[25],"incredible":[26],"wide-ranging":[28],"success":[29],"over":[30],"more":[31],"traditional":[32],"statistical":[33],"methods.":[34],"We":[35],"start":[36],"with":[37,51,140],"discovery":[39],"set":[42],"of":[43,55,76,93,100,145,150,152,164],"real-valued":[44],"function":[45],"$f$":[46],"can":[48,85,115],"be":[49,117],"$\u03b5$-approximated":[50],"binary":[53],"circuit":[54,135],"size":[56],"at":[57],"most":[58],"$c\u03b5^{-\u03b3}$":[59],"becomes":[60],"convex":[61],"in":[62],"`Harder":[64],"than":[65],"Monte":[66],"Carlo'":[67],"(HTMC)":[68],"regime,":[69],"when":[70],"$\u03b3>2$,":[71],"allowing":[72],"for":[73,162],"definition":[75],"HTMC":[78,111,171],"norm":[79,99,129],"on":[80,90,108],"functions.":[81,109],"In":[82],"parallel":[83],"one":[84],"define":[86],"complexity":[88],"measure":[89],"parameters":[92],"ResNets":[95,155],"(a":[96],"weighted":[97],"$\\ell_1$":[98],"parameters),":[102],"which":[103],"induce":[104],"`ResNet":[106],"norm'":[107],"The":[110],"ResNet":[113,128],"norms":[114],"then":[116],"related":[118],"by":[119],"an":[120,141,159],"almost":[121,142],"matching":[122],"sandwich":[123],"bound.":[124],"Thus":[125],"minimizing":[126],"is":[130],"equivalent":[131],"to":[132,169],"minimal":[143],"number":[144],"nodes":[146],"(within":[147],"power":[149],"2":[151],"being":[153],"optimal).":[154],"thus":[156],"appear":[157],"as":[158],"alternative":[160],"model":[161],"computation":[163],"real":[165],"functions,":[166],"better":[167],"adapted":[168],"regime":[172],"its":[174],"convexity.":[175]},"counts_by_year":[],"updated_date":"2026-03-29T08:15:47.926485","created_date":"2025-11-28T00:00:00"}