{"id":"https://openalex.org/W4416035958","doi":"https://doi.org/10.18653/v1/2025.findings-emnlp.66","title":"Minimal Ranks, Maximum Confidence: Parameter-efficient Uncertainty Quantification for LoRA","display_name":"Minimal Ranks, Maximum Confidence: Parameter-efficient Uncertainty Quantification for LoRA","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416035958","doi":"https://doi.org/10.18653/v1/2025.findings-emnlp.66"},"language":"en","primary_location":{"id":"doi:10.18653/v1/2025.findings-emnlp.66","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2025.findings-emnlp.66","pdf_url":"https://aclanthology.org/2025.findings-emnlp.66.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: EMNLP 2025","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://aclanthology.org/2025.findings-emnlp.66.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5094227771","display_name":"Patryk Marsza\u0142ek","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patryk Marsza\u0142ek","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091000494","display_name":"Klaudia Ba\u0142azy","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Klaudia Ba\u0142azy","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052791052","display_name":"Jacek Tabor","orcid":"https://orcid.org/0000-0001-6652-7727"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jacek Tabor","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5064829424","display_name":"Tomasz Ku\u015bmierczyk","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tomasz Ku\u015bmierczyk","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6879,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.89091956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1260","last_page":"1271"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.1842000037431717,"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.1842000037431717,"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.16850000619888306,"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.1378999948501587,"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/calibration","display_name":"Calibration","score":0.7059000134468079},{"id":"https://openalex.org/keywords/uncertainty-quantification","display_name":"Uncertainty quantification","score":0.6111000180244446},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5910999774932861},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.52920001745224},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.5223000049591064},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.49619999527931213},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.450300008058548},{"id":"https://openalex.org/keywords/bayesian-inference","display_name":"Bayesian inference","score":0.40290001034736633},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3817000091075897}],"concepts":[{"id":"https://openalex.org/C165838908","wikidata":"https://www.wikidata.org/wiki/Q736777","display_name":"Calibration","level":2,"score":0.7059000134468079},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.635699987411499},{"id":"https://openalex.org/C32230216","wikidata":"https://www.wikidata.org/wiki/Q7882499","display_name":"Uncertainty quantification","level":2,"score":0.6111000180244446},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5910999774932861},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.52920001745224},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.5223000049591064},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.49619999527931213},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.450300008058548},{"id":"https://openalex.org/C160234255","wikidata":"https://www.wikidata.org/wiki/Q812535","display_name":"Bayesian inference","level":3,"score":0.40290001034736633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39820000529289246},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3871000111103058},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3817000091075897},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.33550000190734863},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.33059999346733093},{"id":"https://openalex.org/C177803969","wikidata":"https://www.wikidata.org/wiki/Q29205","display_name":"Uncertainty analysis","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C137800194","wikidata":"https://www.wikidata.org/wiki/Q11713455","display_name":"Interpolation (computer graphics)","level":3,"score":0.2915000021457672},{"id":"https://openalex.org/C63002673","wikidata":"https://www.wikidata.org/wiki/Q2260590","display_name":"Scoring rule","level":2,"score":0.28540000319480896},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.28450000286102295},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28279998898506165},{"id":"https://openalex.org/C167928553","wikidata":"https://www.wikidata.org/wiki/Q1376021","display_name":"Estimation theory","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.2741999924182892},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.2718000113964081},{"id":"https://openalex.org/C137209882","wikidata":"https://www.wikidata.org/wiki/Q1403517","display_name":"Measurement uncertainty","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.2696000039577484},{"id":"https://openalex.org/C94361409","wikidata":"https://www.wikidata.org/wiki/Q7882500","display_name":"Uncertainty reduction theory","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.25360000133514404}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.18653/v1/2025.findings-emnlp.66","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2025.findings-emnlp.66","pdf_url":"https://aclanthology.org/2025.findings-emnlp.66.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: EMNLP 2025","raw_type":"proceedings-article"},{"id":"pmh:oai:ruj.uj.edu.pl:item/567919","is_oa":true,"landing_page_url":"https://aclanthology.org/2025.findings-emnlp.66/","pdf_url":"http://ruj.uj.edu.pl/bitstreams/3c19f7df-55d5-488e-b280-eae1a55fd565/download","source":{"id":"https://openalex.org/S4306400316","display_name":"Homo Politicus (Academy of Humanities and Economics in Lodz)","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-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publikacja pokonferencyjna"}],"best_oa_location":{"id":"doi:10.18653/v1/2025.findings-emnlp.66","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2025.findings-emnlp.66","pdf_url":"https://aclanthology.org/2025.findings-emnlp.66.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: EMNLP 2025","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1529061280","display_name":null,"funder_award_id":"945339","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320326815","display_name":"Infrastruktura PL-Grid","ror":null},{"id":"https://openalex.org/F4320337160","display_name":"Academic Computer Centre Cyfronet, AGH University of Science and Technology","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4416035958.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Low-Rank":[0],"Adaptation":[1],"(LoRA)":[2],"enables":[3],"parameter-efficient":[4,83],"fine-tuning":[5],"of":[6,41,50,55,126],"large":[7],"language":[8],"models":[9,66],"by":[10],"decomposing":[11],"weight":[12,128,142],"updates":[13],"into":[14],"low-rank":[15],"matrices,":[16],"significantly":[17,52],"reducing":[18],"storage":[19],"and":[20,35,71,111,140],"computational":[21,115],"overhead.":[22],"While":[23],"effective,":[24],"standard":[25],"LoRA":[26,42,85],"lacks":[27],"mechanisms":[28],"for":[29],"uncertainty":[30,92,131],"quantification,":[31],"leading":[32],"to":[33,69],"overconfident":[34],"poorly":[36],"calibrated":[37],"models.":[38],"Bayesian":[39,84],"variants":[40],"address":[43],"this":[44,77],"limitation,":[45],"but":[46],"at":[47],"the":[48,60,123,127],"cost":[49],"a":[51,81,137],"increased":[53],"number":[54],"trainable":[56],"parameters,":[57],"partially":[58],"offsetting":[59],"original":[61],"efficiency":[62],"gains.":[63],"Additionally,":[64],"these":[65],"are":[67],"harder":[68],"train":[70],"may":[72],"suffer":[73],"from":[74],"unstable":[75],"convergence.In":[76],"work,":[78],"we":[79],"propose":[80],"novel":[82],"via":[86],"subspace":[87],"inference,":[88],"demonstrating":[89],"that":[90],"effective":[91],"quantification":[93],"can":[94,132],"be":[95,133],"achieved":[96],"in":[97,136],"very":[98],"low-dimensional":[99,138],"parameter":[100],"spaces.":[101],"The":[102],"proposed":[103],"method":[104],"achieves":[105],"strong":[106],"performance":[107],"with":[108,122],"improved":[109],"calibration":[110],"generalization":[112],"while":[113],"maintaining":[114],"efficiency.":[116],"Our":[117],"empirical":[118],"findings":[119],"show":[120],"that,":[121],"appropriate":[124],"projection":[125],"space:":[129],"(1)":[130],"effectively":[134],"modeled":[135],"space,":[139],"(2)":[141],"covariances":[143],"exhibit":[144],"low":[145],"ranks.":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-11-08T00:00:00"}