{"id":"https://openalex.org/W7133312726","doi":"https://doi.org/10.48550/arxiv.2603.00910","title":"Curvature-Weighted Capacity Allocation: A Minimum Description Length Framework for Layer-Adaptive Large Language Model Optimization","display_name":"Curvature-Weighted Capacity Allocation: A Minimum Description Length Framework for Layer-Adaptive Large Language Model Optimization","publication_year":2026,"publication_date":"2026-03-01","ids":{"openalex":"https://openalex.org/W7133312726","doi":"https://doi.org/10.48550/arxiv.2603.00910"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.00910","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00910","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":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.00910","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5127957136","display_name":"Theophilus Amaefuna","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amaefuna, Theophilus","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128030809","display_name":"Hitesh Vaidya","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vaidya, Hitesh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127974620","display_name":"Anshuman Chhabra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chhabra, Anshuman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068199296","display_name":"Ankur Mali","orcid":"https://orcid.org/0000-0001-5813-3584"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mali, Ankur","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5127957136"],"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.3968999981880188,"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.3968999981880188,"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/T10028","display_name":"Topic Modeling","score":0.055399999022483826,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05090000107884407,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.5879999995231628},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5698000192642212},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5550000071525574},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5343000292778015},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.5141000151634216},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5084999799728394},{"id":"https://openalex.org/keywords/layer","display_name":"Layer (electronics)","score":0.44780001044273376},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.44749999046325684},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.4343999922275543}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.5879999995231628},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5698000192642212},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5680000185966492},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5550000071525574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.546500027179718},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5343000292778015},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.5141000151634216},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5084999799728394},{"id":"https://openalex.org/C2779227376","wikidata":"https://www.wikidata.org/wiki/Q6505497","display_name":"Layer (electronics)","level":2,"score":0.44780001044273376},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.44749999046325684},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.4343999922275543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38269999623298645},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3799999952316284},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.3765000104904175},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3758000135421753},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.3352999985218048},{"id":"https://openalex.org/C774472","wikidata":"https://www.wikidata.org/wiki/Q6760393","display_name":"Margin (machine learning)","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.31700000166893005},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3156000077724457},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3059999942779541},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.30399999022483826},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.29030001163482666},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2888000011444092},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.28279998898506165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28130000829696655},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.2809999883174896},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.266400009393692},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.2615000009536743},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.25690001249313354}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.00910","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00910","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.00910","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00910","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":"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":{"Layer-wise":[0],"capacity":[1,123,214],"in":[2,60,89,169],"large":[3],"language":[4],"models":[5],"is":[6,70],"highly":[7],"non-uniform:":[8],"some":[9],"layers":[10,136,149,153],"contribute":[11],"disproportionately":[12],"to":[13,134,201,220],"loss":[14],"reduction":[15,88],"while":[16,150],"others":[17],"are":[18],"near-redundant.":[19],"Existing":[20],"methods":[21],"for":[22,39],"exploiting":[23],"this":[24,52],"non-uniformity,":[25],"such":[26],"as":[27],"influence-function-based":[28],"layer":[29,73,95,112],"scoring,":[30],"produce":[31],"sensitivity":[32],"estimates":[33],"but":[34],"offer":[35],"no":[36],"principled":[37],"mechanism":[38],"translating":[40],"them":[41],"into":[42,111],"allocation":[43,124],"or":[44,130],"pruning":[45,142],"decisions":[46],"under":[47,137],"hardware":[48],"constraints.":[49],"We":[50,175],"address":[51],"gap":[53],"with":[54,197,227],"a":[55,122,141,164,221],"unified,":[56],"curvature-aware":[57],"framework":[58,226],"grounded":[59],"the":[61,71,85,202,206],"Minimum":[62],"Description":[63],"Length":[64],"(MDL)":[65],"principle.":[66],"Our":[67],"central":[68],"quantity":[69],"curvature-adjusted":[72],"gain":[74],"$\u03b6_k^2":[75],"=":[76],"g_k^\\top":[77],"\\widetilde{H}_{kk}^{-1}":[78],"g_k$,":[79],"which":[80,99],"we":[81,116],"show":[82],"equals":[83],"twice":[84],"maximal":[86],"second-order":[87],"empirical":[90,218],"risk":[91],"achievable":[92],"by":[93,104,163,195],"updating":[94],"$k$":[96],"alone,":[97],"and":[98,140,230],"strictly":[100],"dominates":[101],"gradient-norm-based":[102],"scores":[103,114,193],"incorporating":[105],"local":[106],"curvature.":[107],"Normalizing":[108],"these":[109,210],"gains":[110],"quality":[113],"$q_k$,":[115],"formulate":[117],"two":[118],"convex":[119],"MDL":[120],"programs:":[121],"program":[125,143],"that":[126,144,183],"distributes":[127],"expert":[128],"slots":[129],"LoRA":[131],"rank":[132],"preferentially":[133],"high-curvature":[135],"diminishing":[138],"returns,":[139],"concentrates":[145],"sparsity":[146],"on":[147,188],"low-gain":[148],"protecting":[151],"high-gain":[152],"from":[154,216],"degradation.":[155],"Both":[156],"programs":[157],"admit":[158],"unique":[159],"closed-form":[160],"solutions":[161],"parameterized":[162],"single":[165],"dual":[166],"variable,":[167],"computable":[168],"$O(K":[170],"\\log":[171],"1/\\varepsilon)$":[172],"via":[173],"bisection.":[174],"prove":[176],"an":[177,217],"$O(\u03b4^2)$":[178],"transfer":[179],"regret":[180],"bound":[181],"showing":[182],"source-domain":[184],"allocations":[185],"remain":[186],"near-optimal":[187],"target":[189,207],"tasks":[190],"when":[191],"curvature":[192],"drift":[194],"$\u03b4$,":[196],"explicit":[198],"constants":[199],"tied":[200],"condition":[203],"number":[204],"of":[205],"program.":[208],"Together,":[209],"results":[211],"elevate":[212],"layer-wise":[213],"optimization":[215],"heuristic":[219],"theoretically":[222],"grounded,":[223],"computationally":[224],"efficient":[225],"provable":[228],"optimality":[229],"generalization":[231],"guarantees.":[232]},"counts_by_year":[],"updated_date":"2026-03-04T07:09:34.246503","created_date":"2026-03-04T00:00:00"}