{"id":"https://openalex.org/W7128619427","doi":"https://doi.org/10.48550/arxiv.2602.09169","title":"Train Less, Infer Faster: Efficient Model Finetuning and Compression via Structured Sparsity","display_name":"Train Less, Infer Faster: Efficient Model Finetuning and Compression via Structured Sparsity","publication_year":2026,"publication_date":"2026-02-09","ids":{"openalex":"https://openalex.org/W7128619427","doi":"https://doi.org/10.48550/arxiv.2602.09169"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.09169","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088094106","display_name":"Jonathan Svirsky","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Svirsky, Jonathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125659457","display_name":"Yehonathan Refael","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Refael, Yehonathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5125663319","display_name":"Ofir Lindenbaum","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lindenbaum, Ofir","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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/T10028","display_name":"Topic Modeling","score":0.33799999952316284,"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/T10028","display_name":"Topic Modeling","score":0.33799999952316284,"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/T11307","display_name":"Domain Adaptation and Few-Shot Learning","score":0.13539999723434448,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.09399999678134918,"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/inference","display_name":"Inference","score":0.7300000190734863},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6018000245094299},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.565500020980835},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.5126000046730042},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4228000044822693},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.41850000619888306},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.39590001106262207},{"id":"https://openalex.org/keywords/structured-prediction","display_name":"Structured prediction","score":0.3538999855518341}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.833299994468689},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.7300000190734863},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6018000245094299},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.565500020980835},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.5126000046730042},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4228000044822693},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4219000041484833},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.41850000619888306},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.39590001106262207},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3919999897480011},{"id":"https://openalex.org/C22367795","wikidata":"https://www.wikidata.org/wiki/Q7625208","display_name":"Structured prediction","level":2,"score":0.3538999855518341},{"id":"https://openalex.org/C2776434776","wikidata":"https://www.wikidata.org/wiki/Q19246213","display_name":"Domain adaptation","level":3,"score":0.33820000290870667},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33649998903274536},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3325999975204468},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.303600013256073},{"id":"https://openalex.org/C135798126","wikidata":"https://www.wikidata.org/wiki/Q2167279","display_name":"Top-down and bottom-up design","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.27630001306533813},{"id":"https://openalex.org/C2777472644","wikidata":"https://www.wikidata.org/wiki/Q16968992","display_name":"Approximate inference","level":3,"score":0.27619999647140503},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.2655999958515167},{"id":"https://openalex.org/C137293760","wikidata":"https://www.wikidata.org/wiki/Q3621696","display_name":"Language model","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.26109999418258667},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.260699987411499},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.25049999356269836},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.25040000677108765}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.09169","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.09169","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.09169","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":"pmh:doi:10.48550/arxiv.2602.09169","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","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":{"Fully":[0],"finetuning":[1,79,110],"foundation":[2],"language":[3],"models":[4],"(LMs)":[5],"with":[6],"billions":[7],"of":[8,23,97,124],"parameters":[9,99],"is":[10],"often":[11],"impractical":[12],"due":[13],"to":[14,39,142],"high":[15],"computational":[16],"costs,":[17],"memory":[18,46],"requirements,":[19],"and":[20,48,63,94,114,129,137],"the":[21,40,122],"risk":[22],"overfitting.":[24],"Although":[25],"methods":[26],"like":[27],"low-rank":[28],"adapters":[29],"help":[30],"address":[31],"these":[32],"challenges":[33],"by":[34],"adding":[35],"small":[36],"trainable":[37,89],"modules":[38],"frozen":[41],"LM,":[42],"they":[43],"also":[44],"increase":[45],"usage":[47],"do":[49],"not":[50],"reduce":[51],"inference":[52,92],"latency.":[53],"We":[54,73],"uncover":[55],"an":[56],"intriguing":[57],"phenomenon:":[58],"sparsifying":[59],"specific":[60],"model":[61,98],"rows":[62],"columns":[64],"enables":[65],"efficient":[66],"task":[67],"adaptation":[68,154],"without":[69,100],"requiring":[70],"weight":[71],"tuning.":[72],"propose":[74],"a":[75,135,149],"scheme":[76],"for":[77,121,152],"effective":[78],"via":[80],"sparsification":[81],"using":[82],"training":[83],"stochastic":[84,126],"gates,":[85],"which":[86],"requires":[87],"minimal":[88],"parameters,":[90],"reduces":[91],"time,":[93],"removes":[95],"20--40\\%":[96],"significant":[101],"accuracy":[102],"loss.":[103],"Empirical":[104],"results":[105,145],"show":[106,130],"it":[107],"outperforms":[108],"recent":[109],"baselines":[111],"in":[112,155],"efficiency":[113],"performance.":[115],"Additionally,":[116],"we":[117],"provide":[118],"theoretical":[119],"guarantees":[120],"convergence":[123],"this":[125],"gating":[127],"process,":[128],"that":[131],"our":[132],"method":[133],"admits":[134],"simpler":[136],"better-conditioned":[138],"optimization":[139],"landscape":[140],"compared":[141],"LoRA.":[143],"Our":[144],"highlight":[146],"sparsity":[147],"as":[148],"compelling":[150],"mechanism":[151],"task-specific":[153],"LMs.":[156]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-02-12T00:00:00"}