{"id":"https://openalex.org/W7162005247","doi":"https://doi.org/10.48550/arxiv.2605.21167","title":"A Rigorous, Tractable Measure of Model Complexity","display_name":"A Rigorous, Tractable Measure of Model Complexity","publication_year":2026,"publication_date":"2026-05-20","ids":{"openalex":"https://openalex.org/W7162005247","doi":"https://doi.org/10.48550/arxiv.2605.21167"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.21167","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21167","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2605.21167","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5065654889","display_name":"Oskar Allerbo","orcid":"https://orcid.org/0000-0002-5926-0830"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Allerbo, Oskar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5136639519","display_name":"Thomas B. Sch\u00f6n","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sch\u00f6n, Thomas B.","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.26409998536109924,"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.26409998536109924,"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/T10775","display_name":"Generative Adversarial Networks and Image Synthesis","score":0.1551000028848648,"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"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.094200000166893,"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/measure","display_name":"Measure (data warehouse)","score":0.675000011920929},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4977000057697296},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47040000557899475},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43860000371932983},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.41119998693466187},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.40720000863075256},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.39089998602867126},{"id":"https://openalex.org/keywords/descriptive-complexity-theory","display_name":"Descriptive complexity theory","score":0.38839998841285706}],"concepts":[{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.675000011920929},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6528000235557556},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4977000057697296},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47040000557899475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43860000371932983},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.41119998693466187},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.40720000863075256},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.39089998602867126},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.38839998841285706},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3856000006198883},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3781999945640564},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.37059998512268066},{"id":"https://openalex.org/C6435147","wikidata":"https://www.wikidata.org/wiki/Q5156627","display_name":"Complexity index","level":3,"score":0.36399999260902405},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.34060001373291016},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3240000009536743},{"id":"https://openalex.org/C24604422","wikidata":"https://www.wikidata.org/wiki/Q4828244","display_name":"Average-case complexity","level":3,"score":0.31540000438690186},{"id":"https://openalex.org/C56289965","wikidata":"https://www.wikidata.org/wiki/Q5249246","display_name":"Decision tree model","level":3,"score":0.3149999976158142},{"id":"https://openalex.org/C96563100","wikidata":"https://www.wikidata.org/wiki/Q8037118","display_name":"Worst-case complexity","level":3,"score":0.3057999908924103},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29440000653266907},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2888000011444092},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2775000035762787}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.21167","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21167","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.21167","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.21167","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.5994680523872375}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"An":[0],"accurate":[1],"assessment":[2],"of":[3,43,77,97,103,110],"a":[4,37],"model's":[5],"complexity":[6,21,45,78,81],"is":[7,47,59],"crucial":[8],"for":[9,62,68,129],"topics":[10],"such":[11,83],"as":[12,84],"interpretation,":[13],"generalization,":[14],"and":[15,108,137],"model":[16,44,54],"selection.":[17],"However,":[18],"most":[19],"existing":[20],"measures":[22,82],"either":[23],"rely":[24],"on":[25,49],"heuristic":[26],"assumptions":[27],"or":[28],"are":[29],"computationally":[30],"prohibitive.":[31],"In":[32],"this":[33],"paper,":[34],"we":[35],"present":[36],"mathematically":[38],"rigorous":[39],"yet":[40],"easy-to-compute":[41],"measure":[42,76,119],"that":[46,74],"based":[48],"the":[50,53,125],"similarities":[51],"between":[52],"gradients":[55],"across":[56],"inputs.":[57],"It":[58],"thus":[60],"well-defined":[61],"any":[63],"parametric":[64],"model,":[65],"but":[66],"also":[67,116],"kernel-based":[69],"non-parametric":[70],"models.":[71],"We":[72,115],"prove":[73],"our":[75,118],"generalizes":[79],"model-specific":[80],"polynomial":[85,88],"degree":[86],"(for":[87,93,99,105,112],"regression),":[89],"kernel":[90],"length":[91],"scale":[92],"Mat\u00e9rn":[94],"kernels),":[95],"number":[96,102,109],"neighbors":[98],"k-nearest":[100],"neighbors),":[101],"splits":[104],"decision":[106],"trees),":[107],"trees":[111],"random":[113,130,133],"forests).":[114],"use":[117],"to":[120],"obtain":[121],"new":[122],"insights":[123],"into":[124],"double":[126],"descent":[127],"phenomenon":[128],"Fourier":[131],"features,":[132],"forests,":[134],"neural":[135],"networks,":[136],"gradient":[138],"boosting.":[139]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-22T00:00:00"}