{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X2E3PX63SZDI663FVL76GPAV32","short_pith_number":"pith:X2E3PX63","schema_version":"1.0","canonical_sha256":"be89b7dfdb96468f7b65aaffe33c15deae939595f6805297425d66652c81e559","source":{"kind":"arxiv","id":"2406.11909","version":4},"attestation_state":"computed","paper":{"title":"Mixture-of-Subspaces in Low-Rank Adaptation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiahao Wang, Ngai Wong, Taiqiang Wu, Zhe Zhao","submitted_at":"2024-06-16T14:19:49Z","abstract_excerpt":"In this paper, we introduce a subspace-inspired Low-Rank Adaptation (LoRA) method, which is computationally efficient, easy to implement, and readily applicable to large language, multimodal, and diffusion models. Initially, we equivalently decompose the weights of LoRA into two subspaces, and find that simply mixing them can enhance performance. To study such a phenomenon, we revisit it through a fine-grained subspace lens, showing that such modification is equivalent to employing a fixed mixer to fuse the subspaces. To be more flexible, we jointly learn the mixer with the original LoRA weigh"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2406.11909","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2024-06-16T14:19:49Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"55778383c99679f9f57711ac1ebf10c6ae6c64691aa5af8af96ba090cf9d12f5","abstract_canon_sha256":"2a7a3f814d68f8f773b91a4e39fc5d3837dfe87eeeda607d5a7f72cc9f8b31b8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:01.217236Z","signature_b64":"3Go8yk3bs++53BGA5ogbLpXXoueDJWcVWN0zcmBfGChTviZYcDe9i98SR3as1hOOfXJjupPBknuTCkeWhtl+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be89b7dfdb96468f7b65aaffe33c15deae939595f6805297425d66652c81e559","last_reissued_at":"2026-07-05T10:22:01.216673Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:01.216673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixture-of-Subspaces in Low-Rank Adaptation","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Jiahao Wang, Ngai Wong, Taiqiang Wu, Zhe Zhao","submitted_at":"2024-06-16T14:19:49Z","abstract_excerpt":"In this paper, we introduce a subspace-inspired Low-Rank Adaptation (LoRA) method, which is computationally efficient, easy to implement, and readily applicable to large language, multimodal, and diffusion models. Initially, we equivalently decompose the weights of LoRA into two subspaces, and find that simply mixing them can enhance performance. To study such a phenomenon, we revisit it through a fine-grained subspace lens, showing that such modification is equivalent to employing a fixed mixer to fuse the subspaces. To be more flexible, we jointly learn the mixer with the original LoRA weigh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.11909","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2406.11909/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.11909","created_at":"2026-07-05T10:22:01.216737+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.11909v4","created_at":"2026-07-05T10:22:01.216737+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.11909","created_at":"2026-07-05T10:22:01.216737+00:00"},{"alias_kind":"pith_short_12","alias_value":"X2E3PX63SZDI","created_at":"2026-07-05T10:22:01.216737+00:00"},{"alias_kind":"pith_short_16","alias_value":"X2E3PX63SZDI663F","created_at":"2026-07-05T10:22:01.216737+00:00"},{"alias_kind":"pith_short_8","alias_value":"X2E3PX63","created_at":"2026-07-05T10:22:01.216737+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2506.21035","citing_title":"Little by Little: Continual Learning via Incremental Mixture of Rank-1 Associative Memory Experts","ref_index":79,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20189","citing_title":"SOLAR: A Self-Optimizing Open-Ended Autonomous Agent for Lifelong Learning and Continual Adaptation","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2403.14608","citing_title":"Parameter-Efficient Fine-Tuning for Large Models: A Comprehensive Survey","ref_index":91,"is_internal_anchor":false},{"citing_arxiv_id":"2604.11841","citing_title":"Polynomial Expansion Rank Adaptation: Enhancing Low-Rank Fine-Tuning with High-Order Interactions","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08368","citing_title":"SOLAR: Communication-Efficient Model Adaptation via Subspace-Oriented Latent Adapter Reparametrization","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32","json":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32.json","graph_json":"https://pith.science/api/pith-number/X2E3PX63SZDI663FVL76GPAV32/graph.json","events_json":"https://pith.science/api/pith-number/X2E3PX63SZDI663FVL76GPAV32/events.json","paper":"https://pith.science/paper/X2E3PX63"},"agent_actions":{"view_html":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32","download_json":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32.json","view_paper":"https://pith.science/paper/X2E3PX63","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.11909&json=true","fetch_graph":"https://pith.science/api/pith-number/X2E3PX63SZDI663FVL76GPAV32/graph.json","fetch_events":"https://pith.science/api/pith-number/X2E3PX63SZDI663FVL76GPAV32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32/action/storage_attestation","attest_author":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32/action/author_attestation","sign_citation":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32/action/citation_signature","submit_replication":"https://pith.science/pith/X2E3PX63SZDI663FVL76GPAV32/action/replication_record"}},"created_at":"2026-07-05T10:22:01.216737+00:00","updated_at":"2026-07-05T10:22:01.216737+00:00"}