{"_canonicalization":{"envelope_id":"axm_ + sha256(envelope minus {signature, axiom_id, anchors})","envelope_signature":"ed25519(envelope minus {signature, axiom_id})","json":"sort_keys=True, separators=(',',':'), ensure_ascii=False, allow_nan=False, utf-8","leaf_hash":"sha256(0x00 || canonical_json(envelope_full))","seal_signature":"ed25519(seal minus {signature, sig_algorithm})"},"axiom_id":"axm_e1857ea45a528e7c782cc87a94b5a06ff6f58530c1c99d0daab91de3cd0dd35e","bitcoin_anchor":{"bitcoin_attestations":[],"calendar_attestations":[],"ots_url":"","stamped_at":"","status":"pending_next_stamp"},"envelope":{"anchors":[{"chain":"crovia.axiom_graph","height":0,"merkle_proof":"spider_vendor_press_v1","root_at_anchor":"spider_vendor_press_v1"}],"axiom_id":"axm_e1857ea45a528e7c782cc87a94b5a06ff6f58530c1c99d0daab91de3cd0dd35e","axiom_type":"AX.OBS","body":{"axiom_subtype":"news.vendor_press.v1","category":"news","fingerprint":"55ebf168bb3216487ae55d7d319f53bbce619142048ff44846c793a4cf9db1d5","published":"Sat, 06 Jun 2026 00:00:00 -0400","receipt_hash":"55ebf168bb3216487ae55d7d319f53bbce619142048ff44846c793a4cf9db1d5","schema":"spider.news.vendor_press.v1","spider":"vendor_press","spider_record":{"axiom_subtype":"news.vendor_press.v1","category":"news","decision_hint":"POSITIVE","envelope_target":"AX.OBS","fingerprint":"55ebf168bb3216487ae55d7d319f53bbce619142048ff44846c793a4cf9db1d5","observed_at":"2026-06-06T04:43:19.193968Z","parent_run_hash":"550d5b02674822f43975c282be668ca76a4d9c7c957eb1601ba8b07dcb67715e","published":"Sat, 06 Jun 2026 00:00:00 -0400","runtime_version":"0.1.0","schema":"spider.news.vendor_press.v1","source_status":200,"source_url":"https://export.arxiv.org/rss/cs.AI","spider":"vendor_press","summary_excerpt":"arXiv:2606.06154v1 Announce Type: new \nAbstract: Federated fine-tuning of foundation models using Low-Rank Adaptation (LoRA) offers a communication efficient solution for distributed learning. However, existing federated LoRA methods suffer from two fundamental limitations: (1) structural aggregation bias, where independently averaging low rank factors fails to approximate the true combined update, and (2) client side initialization lag, as clients repeatedly reinitialize LoRA parameters across communication rounds, slowing convergence. We propose HyperLoRA, a unified framework that addresses both issues through amortized federated adaptation through hypernetwork-driven LoRA generation and product space aggregation. Instead of iterative per-client optimization, HyperLoRA employs a learned generator that maps client distribution signatures to LoRA initializations, effectively amortizing per client adaptation. On the server side, we introduce a learned aggregation module that directly sy","title":"Amortizing Federated Adaptation: Hypernetwork Driven LoRA for Personalized Foundation Models","url":"https://arxiv.org/abs/2606.06154","vendor":"arxiv_cs_ai"},"summary":"arXiv:2606.06154v1 Announce Type: new \nAbstract: Federated fine-tuning of foundation models using Low-Rank Adaptation (LoRA) offers a communication efficient solution for distributed learning. However, existing federated LoRA methods suffer from two fundamental limitations: (1) structural aggregation bias, where independently averaging low rank factors fails to approximate the true combined update, and (2) client side initialization lag, as clients repeatedly reinitialize LoRA parameters across communication rounds, slowing convergence. We propose HyperLoRA, a unified framework that addresses both issues through amortized federated adaptation through hypernetwork-driven LoRA generation and product space aggregation. Instead of iterative per-client optimization, HyperLoRA employs a learned generator that maps client distribution signatures to LoRA initializations, effectively amortizing per client adaptation. On the server side, we introduce a learned aggregation module that directly sy","title":"Amortizing Federated Adaptation: Hypernetwork Driven LoRA for Personalized Foundation Models","vendor":"arxiv_cs_ai"},"confidence":{"method":"deterministic"},"decision":"POSITIVE","issued_at":"2026-06-06T04:43:19Z","notes":"Spider vendor_press (news) news.vendor_press.v1","object":{"captured_by":"crovia.spider.vendor_press","primary_source_url":"https://arxiv.org/abs/2606.06154"},"predecessors":[],"schema":"crovia.axiom.v1","signature":"ed25519:8746649c0db8a15a4172a01b46cac2b6157ab6af24607d84c843a7cf393a0cc793aa021061063ed1d63760fe1c69f6f589c2a7a0108cefeef9bd966393948c08","signer":"crovia.substrate","subject":{"observed_at":"2026-06-06T04:43:19Z","source_collector":"spider:vendor_press","target_id":"https://arxiv.org/abs/2606.06154"},"tsa":{"authority":"crovia.substrate.bootstrap","rfc3161_token":"{\"kind\":\"crovia.bootstrap.tsa\",\"source_jsonl\":\"/opt/crovia/spider/data/news/vendor_press_v1.jsonl\",\"source_seal_merkle_root\":\"spider_vendor_press_v1\",\"upgrade_path\":\"Sessione H \\u2014 OpenTimestamps weekly anchor\"}"},"zk_mode":"clear","zk_proof":null},"ledger":{"leaf_hash":"04f648945409f46ffff0fd89e598cac544b9ddd8e188bf16a6ee5e4925af2db2","leaf_index":219219,"ledger_path":"/opt/crovia/substrate/axiom_ledger.jsonl"},"merkle_proof":{"hash_alg":"sha256","leaf_prefix":"0x00","node_prefix":"0x01","odd_leaf_rule":"duplicate_last","path":[{"sibling":"9a71d51c973f5d9dd6ad0469ae2648b6f31d45cfae2f7063a0586448baa9b591","side":"left"},{"sibling":"d2f90ddd52e9e93ad9c939e8b9ad891bace378015f3ba743eeb4cc2ce137533e","side":"left"},{"sibling":"24220c8e117fd01cfe2cd9732d9e44a98236195a550d1dea2ad8299b15dc39b5","side":"right"},{"sibling":"fd9575f6a948714c1130b95611448d61f4fdc06ee3fa9ceac87178a2637d6086","side":"right"},{"sibling":"c0616cd686a7d38739929a6b6198928931be6abaab4234cb997a6de4159373b3","side":"left"},{"sibling":"54a29ea507e360ebe80a86f0756bc1afaf2a0bae92bafa210f0b67fa7c7e821e","side":"right"},{"sibling":"63213cfb37562a3ef2d70c7ab846d4203323a4985a9908a7078e73d8d4ab2f65","side":"left"},{"sibling":"8f35ffd1b994bec37a9cc24e0047790f92b64b006d85bef48f319d6d28a40687","side":"right"},{"sibling":"bd0dfa76bed61a2c5e95135a7304a2b8c4fd064958dbf768664232880d0abaa5","side":"right"},{"sibling":"84d2509eab51047589142ed6da8c496305d2fbcbe148e0e6755163db2c7a4bc4","side":"right"},{"sibling":"9e3ea17e834fab022f2eabcfedb8ea0ac95c1f9fb57edc5004dded68522d3c9e","side":"right"},{"sibling":"41d58fea95a95071715ee23ef8bcd15f5867a3639da28e62a0641bc95eb83094","side":"left"},{"sibling":"27ad9d6a9ab792d708709017242a61b9ca519da4e035f87a342811aae221d000","side":"left"},{"sibling":"5f303e2a7840c60038ff2d035b1cd911feefb0fba880de2d737c6671ace594d4","side":"right"},{"sibling":"b2590791b920ca2a4ed39de126d2c0b1a10d9e7e62f572f12425f214e767b6e1","side":"left"},{"sibling":"1a61eadbf0217d063ab78291ccafdc0c92907f7d6ccdc3357534ef89f07d78ae","side":"right"},{"sibling":"c300cf0154c136afc09b1702a0be98f4ba5b6dc5cf57e8cc714ec1eaf4196eff","side":"left"},{"sibling":"d841ad93efda0869e5eb97678f348f03f5caab4353e05ff4bf18f47fb945b822","side":"left"}]},"schema":"crovia.axiom_proof.v1","seal":{"first_collector_run_id":"","first_receipt_hash":"","jsonl_path":"/opt/crovia/substrate/axiom_ledger.jsonl","key_id":"430895f101d38164","last_collector_run_id":"","last_receipt_hash":"","leaf_count":219672,"merkle_root":"d3e32d3a61ca02ce6b1f0b2db86721107770b250e8a5bf762a2c225d2f03c870","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","run_id":"hourly_json_retrofit_20260606T053701Z","schema":"crovia.seal.v1","seal_family_version":"crovia-seal-family/1","seal_kind":"substrate_batch","sealed_at":"2026-06-06T05:38:35Z","sig_algorithm":"ed25519","signature":"dab214c2d4d857f01383c8e93a521a774b1aba60eaee5677d4e43e4074f0342b2c6a9b9bfcff0eba74f7ac81fcb490dd0e43727979c1a7e8979c7e11547fb101","signer_version":"1.1.0"},"trust_root":{"key_id":"430895f101d38164","public_key_hex":"cf742e26f75669dc673cb5c0786a1ae23ae8ca19c347317192ce40c28a7ff25c","signature_algorithm":"ed25519","url":"/registry/canon/TRUST_ROOT.md"},"verifier":{"spec":"/registry/canon/AXIOM_RECEIPT_v1.md","url":"/v/axm_e1857ea45a528e7c782cc87a94b5a06ff6f58530c1c99d0daab91de3cd0dd35e"}}