{"id":"c0c926bc484345ca7ac3e491ac6d58f88ab05e8bd9fa8f1e2c5e4bd403686e6f","title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","argument":"The authors propose FedFiOT, a method for combining client models in one-shot and few-round federated learning (FL), where a global model is built with only one or a few rounds of communication. They argue that direct averaging can fail because local training may place neurons that learn similar features in different positions, while local data differences can make corresponding parameters vary in importance. FedFiOT uses Fisher information to estimate parameter importance, then applies optimal transport to align neurons and guide aggregation. The authors say it jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective. They report that the optimization procedure monotonically decreases the layer-wise merging objective and establish a stationarity bound related to client heterogeneity and nonuniform Fisher information; the abstract’s description of the bound is cut off. Across multiple datasets, they report consistent improvements over competing baselines in both one-shot and few-round settings. The abstract does not give dataset names, numerical results, or details that would show how large or practically meaningful those improvements are. The paper’s stated contribution is a way to address neuron mismatch and unequal parameter importance when limited communication makes frequent synchronization—","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The available evidence is the arXiv abstract, not the full paper; it does not identify the datasets or give numerical results, so the size and practical significance of the reported improvements cannot be assessed here. The abstract’s sentence about the stationarity bound is truncated after “nonuniform Fisher,” leaving its full description unavailable. The abstract also does not provide details of the experiments or competing baselines.","speaker":{"name":"Nguyen, Quan Minh, Ngo, Hoang M., Chowkwale, Bhakti, Keshtkarjahromi, Yasaman, Thai, My T.","roleAtSource":"Article author"},"source":{"title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.06783","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors say one-shot and few-round federated learning reduce communication but often perform worse than conventional multi-round federated learning.","excerpt":"reduce communication burden by constructing a global model within one or a few communication rounds, but often achieve lower performance than conventional multi-round FL","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors attribute problems with direct averaging to neuron misalignment across clients and differences in parameter importance caused by local data heterogeneity.","excerpt":"direct averaging to combine mismatched neurons and assign equal weight to parameters despite differences in their importance","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"FedFiOT uses Fisher information to estimate parameter importance and guide neuron alignment and model aggregation.","excerpt":"leverages Fisher information to quantify parameter importance and guide neuron alignment and model aggregation","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors report that FedFiOT jointly optimizes neuron correspondences and global model parameters using alternating minimization of a shared Fisher-weighted objective.","excerpt":"jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors report consistent improvements over competing baselines in one-shot and few-round federated learning across multiple datasets.","excerpt":"across multiple datasets demonstrate consistent improvements over competing baselines in both one-shot and few-round federated learning settings","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors say the optimization monotonically decreases the layer-wise merging objective and establish a stationarity bound, but the abstract’s description of what the bound quantifies is incomplete in the retrieved text.","excerpt":"monotonically decreases the layer-wise merging objective and establish a stationarity bound that quantifies the effects of client heterogeneity and nonuniform Fisher","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06783","checkedAt":"2026-11-10T03:48:08.280Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Which datasets and measured results support the reported improvements, and how large are those gains over the competing baselines?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","summary":"The authors propose FedFiOT, a method for combining client models in one-shot and few-round federated learning (FL), where a global model is built with only one or a few rounds of communication. They argue that direct averaging can fail because local training may place neurons that learn similar features in different positions, while local data differences can make corresponding parameters vary in importance. FedFiOT uses Fisher information to estimate parameter importance, then applies optimal transport to align neurons and guide aggregation. The authors say it jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective. They report that the optimization procedure monotonically decreases the layer-wise merging objective and establish a stationarity bound related to client heterogeneity and nonuniform Fisher information; the abstract’s description of the bound is cut off. Across multiple datasets, they report consistent improvements over competing baselines in both one-shot and few-round settings. The abstract does not give dataset names, numerical results, or details that would show how large or practically meaningful those improvements are. The paper’s stated contribution is a way to address neuron mismatch and unequal parameter importance when limited communication makes frequent synchronization—","question":"Which datasets and measured results support the reported improvements, and how large are those gains over the competing baselines?","claims":[{"text":"The authors say one-shot and few-round federated learning reduce communication but often perform worse than conventional multi-round federated learning.","excerpt":"reduce communication burden by constructing a global model within one or a few communication rounds, but often achieve lower performance than conventional multi-round FL","support":"source-stated"},{"text":"The authors attribute problems with direct averaging to neuron misalignment across clients and differences in parameter importance caused by local data heterogeneity.","excerpt":"direct averaging to combine mismatched neurons and assign equal weight to parameters despite differences in their importance","support":"source-stated"},{"text":"FedFiOT uses Fisher information to estimate parameter importance and guide neuron alignment and model aggregation.","excerpt":"leverages Fisher information to quantify parameter importance and guide neuron alignment and model aggregation","support":"source-stated"},{"text":"The authors report that FedFiOT jointly optimizes neuron correspondences and global model parameters using alternating minimization of a shared Fisher-weighted objective.","excerpt":"jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective","support":"source-stated"},{"text":"The authors report consistent improvements over competing baselines in one-shot and few-round federated learning across multiple datasets.","excerpt":"across multiple datasets demonstrate consistent improvements over competing baselines in both one-shot and few-round federated learning settings","support":"source-stated"},{"text":"The authors say the optimization monotonically decreases the layer-wise merging objective and establish a stationarity bound, but the abstract’s description of what the bound quantifies is incomplete in the retrieved text.","excerpt":"monotonically decreases the layer-wise merging objective and establish a stationarity bound that quantifies the effects of client heterogeneity and nonuniform Fisher","support":"source-stated"}],"limitations":["The available evidence is the arXiv abstract, not the full paper; it does not identify the datasets or give numerical results, so the size and practical significance of the reported improvements cannot be assessed here.","The abstract’s sentence about the stationarity bound is truncated after “nonuniform Fisher,” leaving its full description unavailable. The abstract also does not provide details of the experiments or competing baselines."],"mediaId":"b398408e63df19d6871c1c0cb2a7992705195269ec30d974136ba854774b1cdf","correctionReason":null,"id":"c0c926bc484345ca7ac3e491ac6d58f88ab05e8bd9fa8f1e2c5e4bd403686e6f","publicationId":"404b7124-9714-4c8a-82cd-e911963348ca","version":1,"sourceUrl":"https://arxiv.org/abs/2611.06783","sourceTitle":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-05T05:00:34.682Z","createdAt":"2026-11-10T03:17:53.274Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"b398408e63df19d6871c1c0cb2a7992705195269ec30d974136ba854774b1cdf","kind":"article","url":"https://arxiv.org/abs/2611.06783","sourceUrl":"https://arxiv.org/abs/2611.06783","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-10T03:17:06.499Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06783","checkedAt":"2026-11-10T03:48:08.280Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"b398408e63df19d6871c1c0cb2a7992705195269ec30d974136ba854774b1cdf","confidence":0.75,"provider":"typesafe","model":"jev-1.13.0","inputHash":"3154b20539c61df4b8db431fa2122a07c9851ea805b34f104b4d8df3a113017f","decidedAt":"2026-11-10T03:17:07.323Z"},"provenance":{"textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observationId":"3260c4a8866a672e794871fb44cabe6a0cc2d8014b857c318950bf29fd68afdf","retrievedAt":"2026-11-10T03:17:06.399Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"aa516341-90e9-43fa-8cb1-927d47cc760b"},"reviewer":{"model":"gpt-6-luna","runId":"3cb6dcc5-d965-479d-8b92-b0b6fd89208d"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-10T03:17:53.274Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Nguyen, Quan Minh","url":null,"kind":"unknown"},{"name":"Ngo, Hoang M.","url":null,"kind":"unknown"},{"name":"Chowkwale, Bhakti","url":null,"kind":"unknown"},{"name":"Keshtkarjahromi, Yasaman","url":null,"kind":"unknown"},{"name":"Thai, My T.","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Nguyen, Quan Minh","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Nguyen, Quan Minh","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Ngo, Hoang M.","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Ngo, Hoang M.","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Chowkwale, Bhakti","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Chowkwale, Bhakti","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Keshtkarjahromi, Yasaman","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Keshtkarjahromi, Yasaman","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Thai, My T.","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Thai, My T.","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:4","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}}],"participationCoverage":{"total":5,"returned":5,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.06783","snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z","basis":"publisher-page-metadata","sourceLinks":46,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/c0c926bc484345ca7ac3e491ac6d58f88ab05e8bd9fa8f1e2c5e4bd403686e6f/source"}},"canonicalUrl":"https://escapemeridian.com/readings/fedfiot-fisher-weighted-optimal-transport-for-model-merging-in-c0c926bc","formats":{"html":"/readings/fedfiot-fisher-weighted-optimal-transport-for-model-merging-in-c0c926bc","markdown":"/readings/fedfiot-fisher-weighted-optimal-transport-for-model-merging-in-c0c926bc.md","json":"/readings/fedfiot-fisher-weighted-optimal-transport-for-model-merging-in-c0c926bc.json"},"attribution":"Headline and summary by Escape Meridian, prepared by Luna from the attributed source. A source check is not independent confirmation of the source’s claims.","maintainedGuideLinks":[],"readerContext":{"version":"reader-context-v1","attribution":"Reference context selected by Escape Meridian; separate from source evidence. Entity mentions do not establish authorship, involvement or endorsement.","terms":[{"id":"term-parameters","name":"Model parameters","explanation":"The internal numbers a model adjusts during training; their count is a rough measure of a model's size.","referenceUrl":"https://developers.google.com/machine-learning/glossary#parameter"}],"entities":[{"id":"arxiv","name":"arXiv","kind":"organization","context":"arXiv is a research manuscript repository where authors share papers that may not yet have been peer reviewed.","referenceUrls":["https://arxiv.org/","https://info.arxiv.org/help/api/index.html"],"path":"/entities/arxiv","json":"/entities/arxiv.json","markdown":"/entities/arxiv.md"}]},"researchQuestions":[],"withdrawn":false,"references":{"schemaVersion":1,"target":{"type":"reading","id":"c0c926bc484345ca7ac3e491ac6d58f88ab05e8bd9fa8f1e2c5e4bd403686e6f","revision":"404b7124-9714-4c8a-82cd-e911963348ca","revisionKind":"publication-id","title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","url":"https://escapemeridian.com/readings/fedfiot-fisher-weighted-optimal-transport-for-model-merging-in-c0c926bc"},"source":{"type":"source","id":"https://arxiv.org/abs/2611.06783","revision":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","revisionKind":"sha256-source-text","title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","url":"https://arxiv.org/abs/2611.06783"},"status":"available","items":[],"next":null,"scope":"Explicit citations in public readings and public file attachments to this reading. Shared topics are not citations. Other artifact types need an explicit reference adapter."},"revisions":[{"id":"c0c926bc484345ca7ac3e491ac6d58f88ab05e8bd9fa8f1e2c5e4bd403686e6f","title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","argument":"The authors propose FedFiOT, a method for combining client models in one-shot and few-round federated learning (FL), where a global model is built with only one or a few rounds of communication. They argue that direct averaging can fail because local training may place neurons that learn similar features in different positions, while local data differences can make corresponding parameters vary in importance. FedFiOT uses Fisher information to estimate parameter importance, then applies optimal transport to align neurons and guide aggregation. The authors say it jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective. They report that the optimization procedure monotonically decreases the layer-wise merging objective and establish a stationarity bound related to client heterogeneity and nonuniform Fisher information; the abstract’s description of the bound is cut off. Across multiple datasets, they report consistent improvements over competing baselines in both one-shot and few-round settings. The abstract does not give dataset names, numerical results, or details that would show how large or practically meaningful those improvements are. The paper’s stated contribution is a way to address neuron mismatch and unequal parameter importance when limited communication makes frequent synchronization—","topicIds":["intelligence-and-discovery"],"domain":"science","claimType":"attributed reading","limits":"The available evidence is the arXiv abstract, not the full paper; it does not identify the datasets or give numerical results, so the size and practical significance of the reported improvements cannot be assessed here. The abstract’s sentence about the stationarity bound is truncated after “nonuniform Fisher,” leaving its full description unavailable. The abstract also does not provide details of the experiments or competing baselines.","speaker":{"name":"Nguyen, Quan Minh, Ngo, Hoang M., Chowkwale, Bhakti, Keshtkarjahromi, Yasaman, Thai, My T.","roleAtSource":"Article author"},"source":{"title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","publisher":"arXiv cs.AI","format":"Article","url":"https://arxiv.org/abs/2611.06783","publishedAt":"2026-11-04","dateBasis":"Date basis not provided."},"evidence":[{"text":"The authors say one-shot and few-round federated learning reduce communication but often perform worse than conventional multi-round federated learning.","excerpt":"reduce communication burden by constructing a global model within one or a few communication rounds, but often achieve lower performance than conventional multi-round FL","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors attribute problems with direct averaging to neuron misalignment across clients and differences in parameter importance caused by local data heterogeneity.","excerpt":"direct averaging to combine mismatched neurons and assign equal weight to parameters despite differences in their importance","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"FedFiOT uses Fisher information to estimate parameter importance and guide neuron alignment and model aggregation.","excerpt":"leverages Fisher information to quantify parameter importance and guide neuron alignment and model aggregation","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors report that FedFiOT jointly optimizes neuron correspondences and global model parameters using alternating minimization of a shared Fisher-weighted objective.","excerpt":"jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors report consistent improvements over competing baselines in one-shot and few-round federated learning across multiple datasets.","excerpt":"across multiple datasets demonstrate consistent improvements over competing baselines in both one-shot and few-round federated learning settings","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"},{"text":"The authors say the optimization monotonically decreases the layer-wise merging objective and establish a stationarity bound, but the abstract’s description of what the bound quantifies is incomplete in the retrieved text.","excerpt":"monotonically decreases the layer-wise merging objective and establish a stationarity bound that quantifies the effects of client heterogeneity and nonuniform Fisher","url":"https://arxiv.org/abs/2611.06783","relationship":"Source-stated"}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06783","checkedAt":"2026-11-10T03:48:08.280Z","items":[],"note":"No suitable media was found by the supported page extraction."},"assumptions":[],"openQuestion":{"attribution":"Open question","text":"Which datasets and measured results support the reported improvements, and how large are those gains over the competing baselines?"},"whatWouldChangeView":{"attribution":"Change condition not recorded","text":""},"editorialComparisons":[],"live":{"title":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","summary":"The authors propose FedFiOT, a method for combining client models in one-shot and few-round federated learning (FL), where a global model is built with only one or a few rounds of communication. They argue that direct averaging can fail because local training may place neurons that learn similar features in different positions, while local data differences can make corresponding parameters vary in importance. FedFiOT uses Fisher information to estimate parameter importance, then applies optimal transport to align neurons and guide aggregation. The authors say it jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective. They report that the optimization procedure monotonically decreases the layer-wise merging objective and establish a stationarity bound related to client heterogeneity and nonuniform Fisher information; the abstract’s description of the bound is cut off. Across multiple datasets, they report consistent improvements over competing baselines in both one-shot and few-round settings. The abstract does not give dataset names, numerical results, or details that would show how large or practically meaningful those improvements are. The paper’s stated contribution is a way to address neuron mismatch and unequal parameter importance when limited communication makes frequent synchronization—","question":"Which datasets and measured results support the reported improvements, and how large are those gains over the competing baselines?","claims":[{"text":"The authors say one-shot and few-round federated learning reduce communication but often perform worse than conventional multi-round federated learning.","excerpt":"reduce communication burden by constructing a global model within one or a few communication rounds, but often achieve lower performance than conventional multi-round FL","support":"source-stated"},{"text":"The authors attribute problems with direct averaging to neuron misalignment across clients and differences in parameter importance caused by local data heterogeneity.","excerpt":"direct averaging to combine mismatched neurons and assign equal weight to parameters despite differences in their importance","support":"source-stated"},{"text":"FedFiOT uses Fisher information to estimate parameter importance and guide neuron alignment and model aggregation.","excerpt":"leverages Fisher information to quantify parameter importance and guide neuron alignment and model aggregation","support":"source-stated"},{"text":"The authors report that FedFiOT jointly optimizes neuron correspondences and global model parameters using alternating minimization of a shared Fisher-weighted objective.","excerpt":"jointly optimizes neuron correspondences and global model parameters through alternating minimization of a shared Fisher-weighted objective","support":"source-stated"},{"text":"The authors report consistent improvements over competing baselines in one-shot and few-round federated learning across multiple datasets.","excerpt":"across multiple datasets demonstrate consistent improvements over competing baselines in both one-shot and few-round federated learning settings","support":"source-stated"},{"text":"The authors say the optimization monotonically decreases the layer-wise merging objective and establish a stationarity bound, but the abstract’s description of what the bound quantifies is incomplete in the retrieved text.","excerpt":"monotonically decreases the layer-wise merging objective and establish a stationarity bound that quantifies the effects of client heterogeneity and nonuniform Fisher","support":"source-stated"}],"limitations":["The available evidence is the arXiv abstract, not the full paper; it does not identify the datasets or give numerical results, so the size and practical significance of the reported improvements cannot be assessed here.","The abstract’s sentence about the stationarity bound is truncated after “nonuniform Fisher,” leaving its full description unavailable. The abstract also does not provide details of the experiments or competing baselines."],"mediaId":"b398408e63df19d6871c1c0cb2a7992705195269ec30d974136ba854774b1cdf","correctionReason":null,"id":"c0c926bc484345ca7ac3e491ac6d58f88ab05e8bd9fa8f1e2c5e4bd403686e6f","publicationId":"404b7124-9714-4c8a-82cd-e911963348ca","version":1,"sourceUrl":"https://arxiv.org/abs/2611.06783","sourceTitle":"FedFiOT: Fisher-Weighted Optimal Transport for Model Merging in One-Shot and Few-Round Federated Learning","publisher":"arXiv cs.AI","publishedAt":null,"originalPublished":{"value":"2026-11-04","precision":"day","basis":"publisher_citation_date"},"firstObservedAt":"2026-11-05T05:00:34.682Z","createdAt":"2026-11-10T03:17:53.274Z","historical":true,"entityIds":["arxiv"],"topicIds":["intelligence-and-discovery"],"media":[{"id":"b398408e63df19d6871c1c0cb2a7992705195269ec30d974136ba854774b1cdf","kind":"article","url":"https://arxiv.org/abs/2611.06783","sourceUrl":"https://arxiv.org/abs/2611.06783","label":"Read original","provenance":"source_link","verification":{"status":"verified","checkedAt":"2026-11-10T03:17:06.499Z","method":"acquired_source","contentType":"text/html"},"recommendationReason":"Recommended by Jev for understanding this source; checked by Luna."}],"sourceMedia":{"status":"not_found","sourceUrl":"https://arxiv.org/abs/2611.06783","checkedAt":"2026-11-10T03:48:08.280Z","items":[],"note":"No suitable media was found by the supported page extraction."},"editorialDecision":{"outcome":"accept","reasonCodes":["material_development"],"rubricVersion":"stream-admission-v5","mediaId":"b398408e63df19d6871c1c0cb2a7992705195269ec30d974136ba854774b1cdf","confidence":0.75,"provider":"typesafe","model":"jev-1.13.0","inputHash":"3154b20539c61df4b8db431fa2122a07c9851ea805b34f104b4d8df3a113017f","decidedAt":"2026-11-10T03:17:07.323Z"},"provenance":{"textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observationId":"3260c4a8866a672e794871fb44cabe6a0cc2d8014b857c318950bf29fd68afdf","retrievedAt":"2026-11-10T03:17:06.399Z","kind":"publisher-page","preparer":{"model":"gpt-6-luna","runId":"aa516341-90e9-43fa-8cb1-927d47cc760b"},"reviewer":{"model":"gpt-6-luna","runId":"3cb6dcc5-d965-479d-8b92-b0b6fd89208d"}},"audit":{"status":"uncertain","reviewedAt":"2026-11-10T03:17:53.274Z","model":"anthropic/claude-opus-5.5"},"sourceAttribution":{"authors":[{"name":"Nguyen, Quan Minh","url":null,"kind":"unknown"},{"name":"Ngo, Hoang M.","url":null,"kind":"unknown"},{"name":"Chowkwale, Bhakti","url":null,"kind":"unknown"},{"name":"Keshtkarjahromi, Yasaman","url":null,"kind":"unknown"},{"name":"Thai, My T.","url":null,"kind":"unknown"}],"authorRole":"article-author","hosts":[],"status":"stated","authorRoster":{"truncated":false,"omitted":0,"assertionGroupsOmitted":0},"participation":[{"actor":{"name":"Nguyen, Quan Minh","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Nguyen, Quan Minh","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:0","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Ngo, Hoang M.","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Ngo, Hoang M.","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:1","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Chowkwale, Bhakti","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Chowkwale, Bhakti","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:2","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Keshtkarjahromi, Yasaman","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Keshtkarjahromi, Yasaman","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:3","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}},{"actor":{"name":"Thai, My T.","url":null,"kind":"unknown","actorId":null},"role":"author","scope":{"kind":"work-credit","locator":null},"literalCredit":"Thai, My T.","status":"stated","provenance":{"basis":"head-meta","sourceUrl":"https://arxiv.org/abs/2611.06783","locator":"head/meta[name=author|citation_author]"},"assertionId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88:participation:4","identity":{"version":"entity-identity-v1","status":"unresolved","actorId":null,"canonicalActorId":null,"candidateActorIds":[],"assertions":[],"sourceObservedAt":"2026-11-10T03:48:08.280Z","knowledgeAsOf":null},"sourceVersion":{"snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","sourceUrl":"https://arxiv.org/abs/2611.06783","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z"}}],"participationCoverage":{"total":5,"returned":5,"complete":true,"fullAssertions":"source-metadata-endpoint"},"distribution":null,"publisher":null,"sourceUrl":"https://arxiv.org/abs/2611.06783","snapshotId":"8c9b9ce4812cde1c910c8b7768ab68e9be024156d344811d8b14e3f4cb53ce88","contentSha256":"3130caf2a59f0ba014274cca448a59c8b2fb17ac2a9290e864f9cd99e085ca0f","textHash":"50415715d42d49d701776f5f4fbc710f07609cddd5d3a32d91f15177dd4abfc8","observedAt":"2026-11-10T03:48:08.280Z","basis":"publisher-page-metadata","sourceLinks":46,"linksTruncated":false,"metadataUrl":"/api/pipeline/stream/c0c926bc484345ca7ac3e491ac6d58f88ab05e8bd9fa8f1e2c5e4bd403686e6f/source"}}}],"audits":[{"publicationId":"404b7124-9714-4c8a-82cd-e911963348ca","verdict":"uncertain","findings":[{"dimension":"attribution","status":"pass","explanation":"The reading attributes the method, the reasoning, the theoretical results and the experimental claims to the arXiv paper's authors. It does not present them as established fact.","excerpt":"Authors:Quan Minh Nguyen, Hoang M. Ngo, Bhakti Chowkwale, Yasaman Keshtkarjahromi, My T. Thai"},{"dimension":"summary","status":"uncertain","explanation":"The summary ends mid-sentence ('makes frequent synchronization—'), leaving the final significance statement incomplete. Smallest repair: complete or remove that sentence. Central terms such as Fisher information, optimal transport, neurons and stationarity bound, plus federated learning's local clients, are not explained for non-specialists. Add plain-language glosses or term-library tooltips without paraphrasing the terms.","excerpt":null},{"dimension":"date","status":"pass","explanation":"The originalPublished date of 2026-11-04 matches the arXiv v1 submission date. It is not the later feed date.","excerpt":"[Submitted on 4 Nov 2026]"},{"dimension":"support","status":"pass","explanation":"Each claim matches the abstract, and the excerpts are exact substrings. The limitations accurately note that the abstract gives no dataset names or numbers. The bound sentence is garbled in the retrieved text, so calling it cut off is reasonable. The question follows from these gaps.","excerpt":"Together, these challenges cause direct averaging to combine mismatched neurons and assign equal weight to parameters despite differences in their importance."},{"dimension":"media","status":"pass","explanation":"The selected media is the verified direct link to the original arXiv abstract page. This is the most direct access to the source.","excerpt":null}],"createdAt":"2026-11-10T03:17:53.274Z","model":"anthropic/claude-opus-5.5"}],"correctionUrl":"https://escapemeridian.com/corrections/"}