{"id":"603b9d23-bf87-4f47-81d4-86127cb63d5e","arxiv_id":"2601.00549","paper_version":3,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"high","formal_verification":"none","parameter_count":7,"one_line_summary":"CoCo-Fed compresses each client's federated updates into a single fixed-size matrix via double low-rank projection and orthogonal superposition, cutting memory and backhaul traffic while maintaining convergence on an unsupervised AoA task.","lead":"CoCo-Fed is a federated-learning method for wireless edge networks that compresses each node's local gradient updates into one small matrix before sending them to a central server. It claims near-FedAvg accuracy with drastically lower memory and backhaul traffic, tested on an unsupervised angle-of-arrival estimation task.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Cross-layer interference is dropped in Theorem 4's key de-combination step (Eq. 68), so the constant-size communication claim is not actually supported for r_a < r N_W.","rationale":"The reader's weakest assumption identifies exactly the load-bearing issue: the near-orthogonality of the Gaussian submatrices V_l and the resulting omitted cross-layer interference in Eq. (68). The internal evidence in the paper supports this concern: Theorem 3 gives only a probabilistic element-wise bound on V^T V - I, and the proof of Theorem 4 then treats the de-combination as if V_l^T V_j were zero. At the simulated parameter values the cross terms are numerically comparable to the signal, so this is not a cosmetic gap. The local-memory part of the paper is more plausible and is supported by the simulations, which is why the overall verdict should remain CONDITIONAL rather than REJECT: the framework may work empirically, but the advertised theoretical guarantee and the claim of FedAvg-comparable accuracy under constant communication are not yet established. The proposed synthetic recovery test would settle whether the omitted interference actually degrades reconstruction at the tested operating points.","tokens_in":27163,"tokens_out":9665,"duration_ms":97447,"concrete_test":"Use the paper's default values (r=24, r_a=60, N_W=14, and the same Gaussian construction of V_l, P_l, Q_l) with synthetic low-rank layer updates Delta W_l whose Frobenius norms match the measured per-round update increments in Section VI. Form Delta W = sum_l V_l P_l Delta W_l Q_l V_l^T, compute the recovered update U_l = P_l^dagger V_l^T Delta W V_l Q_l^dagger, and measure ||U_l - Delta W_l||_F / ||Delta W_l||_F. Repeat for r_a = 40, 80, 100 and r = 4, 8, 16, 32. If the empirical relative error is not small or if it scales as N_W r^2 / r_a^2 rather than as 1 / ((2^{q_U}-1)(2^{q_D}-1)), then Eq. (68) is invalid and the constant-communication claim requires r_a to grow with r sqrt(N_W), not merely to be preset.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on recovering per-layer updates from the consolidated matrix Delta W = sum_j V_j P_j Delta W_j Q_j V_j^T. In Appendix E, Eq. (68) replaces P_l^dagger V_l^T Delta W V_l Q_l^dagger with P_l^dagger P_l Delta W_l Q_l Q_l^dagger and discards the sum over j != l. This is valid only if V_l^T V_j is negligible for j != l and V_l^T V_l is close to I_r. With V drawn i.i.d. from N(0, 1/r_a), every entry of V_l^T V_j has standard deviation 1/sqrt(r_a), so the Frobenius norm of the transfer matrix is about r/sqrt(r_a). At the paper's default parameters (r=24, r_a=60, N_W=14), this is about 3.1, and the expected relative magnitude of one cross-layer contribution to the reconstructed update is roughly (r/r_a) ||Delta W_j|| ~ 0.4 ||Delta W_j||. With 13 interfering layers, the accumulated interference is of the same order as the desired update. This term is absent from the final Theorem 4 bound, which contains only quantization-bit denominators. Thus the proof does not establish FedAvg-comparable accuracy for the regime actually simulated; the empirical stability does not fill that gap for general r_a, r, N_W combinations.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper proposes CoCo-Fed, a federated learning framework for O-RAN that (i) compresses local gradients to r×r via seed-generated random projections and runs the optimizer in this low-rank space, and (ii) superimposes per-layer updates into a single r_a×r_a matrix using Gaussian matrices, followed by quantization and aggregation. It claims memory O(r^2), communication independent of model size, and rigorous convergence under an unsupervised loss. The theoretical part contains a local convergence theorem for SGD with projections, a Gaussian orthogonality lemma, and an aggregation-error bound versus FedAvg. Experiments on an unsupervised AoA estimation task with a ViT backbone compare against LoRA, GaLore, Flora, and full fine-tuning under IID and non-IID settings.","tokens_in":27479,"tokens_out":10920,"duration_ms":103254,"significance":"If the claimed guarantees held, the paper would make a useful contribution: it unifies local memory reduction and communication compression in a way that standard PEFT/MEFT and quantization methods do not, and the 'superposition of layer updates' idea is an original combination of random projections and CDM-like signaling. The empirical study is extensive: it evaluates memory, communication bits, convergence, sensitivity to r, r_a, quantization bits, buffer size, and IID/non-IID conditions, and compares against three relevant baselines plus MUSIC. The paper is also transparent about the SGD-for-Adam simplification and about the performance gap relative to full fine-tuning. However, the load-bearing theoretical claim — that the constant-size transmission achieves FedAvg-comparable accuracy — rests on a proof step that discards the cross-layer interference, which is not negligible at the simulated parameters. The convergence theorem itself applies to a simplified optimizer and relies on assumptions not verified for the actual model. The empirical results are plausible and useful, but the theoretical guarantees are not yet established.","major_comments":[{"comment":"The proof of Theorem 4 drops the cross-layer interference term. In Eq. (68), P_l†∆WQ_l† is replaced by P_l†P_l∆W_lQ_lQ_l†, which is valid only if V_l^T V_j = 0 for j≠l. For V drawn i.i.d. N(0,1/r_a), the entries of V_l^T V_j have standard deviation 1/√r_a; with the default r=24, r_a=60, N_W=14, the expected relative magnitude of one interfering layer is ~r/r_a ≈ 0.4, and the accumulated interference is of the same order as the desired update. This term is absent from the final bound, so Theorem 4 does not support the claims in Section IV (constant-size upload with FedAvg-comparable accuracy) or the abstract. The authors need either to include the interference term in the bound (which will introduce a dependence on N_W r/r_a) or to restrict the claim to the strictly orthogonal regime r_a ≥ rN_W.","section":"Appendix E, Eq. (68); Section IV-D3"},{"comment":"Theorem 2 analyzes the SGD update W^(n)=W^(n-1)+ηP†PGQQ†, whereas the implemented local optimizer is Adam, defined in Eqs. (6)-(8). The text acknowledges this simplification, but the abstract and Section VII claim a rigorous convergence proof for CoCo-Fed without qualification. Since the proof does not cover the actual algorithm, the convergence guarantee is not established for the proposed method. If the claim is intended only as an analysis of the low-rank projection mechanism, it should be stated as such throughout.","section":"Section IV-D1 and Algorithm 1 / Eqs. (6)-(9)"},{"comment":"The proof of Theorem 2 has gaps that prevent it from being a rigorous guarantee. First, the gradient form in Theorem 1 is derived for a 'chained reversible' network, but the implementation uses a ViT; the paper cites GaLore for this transfer, but no verification is provided. Second, the contraction factor κ=η(C_G−(L_A+L_BD_WD_C)ε_P,Q) is not shown to be positive and less than 1; the proof requires this for the exponential decay in Eq. (20). Third, Eq. (38) computes E[X_Ci,l]=d(d+7) by effectively treating f^(n) and f^(n-1) as independent, although the features are deterministic functions of the previous weights. These unverified steps make the convergence statement an upper-bound exercise rather than a proof of convergence for the deployed model.","section":"Appendix B, Theorem 2"}],"minor_comments":[{"comment":"The statement of Theorem 3 is for one Gaussian matrix, not for the sub-matrices V_l used in the superposition. The text in Appendix E (around Eq. (68)) appears to apply it to V_l^T V_l'; this requires a separate bound on cross-Gram matrices. Also, the phrase '∥V_l^T V_l'−I_m∥_F→m for l≠l'' is not meaningful; presumably a typo for →0 or similar.","section":"Section IV-D2 / Theorem 3"},{"comment":"∆_c W_{k,l}=P_l∆W_{k,l}Q_l is exactly ηU_{k,l} because P_lP_l^T=I_r and Q_l^TQ_l=I_r; the ≈ sign is unnecessary and slightly misleading.","section":"Section IV-B, Eq. (12)"},{"comment":"The comparison of communication overhead in Table III would be clearer if the baseline bit counts were broken down into uplink and downlink separately with the number of clients K used; currently the percentages mix uplink and downlink, making it hard to verify the 1.33% figure.","section":"Section VI-B / Table III"},{"comment":"The axis label 'Transimission overhead (r'imes105' bits)' appears corrupted; it should be 'Transmission overhead (×10^5 bits)'.","section":"Figure 4(b)"},{"comment":"The conclusion states 'estimation accuracy comparable to full fine-tuning', but Figs. 3 and 5 show a consistent performance gap between CoCo-Fed and Full FT. This wording should be softened to 'with a small degradation' or similar.","section":"Section VII / Figs. 3-5"}],"recommendation":"major_revision","confidential_remarks":"The paper addresses a timely and practically relevant problem, and the empirical study is solid. The main concern is that the central theoretical claim is not supported by the proof as written because of the omitted cross-layer interference term in Theorem 4. This is a technical issue that could be addressed by revising the theorem and the claims, possibly at the cost of weakening the 'constant communication' guarantee. I do not see evidence of deliberate circularity; the mismatch between the SGD-based theory and the Adam-based implementation is openly acknowledged, though not reflected in the abstract. I recommend major revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: CoCo-Fed is a real engineering contribution with a theory section that overreaches. The genuinely new idea—superimposing per-layer low-rank updates into one r_a-by-r_a matrix using shared seeded Gaussian projectors, then extracting them by approximate orthogonality—is clever and well-motivated for bandwidth-limited O-RAN backhauls. The paper is worth reading for the protocol alone. The memory reduction from double down-projection is essentially GaLore with two projectors, which the authors largely acknowledge; the superposition part is the original bit.\n\nWhat it does well: the problem framing is concrete, the simulations are extensive (IID/non-IID, rank, quantization bits, buffer size, SNR), and the measured communication savings are large and credible. The seed-sharing design avoids storing projection matrices and keeps inference overhead zero. For practitioners this is a plausible way to train large models at gNBs.\n\nThe soft spots are in the theory, and they are not minor. Theorem 2 is an SGD contraction bound, not Adam as implemented, and the proof has an algebra slip: in the bound on the perturbed gradient, the eta belongs inside (1 - eta lambda) rather than outside, so the stated decay constant kappa is not what the calculation yields. More importantly, Theorem 4's discrepancy bound does not bound the actual scheme. In Appendix E, Eq. (68) drops the cross-layer interference terms sum_{j != l} V_l^T V_j ... by asserting approximate orthogonality of the V_l blocks. The stress-test arithmetic is right: with r=24, r_a=60 and 14 layers, E||V_l^T V_j||_F is about r/sqrt(r_a) ~ 3.1, and accumulated interference is the same order as the desired update. The final bound contains only quantization-bit denominators, so it cannot justify the claim of FedAvg-comparable accuracy for the simulated regime. The simulation results may still hold—the interference might behave like bounded noise in practice—but that is an empirical observation, not a proven guarantee.\n\nThere is also no code/data release and the low-rank FL baseline comparison could be broader, but those are fixable, not fatal.\n\nBottom line: for the O-RAN/FL community, the communication-combination protocol is worth serious referee time; for a theory venue, the convergence claims need substantial repair before they are credible. I would recommend conditional acceptance with major revision, focusing on Theorem 4 and the Theorem 2 algebra.","headline":"A genuinely useful communication-compression scheme for wireless FL whose main theoretical claim is not actually proven: the cross-layer interference that the de-combining step must tolerate is dropped in the key inequality.","tokens_in":28022,"tokens_out":3596,"would_cite":true,"duration_ms":39166,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"CoCo-Fed claims to make federated learning at the wireless edge both memory-efficient and communication-efficient in one framework: local optimizer states shrink to O(r²), and each node uploads a single consolidated r_a×r_a matrix per round","keywords":["federated learning","O-RAN","memory-efficient training","communication compression","low-rank gradient projection","orthogonal subspace superposition","unsupervised convergence","angle-of-arrival estimation"],"falsifier":"Take the exact V used in the simulations (r_a between 40 and 100), compute the Frobenius norm of V_l^T V_j for l≠j, and compare it with the signal term V_l^T V_l. If that cross-interference is not small relative to the layer-update norms, then the de-combination step V_l^T ΔW V_l injects uncontrolled noise, and the claimed constant-size communication with FedAvg-comparable accuracy would be refuted by a divergence between CoCo-Fed and full-precision FedAvg that does not shrink as r_a increases.","tokens_in":27002,"feed_emoji":"📡","tokens_out":6699,"duration_ms":61944,"temperature":0.7,"pith_summary":"This paper proposes CoCo-Fed, a method that attacks both bottlenecks of federated learning on resource-limited radio access nodes — local training memory and backhaul bandwidth — with one mechanism instead of separate tricks. Locally, gradients are double-down-projected to r×r matrices so optimizer states live in O(r²) space; globally, per-layer update increments are projected into near-orthogonal subspaces and superimposed into one consolidated matrix per node, so the uplink payload no longer depends on model depth or width. The authors prove convergence of the local low-rank updates and bound the difference between the aggregate update and standard FedAvg, attributing the residual error to quantization bit-widths. They validate on an unsupervised angle-of-arrival estimation task, reporting that transmission payload drops to about 1.33% of full fine-tuning while final MSE stays competitive, with stable convergence under both IID and non-IID data. If the central claim holds, large models can be fine-tuned on memory-limited gNBs without saturating backhaul links.","feed_headline":"Federated uploads shrink to one fixed-size matrix per node","feed_subtitle":"CoCo-Fed cuts local optimizer memory to O(r²) and proves convergence for fast, low-bandwidth edge learning.","key_machinery":"The workhorse is the low-rank projection pair (P_l, Q_l), generated seed-wise from truncated SVD of a random matrix so that no large projector needs to be stored, and the Gaussian mixing matrix V whose r-dimensional sub-blocks V_l superimpose layer-updates in a code-division-multiplexing-like manner. The local update rule W ← W + η P_l^† R Q_l^† keeps the optimizer states in r×r space, and the global combination ΔW = Σ_l V_l ΔW_l V_l^T packs the whole network's update into one r_a×r_a matrix. Recovery at the server uses V_l^T ΔW V_l, which isolates layer l when V_l^T V_j ≈ 0 for j≠l. Stochastic rounding quantization (both uplink and downlink) is the only other source of error in the Theorem","core_discovery":"The central claim is that a federated learning system can be designed so that both local memory and global communication scale with the projection rank r (or r_a), not with the model's layer dimensions. The mechanism is a double-dimension down-projection of gradients (P_l G Q_l) for the local optimizer, followed by an orthogonal subspace superposition of all layer updates into a single matrix per gNB (Σ_l V_l ΔW_l V_l^T). The paper argues that because the Gaussian sub-matrices V_l are approximately orthogonal, the consolidated matrix can be de-combined at the server into per-layer updates with bounded error. Theorem 4 gives a discrepancy bound versus FedAvg that depends on the number of quan","pith_inferences":["A direct testable extension is to always use strictly orthogonal V sub-blocks when r_a ≥ r·N_W (the paper's Case 1); if accuracy is unchanged relative to random Gaussian V, the random near-orthogonality is not essential, and the constant-size payload claim becomes unconditional.","The proof's reliance on near-orthogonality suggests a practical guardrail: monitor ‖V_l^T V_j‖ for the chosen r_a; when it is not negligible, the de-combination noise should be added to the error bound or compensated by a small correction step.","Because the per-round payload is constant in model size, the framework's advantage should grow for deeper/wider models; a natural next experiment is to increase model width while holding r_a fixed and verify that the MSE gap relative to full fine-tuning does not grow.","The same superposition idea could transfer to supervised federated learning, provided the local convergence theorem is re-derived without the unsupervised loss assumption; the communication-side mechanism is agnostic to the loss function."],"forward_implications":["Per-gNB uplink traffic becomes a single r_a×r_a matrix per round, so communication cost is independent of the number of layers and their dimensions; total uplink traffic is K r_a² and downlink is r_a².","Local optimizer memory drops to O(r²) per layer, and because the low-rank updates are merged back into the backbone weights, inference adds no extra parameters or latency.","If the near-orthogonality condition holds for the chosen r_a, the server-side de-combination recovers each layer's update with an error that shrinks as uplink/downlink quantization bits increase (Theorem 4).","The convergence analysis covers unsupervised training (reconstruction loss), which is the relevant setting for wireless sensing tasks where labels are unavailable.","Simulations on angle-of-arrival estimation show the framework converges under both IID and non-IID data distributions, with final accuracy approaching full fine-tuning as SNR grows."],"fun_headline_variants":["CoCo-Fed: double down-projection, single-matrix upload","One matrix per node: CoCo-Fed cuts memory and traffic","CoCo-Fed proves convergence with low-rank FL at the edge","Shrink federated updates to one matrix with CoCo-Fed","CoCo-Fed: efficient FL via compression and combination"],"cache_read_input_tokens":2304,"weakest_assumption_plain":"The whole recovery step hinges on the unquantified assumption that the Gaussian sub-matrices V_l are nearly orthogonal to each other (V_l^T V_j ≈ 0), and the proof drops the cross-layer interference term in Eq. (68) without including it in the Theorem 4 bound.","fun_headline_variants_meta":{"raw":{"variants":["CoCo-Fed: double down-projection, single-matrix upload","One matrix per node: CoCo-Fed cuts memory and traffic","CoCo-Fed proves convergence with low-rank FL at the edge","Shrink federated updates to one matrix with CoCo-Fed","CoCo-Fed: efficient FL via compression and combination"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000502,"raw_usage":{"total_tokens":2304,"prompt_tokens":774,"completion_tokens":1530,"prompt_tokens_details":{"cached_tokens":256},"prompt_cache_hit_tokens":256,"prompt_cache_miss_tokens":518,"completion_tokens_details":{"reasoning_tokens":1440}},"tokens_in":518,"tokens_out":1530,"duration_ms":14264,"temperature":1.0,"reasoning_tokens":1440,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-03T13:02:50.391822+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take the exact V used in the simulations (r_a between 40 and 100), compute the Frobenius norm of V_l^T V_j for l≠j, and compare it with the signal term V_l^T V_l. If that cross-interference is not small relative to the layer-update norms, then the de-combination step V_l^T ΔW V_l injects uncontrolled noise, and the claimed constant-size communication with FedAvg-comparable accuracy would be refuted by a divergence between CoCo-Fed and full-precision FedAvg that does not shrink as r_a increases.","supporting_citations":[],"review_version":1}