{"id":"https://openalex.org/W7166063371","doi":"https://doi.org/10.48550/arxiv.2606.26705","title":"Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation","display_name":"Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation","publication_year":2026,"publication_date":"2026-06-25","ids":{"openalex":"https://openalex.org/W7166063371","doi":"https://doi.org/10.48550/arxiv.2606.26705"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.26705","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.26705","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.26705","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036113771","display_name":"Anastasis Kratsios","orcid":"https://orcid.org/0000-0001-6791-3371"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kratsios, Anastasis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001768471","display_name":"Simone Brugiapaglia","orcid":"https://orcid.org/0000-0003-1927-8232"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brugiapaglia, Simone","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139430416","display_name":"Bum Jun Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Bum Jun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135908796","display_name":"Gregory Cousins","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cousins, Gregory","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135884753","display_name":"Haitz S\u00e1ez de Oc\u00e1riz Borde","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Borde, Haitz S\u00e1ez de Oc\u00e1riz","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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.2874000072479248,"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.2874000072479248,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.10249999910593033,"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"}},{"id":"https://openalex.org/T11689","display_name":"Adversarial Robustness in Machine Learning","score":0.06270000338554382,"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/function-approximation","display_name":"Function approximation","score":0.5468999743461609},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.47119998931884766},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45829999446868896},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.43650001287460327},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4246000051498413},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4124000072479248},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.3962000012397766},{"id":"https://openalex.org/keywords/approximation-theory","display_name":"Approximation theory","score":0.39239999651908875},{"id":"https://openalex.org/keywords/feedforward-neural-network","display_name":"Feedforward neural network","score":0.3440000116825104}],"concepts":[{"id":"https://openalex.org/C91873725","wikidata":"https://www.wikidata.org/wiki/Q3445816","display_name":"Function approximation","level":3,"score":0.5468999743461609},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47699999809265137},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.47119998931884766},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45829999446868896},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.43650001287460327},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4246000051498413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4171999990940094},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40139999985694885},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.3962000012397766},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.39239999651908875},{"id":"https://openalex.org/C47702885","wikidata":"https://www.wikidata.org/wiki/Q5441227","display_name":"Feedforward neural network","level":3,"score":0.3440000116825104},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3422999978065491},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3052000105381012},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3009999990463257},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.290800005197525},{"id":"https://openalex.org/C38858127","wikidata":"https://www.wikidata.org/wiki/Q5441228","display_name":"Feed forward","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.28130000829696655},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C12713177","wikidata":"https://www.wikidata.org/wiki/Q1900281","display_name":"Perspective (graphical)","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C204575570","wikidata":"https://www.wikidata.org/wiki/Q207476","display_name":"Holomorphic function","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.27140000462532043},{"id":"https://openalex.org/C2778012447","wikidata":"https://www.wikidata.org/wiki/Q1034415","display_name":"Scope (computer science)","level":2,"score":0.27129998803138733},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2513999938964844}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.26705","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.26705","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.26705","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.26705","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Feedforward":[0],"neural":[1,53],"network":[2],"(NN)":[3],"expressivity":[4],"is":[5,17,51,73,116,150,168,211],"typically":[6],"studied":[7],"by":[8,75,93,104,119,124,170,190,213],"emulating":[9],"optimal":[10],"basis-expansion":[11],"schemes.":[12],"While":[13],"powerful,":[14],"this":[15],"perspective":[16],"incomplete:":[18],"it":[19,86,158],"primarily":[20],"captures":[21],"complexity":[22,115,185],"through":[23],"regularity,":[24,37],"and":[25,32,43,100,110,155,189,203],"therefore":[26],"does":[27],"not":[28,58,117],"distinguish":[29],"intuitively":[30],"simple":[31],"complicated":[33],"objects":[34],"with":[35,96,226],"comparable":[36,91],"such":[38,144,198],"as":[39,60,66,145,199],"the":[40,105,220,235],"square-root":[41],"function":[42,72],"a":[44,71,76,80,136,151,160,242],"typical":[45],"Brownian":[46],"path.":[47],"The":[48,163],"guiding":[49],"message":[50],"that":[52,130,192],"networks":[54],"should":[55],"be":[56,88],"viewed":[57],"only":[59,156],"flexible":[61],"basis":[62],"functions,":[63,177,188],"but":[64,122],"also":[65,123],"models":[67],"of":[68,165],"computation.":[69],"If":[70],"computable":[74],"real-valued":[77],"circuit":[78,223],"over":[79,234],"prescribed":[81],"elementary":[82],"gate":[83,108,111],"language,":[84],"then":[85,128],"can":[87,194],"computed":[89],"to":[90],"accuracy":[92],"an":[94],"NN":[95,133],"explicit":[97],"depth,":[98,106],"width,":[99,107],"non-zero-parameter":[101],"bounds":[102],"controlled":[103],"count,":[109],"structure.":[112],"Thus,":[113],"neural-network":[114],"governed":[118],"regularity":[120],"alone,":[121],"algorithmic":[125],"complexity.":[126],"We":[127],"show":[129],"any":[131],"definable":[132],"model":[134],"satisfying":[135],"natural":[137],"parallelization":[138],"condition,":[139],"allowing":[140],"possibly":[141],"multivariate":[142],"non-linearities":[143],"attention":[146],"or":[147],"layer":[148],"normalization,":[149],"universal":[152,172],"approximator":[153],"if":[154,157],"contains":[159],"non-affine":[161],"nonlinearity.":[162],"scope":[164],"our":[166],"theory":[167],"illustrated":[169,212],"deducing":[171],"approximation":[173,179],"guarantees":[174,180],"for":[175,181,186,241],"continuous":[176],"minimax-optimal":[178],"Besov":[182],"classes,":[183],"logarithmic-error":[184],"holomorphic":[187],"showing":[191],"NNs":[193,225],"emulate":[195],"numerical":[196],"algorithms":[197],"Newton-Raphson":[200],"root":[201],"finding":[202],"power":[204],"iteration":[205],"without":[206],"architecture-specific":[207],"arguments.":[208],"Its":[209],"precision":[210],"shortest-path":[214],"computation":[215],"on":[216],"$k$-vertex":[217],"graphs:":[218],"compiling":[219],"tropical":[221],"dynamic-programming":[222],"yields":[224],"O(log(1/\u03b5))":[227],"non-zero":[228],"parameters,":[229],"exponentially":[230],"improving":[231],"in":[232],"1/\u03b5":[233],"generic":[236],"$O(\u03b5^{-c":[237],"k^2})$":[238],"Lipschitz-approximation":[239],"scale,":[240],"constant":[243],"c>0.":[244]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-27T00:00:00"}