{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:23:15Z","timestamp":1777890195915,"version":"3.51.4"},"reference-count":66,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iccv51701.2025.02066","type":"proceedings-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T19:45:49Z","timestamp":1777491949000},"page":"22252-22262","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Fine-Tuning of Large Models Via Nested Low-Rank Adaptation"],"prefix":"10.1109","author":[{"given":"Lujun","family":"Li","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dezhi","family":"Li","sequence":"additional","affiliation":[{"name":"Southeast University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You-Liang","family":"Huang","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Li","sequence":"additional","affiliation":[{"name":"University of Birmingham"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyu","family":"Wu","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Zou","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Xue","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sirui","family":"Han","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yike","family":"Guo","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10599-4_29"},{"key":"ref2","article-title":"Plot: Prompt learning with optimal transport for vision-language models","author":"Chen","year":"2022","journal-title":"arXiv preprint"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.461"},{"key":"ref4","article-title":"Training verifiers to solve math word problems","author":"Cobbe","year":"2021","journal-title":"arXiv preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-023-00626-4"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01145"},{"key":"ref7","article-title":"Pruner-zero: Evolving symbolic pruning metric from scratch for large language models","author":"Dong","year":"2024","journal-title":"ICML"},{"key":"ref8","article-title":"Stbllm: Breaking the 1 -bit barrier with structured binary 11 ms","author":"Dong","year":"2025","journal-title":"ICLR"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-023-01891-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.670"},{"key":"ref11","article-title":"Delta decompression for moebased 11 ms compression","author":"Gu","year":"2025","journal-title":"arXiv preprint"},{"key":"ref12","article-title":"Sara: Singular-value based adaptive low-rank adaption","author":"Gu","year":"2024","journal-title":"arXiv preprint"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.740"},{"key":"ref14","article-title":"Parameter-efficient fine-tuning for large models: A comprehensive survey","author":"Han","year":"2024","journal-title":"arXiv preprint"},{"key":"ref15","article-title":"Lora+: Efficient low rank adaptation of large models","author":"Hayou","year":"2024","journal-title":"arXiv preprint"},{"key":"ref16","article-title":"Towards a unified view of parameter-efficient transfer learning","author":"He","year":"2021","journal-title":"arXiv preprint"},{"key":"ref17","article-title":"Measuring mathematical problem solving with the math dataset","author":"Hendrycks","year":"2021","journal-title":"arXiv preprint"},{"key":"ref18","first-page":"2790","article-title":"Parameter-efficient transfer learning for nlp","volume-title":"International conference on machine learning","author":"Houlsby","year":"2019"},{"key":"ref19","article-title":"Lora: Low-rank adaptation of large language models","author":"Hu","year":"2021","journal-title":"arXiv preprint"},{"key":"ref20","article-title":"Lora: Low-rank adaptation of large language models","author":"Hu","year":"2021","journal-title":"arXiv preprint"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.319"},{"key":"ref22","article-title":"Mistral 7b","author":"Albert","year":"2023","journal-title":"arXiv preprint"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr52729.2023.01832"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2013.77"},{"key":"ref25","article-title":"Shadow knowledge distillation: Bridging offline and online knowledge transfer","author":"Li","year":"2022","journal-title":"NeuIPS"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01597"},{"key":"ref27","article-title":"Detkds: Knowledge distillation search for object detectors","author":"Li","year":"2024","journal-title":"ICML"},{"key":"ref28","article-title":"Discovering sparsity allocation for layer-wise pruning of large language models","author":"Li","year":"2024","journal-title":"NeuIPS"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-72652-1_3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-72652-1_2"},{"key":"ref31","article-title":"Als: Adaptive layer sparsity for large language models via activation correlation assessment","author":"Li","year":"2024","journal-title":"NeuIPS"},{"key":"ref32","article-title":"Structured mixture-of-experts LLMs compression via singular value decomposition","author":"Li","year":"2025","journal-title":"ICML"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.acl-long.353"},{"key":"ref34","article-title":"Sdxl-lightning: Progressive adversarial diffusion distillation","author":"Lin","year":"2024","journal-title":"arXiv preprint"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.52202\/068431-0142"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr52733.2024.02484"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.emnlp-main.81"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3560815"},{"key":"ref39","article-title":"Dora: Weight-decomposed low-rank adaptation","author":"Liu","year":"2024","journal-title":"arXiv preprint"},{"key":"ref40","article-title":"Dora: Weight-decomposed low-rank adaptation","author":"Liu","year":"2024","journal-title":"arXiv preprint"},{"key":"ref41","article-title":"Learn to explain: Multimodal reasoning via thought chains for science question answering","author":"Lu","year":"2022","journal-title":"NeurIPS"},{"key":"ref42","article-title":"A survey on lora of large language models","author":"Mao","year":"2024","journal-title":"arXiv preprint"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.52202\/079017-3846"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2012.6248092"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2021.eacl-main.39"},{"key":"ref46","article-title":"Sdxl: Improving latent diffusion models for high-resolution image synthesis","volume-title":"arXiv preprint","author":"Podell","year":"2023"},{"key":"ref47","first-page":"8748","article-title":"Learning transferable visual models from natural language supervision","volume-title":"International conference on machine learning","author":"Radford","year":"2021"},{"key":"ref48","article-title":"Flora: Low-rank core space for n -dimension","author":"Si","year":"2024","journal-title":"arXiv preprint"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00851"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1212.0402"},{"key":"ref51","article-title":"Dylora: Parameter efficient tuning of pre-trained models using dynamic search-free low-rank adaptation","author":"Valipour","year":"2022","journal-title":"arXiv preprint"},{"key":"ref52","article-title":"SVDLLM: Truncation-aware singular value decomposition for large language model compression","author":"Wang","year":"2025","journal-title":"ICLR"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2024.emnlp-main.450"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/cvpr52729.2023.00653"},{"key":"ref55","article-title":"Metamath: Bootstrap your own mathematical questions for large language models","author":"Yu","year":"2023","journal-title":"arXiv preprint"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01049"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2022.acl-short.1"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW63382.2024.00166"},{"key":"ref59","article-title":"Lora-fa: Memory-efficient low-rank adaptation for large language models fine-tuning","author":"Zhang","year":"2023","journal-title":"arXiv preprint"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2023.acl-short.107"},{"key":"ref61","article-title":"Adalora: Adaptive budget allocation for parameterefficient fine-tuning","author":"Zhang","year":"2023","journal-title":"arXiv preprint"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19833-5_29"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01631"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-022-01653-1"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV51070.2023.01435"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/3688863.3689575"}],"event":{"name":"2025 IEEE\/CVF International Conference on Computer Vision (ICCV)","location":"Honolulu, HI, USA","start":{"date-parts":[[2025,10,19]]},"end":{"date-parts":[[2025,10,25]]}},"container-title":["2025 IEEE\/CVF International Conference on Computer Vision (ICCV)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11443115\/11443287\/11445357.pdf?arnumber=11445357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T05:31:52Z","timestamp":1777613512000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11445357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":66,"URL":"https:\/\/doi.org\/10.1109\/iccv51701.2025.02066","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}