Pith. sign in

REVIEW 4 major objections 5 minor 202 references

Sheaf-Based Federated Representation Learning

T0 review · 4 major / 5 minor · reviewed 2026-08-12 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read A learnable sheaf glues together heterogeneous federated latent spaces, with provable convergence.

desk verdict Promising sheaf-based federated representation learning idea, but the convergence theorems analyze a gradient step that Algorithm 1 does not compute — a load-bearing mismatch. read the letter →

arxiv 2608.10016 v1 pith:BNP3AIUB submitted 2026-08-08 cs.LG cs.AIcs.MAeess.SP

Gabriele D'Acunto , Enrico Grimaldi , Valeria Avino , Mario Edoardo Pandolfo , Leonardo Di Nino , Sergio Barbarossa , Paolo Di Lorenzo This is my paper · ORCID
classification cs.LGcs.AIcs.MAeess.SP
keywords federatedrepresentationlearningnetworksheafLaplaciansemanticalignmentStiefelmanifoldorthogonalProcrustescommunicationdecentralizedoptimization
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that heterogeneous agents—differing in data, architectures, and latent dimensions—can learn interoperable representations without being forced into a shared latent space. Its proposal, SFRL, treats each agent's latent space as the stalk of a learnable network sheaf and penalizes misalignment across edges with a quadratic sheaf-total-variation term evaluated on a small set of shared pilots. The accompanying decentralized algorithm, Sheaf-FRL, alternates local gradient steps with closed-form Procrustes updates of orthogonal and Stiefel restriction maps, and the paper proves convergence to first-order stationary points in both deterministic and stochastic settings. On MNIST cooperative classification with semantic communication, the paper reports that Sheaf-FRL beats ComFed, Sheaf-FMTL, FedProto, and FedMuscle in private and communication accuracy and degrades more gracefully under latent compression. If true, this would make semantic alignment across heterogeneous federated systems a practical alternative to shared-latent-space assumptions.

What carries the argument

The central object is a network sheaf on the agent graph: each node i carries a latent space F(i) ~ $R^{{d_i}}$, each edge carries a stalk of dimension max(d_i,d_j), and restriction maps are orthogonal matrices O_{ji} in O(d_i) and Stiefel matrices V_{ij} in St(d_i,d_j). The coboundary operator $\Delta$ and sheaf Laplacian L_F = $\Delta$^T $\Delta$ define the total variation TV(z) = ||$\Delta$ z||^2 = sum_{e_ij} ||O_{ji} z_i - V_{ij} z_j||^2; after reparameterization this becomes sum_{e_ij} ||z_i - V_{ij} z_j||^2 under an "embedding orientation" from lower- to higher-dimensional stalks. The gluing penalty evaluates this on K shared pilot feature matrices A_i, and the restriction maps are updated by closed-form (semi-)orthogonal Procrustes solutions from thin SVDs of the cross-covariances A_i A_j^T.

What would settle it

Run the MNIST benchmark with the pilot indices randomly permuted per agent so the shared correspondence is broken while everything else stays fixed: if SFRL's communication accuracy does not collapse toward the non-cooperative baseline, the alignment penalty is not doing the claimed work. Alternatively, remove each encoder's whitening layer and retrain; a failure of communication accuracy to degrade would falsify the geometric-comparability premise.

Watch

Extended reading notes

Core claim

The paper claims that federated representation learning can be posed as Problem (SFRL): minimize local objectives plus a sheaf-total-variation gluing penalty evaluated on K shared pilots, with restriction maps constrained to orthogonal and Stiefel manifolds. It then claims that the decentralized alternating algorithm Sheaf-FRL—gradient updates on local models and closed-form Procrustes updates on edge maps—converges to first-order stationary points in both deterministic and stochastic settings (Theorems E.2–E.4). On MNIST semantic-communication benchmarks, the paper reports that Sheaf-FRL achieves higher private and communication accuracy than ComFed, Sheaf-FMTL, FedProto, and FedMuscle, and that its advantage grows with distribution shift and with latent-space compression.

Load-bearing premise

The load-bearing premise is that agents share a small set of aligned pilot samples and that each encoder ends in a whitening layer, so transported latent representations are comparable on a common Euclidean reference; if either fails, the gluing penalty and the convergence analysis have nothing to act on.

Editorial extensions

If this is right

  • Agents with different latent dimensionalities can exchange task-relevant representations through isometric embeddings, so model heterogeneity no longer forces a shared latent space.
  • Communication per round scales as O(d_i K) because only K pilot embeddings are broadcast to neighbors.
  • The alternating scheme converges to first-order stationary points at O(1/T) in the deterministic case and O(1/sqrt(T)) in the stochastic case.
  • On the MNIST semantic-communication benchmark, the communication-accuracy gap over ComFed, Sheaf-FMTL, FedProto, and FedMuscle widens with distribution shift, and accuracy degrades gracefully as the bottleneck dimension drops toward 16.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper, the pilot mechanism suggests that a small public calibration set is enough to glue private latent spaces across organizations, enabling model interoperability without exposing weights or raw data.
  • Beyond the paper, the whitening-layer premise is testable: SFRL's communication-accuracy advantage should shrink when encoders lack whitening, which practitioners can verify before adopting the method.
  • Beyond the paper, the same sheaf gluing penalty could be ported to federated self-supervised learning, where common augmentations rather than shared labeled samples could define the pilots.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. The paper introduces Sheaf-based Federated Representation Learning (SFRL), a framework in which each agent learns its own latent space and inter-agent consistency is encouraged through learnable orthogonal/Stiefel restriction maps and a quadratic gluing penalty built on a sheaf Laplacian. The penalty is evaluated on a small shared set of pilot samples. The authors propose Sheaf-FRL, a decentralized alternating algorithm with closed-form Procrustes updates for the restriction maps and gradient updates for local models, and prove convergence to first-order stationary points in deterministic and stochastic settings (Theorems E.2-E.4). Experiments on MNIST in a semantic-communication setup compare private and communication accuracy against ComFed, Sheaf-FMTL, FedProto, FedMuscle, and a non-cooperative baseline, and report robustness to latent-space compression.

Significance. If the convergence claim is valid, SFRL is a useful generalization of federated representation learning: it removes the shared-latent-space assumption, handles heterogeneous dimensions via Stiefel maps, and its pilot-based gluing penalty keeps communication cost O(d_i K). The closed-form Procrustes updates are standard and correctly derived, the convergence proofs are coherent under the stated assumptions, and the paper provides pseudocode, appendix derivations, and a public code link. The experimental design has a clear application setting. However, the convergence theorem currently does not apply to the update implemented in Algorithm 1 (the gradient of R_A is incomplete), and the empirical comparison lacks error bars and uses a memory-constrained hyperparameter for Sheaf-FMTL. These issues are correctable but must be addressed before the central claims can be accepted.

major comments (4)
  1. [Section 5.2, Eqs. (19)-(21); Appendix E, Eqs. (27)-(29)] The update implemented in Algorithm 1 (line 19) is theta_i^{t+1} = theta_i^t - eta (nabla_{theta_i} L_i(theta_i^t) + r_i^t) with r_i = [nabla_{phi_i} R_{A|i}; 0]. The convergence theorems analyze the update theta^{t+1} = theta^t - eta nabla_theta J(theta^t, V^t) with J = sum_i L_i + R_A and R_A = sum_i R_{A|i}. These two updates are not equal. For each edge (i,j), the residual ||A_i - V_ij A_j||^2 contributes to both R_{A|i} (with weight lambda_i/(2K)) and R_{A|j} (with weight lambda_j/(2K)); the full gradient of R_A with respect to phi_i therefore contains, for each neighbor j, the additional term (lambda_j/K) sum_{k in A} (nabla_{phi_i} f(x^k_i))^T (f(x^k_i) - V_ij f(x^k_j)), which Eq. (19) omits. Consequently, the descent lemma in Theorem E.2 and the stochastic rates in Theorems E.3-E.4 do not apply to Algorithm 1 as written. The manuscript should either correct the algorithm to use the full gradient of R_A (the missing terms are locally computable from neighbor pilot features and lambda_j) or re-derive the convergence analysis for the actual update.
  2. [Section 6 and Appendix G, Figs. 2 and 4] Sheaf-FMTL is evaluated at gamma = 10^{-3}, a value selected because larger gamma values exceed available memory, not because it is a good operating point for the method. The paper states that the memory ceiling binds 'well before any accuracy trade-off becomes relevant.' The reported underperformance of Sheaf-FMTL in communication accuracy may therefore reflect the memory-imposed compression of its restriction maps rather than a property of the method. Please provide results for Sheaf-FMTL under a fair memory regime (e.g., reduced architectures, gradient checkpointing, or model-parallel storage) or demonstrate that the gap persists when gamma is chosen by validation without memory constraints.
  3. [Section 6, Figs. 2-3] All accuracy curves are point estimates with no error bars or multiple seeds. In Fig. 2 the private-accuracy differences between Sheaf-FRL and the best baseline are typically below one percentage point; without variance information the claim of consistent improvement is not statistically supported. Please report means and standard deviations over at least three to five independent runs (with different data partitions and initializations) in both the private and communication accuracy plots, and state the number of seeds explicitly.
  4. [Section 4, Eq. (14); Appendix B] The gluing penalty R_A, the Procrustes updates, and the convergence analysis all require a globally shared set of pilot indices A with known correspondence across agents. The paper only states this 'for the sake of exposition.' Because the method cannot be applied at all when no shared calibration data exist, this is a substantive assumption of Problem (SFRL) and should be stated as such in the main text, together with a discussion of failure modes when the pilot correspondence is imperfect.
minor comments (5)
  1. [Section 6] The hyperparameter lambda selected by the grid search is never reported for any method or configuration; please report the chosen values.
  2. [Appendix E, Theorem E.4] The result is lim inf of the gradient norm, not convergence of the gradient sequence; the conclusions should refer to 'lim inf stationarity' in the stochastic case.
  3. [Section 3, Eq. (10)] The symbol V_ij is reused after the reparameterization V_ij = O_ji^T V_ij with a different meaning than in Eq. (5); please introduce a new symbol or explicitly state the rename to avoid confusion.
  4. [Appendix G, Fig. 4] The caption says 'System RAM (31 GB)' while the text discusses GPU RAM; please clarify which memory resource is the binding constraint.
  5. [Section 5.2, after Eq. (19)] The sentence 'both incoming and outgoing contributions admit a unified expression' applies to R_{A|i} only; please make this scope explicit in the main text.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular reduction found: convergence analysis is a standard block-coordinate descent argument and experimental accuracies are external test-set measurements; the Algorithm 1 vs. Theorem E.2 gradient mismatch is a correctness gap, not a circularity.

full rationale

The paper's central derivation is not circular. Problem (SFRL) is stated independently of the algorithm; the V-block is updated by closed-form Procrustes solutions that are exact minimizers of the decoupled per-edge terms of R_A, and Theorems E.2-E.4 are standard descent and Robbins-Siegmund arguments that do not assume their own conclusions. Reported accuracies are computed on private test sets disjoint from the pilot data, with the regularization coefficient selected by validation grid search, so no reported accuracy is a fitted value relabeled as a prediction. The semantic-embedding principle is cited to the authors' own prior work (D'Acunto et al., 2025; 2026), but it motivates the orientation convention rather than carrying the convergence or experimental claims; this is a minor non-load-bearing self-citation and does not by itself constitute circularity. Separately, and explicitly not as a circularity finding: there is a genuine mismatch between Algorithm 1 and the update analyzed in Appendix E. Equation (21) uses r_i = [∇_{φ_i} R_{A|i}; 0], while Theorem E.2 analyzes θ^{t+1} = θ^t - η ∇_θ J(θ^t, V^t) with J = Σ_i L_i + R_A and R_A = Σ_i R_{A|i}. Since R_{A|j} for a neighbor j also depends on φ_i through A_i, the full gradient of R_A with respect to φ_i contains additional terms, proportional to λ_j, that Eq. (19) omits. This is an inconsistency between the implemented update and the theorem's premise, not an equivalence by construction, so it does not raise the circularity score.

Assumptions & free parameters 4 free parameters · 6 assumptions · 0 invented entities

No new physical entities are introduced. The network sheaf, pilots, and restriction maps are existing mathematical or engineering concepts. The load-bearing assumptions are the availability of shared aligned pilots, the whitening/coloring architecture, and standard smoothness conditions for the convergence analysis.

free parameters (4)
  • lambda (regularization weight) = grid searched in [1e-5, 1]
    Controls the strength of the sheaf gluing penalty in (SFRL); the reported accuracies depend on this choice and the text does not specify whether selection is on a validation split.
  • K (number of pilots) = 10% of the global training pool in the experiments
    Pilot set size trades communication cost against alignment quality; chosen as a fixed subset in Appendix G without a principled selection rule.
  • SGD hyperparameters (learning rate, momentum, weight decay) = 1e-2, 0.9, 5e-4
    Used for all local model updates in Algorithm 1; standard but necessary to reproduce the empirical results.
  • whitening layer parameters = fitted on the pilot set
    Each encoder is assumed to end in a whitening layer that approximately zero-centers and decorrelates latent features; these parameters are learned from pilot data and are load-bearing for the geometric interpretation of the restriction maps.
assumptions (6)
  • standard math Network sheaf formalism with node stalks, edge stalks, and linear restriction maps
    Used in Sec. 3 to model heterogeneous latent spaces; standard mathematical background cited to Curry (2014) and Hansen & Ghrist (2019).
  • domain assumption Existence of a shared aligned pilot set with known sample correspondence
    Sec. 4 and App. B assume a common index set A of pilot samples across agents; without this shared calibration data the gluing penalty R_A cannot be evaluated.
  • domain assumption Each encoder includes a whitening layer approximating zero mean and identity covariance, and each head includes an inverse coloring layer
    Sec. 3, 'Heterogeneous latent space geometry', assumes this architecture so that transported representations are comparable on a common Euclidean reference.
  • domain assumption Latent representations are identifiable only up to orthogonal or Stiefel transformations
    Sec. 3 and related work (Wang & Isola 2020; Moschella et al. 2023) justify modeling alignment via rotations, reflections, and isometric embeddings.
  • standard math Smoothness, boundedness, and exact V-minimization assumptions for convergence
    Assumptions 1-4 in App. E are standard nonconvex optimization assumptions; they are stated but not verified for the specific neural networks used in the experiments.
  • ad hoc to paper Semantic embedding principle
    Sec. 4 invokes this principle from the authors' prior work (D'Acunto et al., 2025; 2026) to justify the orientation of edges from lower- to higher-dimensional latent spaces.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sheaf-Based Federated Representation Learning." pith.science (2026). https://pith.science/paper/BNP3AIUB

@misc{pith2026260810016,
  author       = {Pith},
  title        = {Pith review of: Sheaf-Based Federated Representation Learning},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/BNP3AIUB}},
  note         = {Machine review of arXiv:2608.10016}
}
read the original abstract

Heterogeneous federated systems require agents to learn and exchange informative representations despite differences in data distributions, sensing modalities, model architectures, latent dimensionalities, and local learning objectives. To address this challenge, we propose Sheaf-based Federated Representation Learning (SFRL), a general framework that jointly optimizes local objectives with a manifold-constrained geometric alignment regularizer based on learnable sheaf restriction maps. Unlike most existing approaches, SFRL does not assume a shared global latent space. Instead, global consistency emerges from the alignment of neighboring latent representations through orthogonal transformations and isometric embeddings. This alignment is enforced by a quadratic gluing regularizer induced by the sheaf Laplacian, whose learnable restriction maps adapt the geometry to the observed data. The penalty is evaluated on a small set of shared pilot samples, ensuring scalability and communication efficiency. We develop a decentralized algorithm for solving SFRL, termed Sheaf-FRL, which alternates between gradient updates of the local models and closed-form Procrustes updates of the edge-wise restriction maps. We further establish convergence of Sheaf-FRL to first-order stationary points in both deterministic and stochastic settings. As an application, we consider a cooperative classification task in the context of semantic communication, under model and data heterogeneity. Our results show that Sheaf-FRL outperforms baseline approaches in terms of local and post-communication classification accuracy across different levels of local distribution shift and exhibits greater robustness to latent-space dimensionality compression.

Figures

Figures reproduced from arXiv: 2608.10016 by the authors.

Figure 1
Figure 1. An illustration of our sheaf-based representation learning framework. In this example, we [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Average private accuracy (left) and average communication accuracy (right) against the [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Average private accuracy (left) and average communication accuracy (right) against the [PITH_FULL_IMAGE:figures/full_fig_p013_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Aggregate memory footprint of the Sheaf-FMTL restriction maps [PITH_FULL_IMAGE:figures/full_fig_p031_4.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

202 extracted references · 58 canonical work pages

  1. [1]

    Absil, Robert Mahony, and Rodolphe Sepulchre

    P.-A. Absil, Robert Mahony, and Rodolphe Sepulchre. Optimization Algorithms on Matrix Manifolds. Princeton University Press, 2008

    2008

  2. [2]

    Communication-efficient and robust multi-modal federated learning via latent-space consensus

    Mohamed Badi, Chaouki Ben Issaid, and Mehdi Bennis. Communication-efficient and robust multi-modal federated learning via latent-space consensus. IEEE Wireless Communications Letters, pp.\ 1--1, 2026. doi:10.1109/LWC.2026.3676885

    work page arXiv 2026

  3. [3]

    Bandeira, Amit Singer, and Daniel A

    Afonso S. Bandeira, Amit Singer, and Daniel A. Spielman. A C heeger inequality for the graph connection L aplacian. SIAM Journal on Matrix Analysis and Applications, 34 0 (4): 0 1611--1630, 2013. doi:10.1137/120875338

    doi:10.1137/120875338 2013

  4. [4]

    Semantic communications based on adaptive generative models and information bottleneck

    Sergio Barbarossa, Danilo Comminiello, Eleonora Grassucci, Francesco Pezone, Stefania Sardellitti, and Paolo Di Lorenzo. Semantic communications based on adaptive generative models and information bottleneck. IEEE Communications Magazine, 61 0 (11): 0 36--41, 2023

    2023

  5. [5]

    Sheaf neural networks with connection L aplacians

    Federico Barbero, Cristian Bodnar, Haitz S \'a ez de Oc \'a riz Borde, Michael Bronstein, Petar Veli c kovi \'c , and Pietro Li \`o . Sheaf neural networks with connection L aplacians. In Topological, Algebraic and Geometric Learning Workshops 2022, pp.\ 28--36. PMLR, 2022

    2022

  6. [6]

    First-order methods in optimization

    Amir Beck. First-order methods in optimization. SIAM, 2017

    2017

  7. [7]

    Bronstein

    Cristian Bodnar, Francesco Di Giovanni, Benjamin Paul Chamberlain, Pietro Li \` o , and Michael M. Bronstein. Neural sheaf diffusion: A topological perspective on heterophily and oversmoothing in GNNs . In Advances in Neural Information Processing Systems (NeurIPS), 2022. URL https://dblp.org/rec/conf/nips/BodnarGCLB22

    2022

  8. [8]

    Sheaf theory, volume 170

    Glen E Bredon. Sheaf theory, volume 170. Springer Science & Business Media, 1997

    1997

Show all 202 references
  1. [9]

    Multimodal federated learning: A survey

    Liwei Che, Jiaqi Wang, Yao Zhou, and Fenglong Ma. Multimodal federated learning: A survey. Sensors, 23 0 (15): 0 6986, 2023

    2023

  2. [10]

    Ranking and sparsifying a connection graph

    Fan Chung, Wenbo Zhao, and Mark Kempton. Ranking and sparsifying a connection graph. Internet Mathematics, 10 0 (1-2): 0 87--115, 2014

    2014

  3. [11]

    Exploiting shared representations for personalized federated learning

    Liam Collins, Hamed Hassani, Aryan Mokhtari, and Sanjay Shakkottai. Exploiting shared representations for personalized federated learning. In Proceedings of the 38th International Conference on Machine Learning (ICML), volume 139 of PMLR, 2021

    2021

  4. [12]

    Sheaves, cosheaves and applications

    Justin Michael Curry. Sheaves, cosheaves and applications. PhD thesis, University of Pennsylvania, 2014

    2014

  5. [13]

    Causal abstraction learning based on the semantic embedding principle

    Gabriele D'Acunto, Fabio Massimo Zennaro, Yorgos Felekis, and Paolo Di Lorenzo. Causal abstraction learning based on the semantic embedding principle. In Forty-second International Conference on Machine Learning, 2025. URL https://openreview.net/forum?id=J16AIOkjjY

    2025

  6. [15]

    Learning sheaf L aplacian optimizing restriction maps

    Leonardo Di Nino, Sergio Barbarossa, and Paolo Di Lorenzo. Learning sheaf L aplacian optimizing restriction maps. In 2024 58th Asilomar Conference on Signals, Systems, and Computers, pp.\ 59--63. IEEE, 2024

    2024

  7. [16]

    Learning the structure of connection graphs

    Leonardo Di Nino, Gabriele D’Acunto, Sergio Barbarossa, and Paolo Di Lorenzo. Learning the structure of connection graphs. In ICASSP 2026-2026 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp.\ 76--80. IEEE, 2026

    2026

  8. [17]

    HeteroFL : Computation and communication efficient federated learning for heterogeneous clients

    Enmao Diao, Jie Ding, and Vahid Tarokh. HeteroFL : Computation and communication efficient federated learning for heterogeneous clients. In International Conference on Learning Representations (ICLR), 2021

    2021

  9. [18]

    A new look and convergence rate of federated multitask learning with L aplacian regularization

    Canh T Dinh, Tung T Vu, Nguyen H Tran, Minh N Dao, and Hongyu Zhang. A new look and convergence rate of federated multitask learning with L aplacian regularization. IEEE Transactions on Neural Networks and Learning Systems, 35 0 (6): 0 8075--8085, 2022

    2022

  10. [19]

    Federated contrastive learning for decentralized unlabeled medical images

    Nanqing Dong and Irina Voiculescu. Federated contrastive learning for decentralized unlabeled medical images. In International Conference on Medical Image Computing and Computer-Assisted Intervention, pp.\ 378--387. Springer, 2021

    2021

  11. [20]

    Arias, and Steven T

    Alan Edelman, Tom \'a s A. Arias, and Steven T. Smith. The geometry of algorithms with orthogonality constraints. SIAM Journal on Matrix Analysis and Applications, 20 0 (2): 0 303--353, 1998. doi:10.1137/S0895479895290954

    1998 doi

  12. [21]

    Regularized multi--task learning

    Theodoros Evgeniou and Massimiliano Pontil. Regularized multi--task learning. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.\ 109--117, 2004

    2004

  13. [22]

    Learning multiple tasks with kernel methods

    Theodoros Evgeniou, Charles A Micchelli, Massimiliano Pontil, and John Shawe-Taylor. Learning multiple tasks with kernel methods. Journal of Machine Learning Research, 6 0 (4), 2005

    2005

  14. [23]

    Dynamic relative representations for goal-oriented semantic communications

    Simone Fiorellino, Claudio Battiloro, Emilio Calvanese Strinati, and Paolo Di Lorenzo. Dynamic relative representations for goal-oriented semantic communications. In Proc. IEEE EUSIPCO, pp.\ 2107--2111, 2024

    2024

  15. [24]

    Frame-based zero-shot semantic channel equalization for AI -native communications

    Simone Fiorellino, Claudio Battiloro, Emilio Calvanese Strinati, and Paolo Di Lorenzo. Frame-based zero-shot semantic channel equalization for AI -native communications. IEEE Transactions on Cognitive Communications and Networking, 2026

    2026

  16. [25]

    Model inversion attacks that exploit confidence information and basic countermeasures

    Matt Fredrikson, Somesh Jha, and Thomas Ristenpart. Model inversion attacks that exploit confidence information and basic countermeasures. In Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS), pp.\ 1322--1333, 2015

    2015

  17. [26]

    Sheaf A lign: A sheaf-theoretic framework for decentralized multimodal alignment

    Abdulmomen Ghalkha, Zhuojun Tian, Chaouki Ben Issaid, and Mehdi Bennis. Sheaf A lign: A sheaf-theoretic framework for decentralized multimodal alignment. IEEE Communications Letters, 2026

    2026

  18. [27]

    Learning network sheaves for AI -native semantic communication

    Enrico Grimaldi, Mario Edoardo Pandolfo, Gabriele D’Acunto, Sergio Barbarossa, and Paolo Di Lorenzo. Learning network sheaves for AI -native semantic communication. In 2025 59th Asilomar Conference on Signals, Systems, and Computers, pp.\ 1692--1696. IEEE, 2025

    2025

  19. [28]

    Beyond transmitting bits: Context, semantics, and task-oriented communications

    Deniz G \"u nd \"u z, Zhijin Qin, Inaki Estella Aguerri, Harpreet S Dhillon, Zhaohui Yang, Aylin Yener, Kai Kit Wong, and Chan-Byoung Chae. Beyond transmitting bits: Context, semantics, and task-oriented communications. IEEE Journal on Selected Areas in Communications, 41 0 (1...

    2022

  20. [29]

    Fedx: Unsupervised federated learning with cross knowledge distillation

    Sungwon Han, Sungwon Park, Fangzhao Wu, Sundong Kim, Chuhan Wu, Xing Xie, and Meeyoung Cha. Fedx: Unsupervised federated learning with cross knowledge distillation. In European Conference on Computer Vision, pp.\ 691--707. Springer, 2022

    2022

  21. [30]

    Toward a spectral theory of cellular sheaves

    Jakob Hansen and Robert Ghrist. Toward a spectral theory of cellular sheaves. Journal of Applied and Computational Topology, 3 0 (4): 0 315--358, 2019

    2019

  22. [31]

    u ttebr \

    Tom \'a s H \"u ttebr \"a ucker, Simone Fiorellino, Mohamed Sana, Paolo Di Lorenzo, and Emilio Calvanese Strinati. Relative representations of latent spaces enable efficient semantic channel equalization. In Proc. IEEE GLOBECOM, 2024

    2024

  23. [32]

    Tackling feature and sample heterogeneity in decentralized multi-task learning: A sheaf-theoretic approach

    Chaouki Ben Issaid, Praneeth Vepakomma, and Mehdi Bennis. Tackling feature and sample heterogeneity in decentralized multi-task learning: A sheaf-theoretic approach. Transactions on Machine Learning Research, 2025. ISSN 2835-8856. URL https://openreview.net/forum?id=JlPq0LmApB

    2025

  24. [33]

    Clustered multi-task learning: A convex formulation

    Laurent Jacob, Jean-Philippe Vert, and Francis Bach. Clustered multi-task learning: A convex formulation. Advances in Neural Information Processing Systems, 21, 2008

    2008

  25. [34]

    Communication-efficient distributed dual coordinate ascent

    Martin Jaggi, Virginia Smith, Martin Tak \'a c , Jonathan Terhorst, Sanjay Krishnan, Thomas Hofmann, and Michael I Jordan. Communication-efficient distributed dual coordinate ascent. Advances in Neural Information Processing Systems, 27, 2014

    2014

  26. [35]

    Mcmahan, et al

    Peter Kairouz, Brendan H. Mcmahan, et al. Advances and Open Problems in Federated Learning , volume 14 of Foundations and Trends® in Machine Learning. 2021. doi:10.1561/2200000083. URL https://inria.hal.science/hal-02406503

    2021 doi

  27. [36]

    SCAFFOLD : Stochastic controlled averaging for federated learning

    Sai Praneeth Karimireddy, Satyen Kale, Mehryar Mohri, Sashank Reddi, Sebastian Stich, and Ananda Theertha Suresh. SCAFFOLD : Stochastic controlled averaging for federated learning. In Proceedings of the 37th International Conference on Machine Learning, PMLR, pp.\ 5132--5143, 2020

    2020

  28. [37]

    Optimal whitening and decorrelation

    Agnan Kessy, Alex Lewin, and Korbinian Strimmer. Optimal whitening and decorrelation. The American Statistician, 72 0 (4): 0 309--314, 2018

    2018

  29. [38]

    Lottery FL : Personalized and communication-efficient federated learning with lottery ticket hypothesis on non-iid datasets

    Ang Li, Jingwei Sun, Binghui Wang, Lin Duan, Sicheng Li, Yiran Chen, and Hai Li. Lottery FL : Personalized and communication-efficient federated learning with lottery ticket hypothesis on non-iid datasets. arXiv preprint arXiv:2008.03371, 2020 a

    2008 arXiv

  30. [39]

    Federated learning on R iemannian manifolds

    Jiaxiang Li and Shiqian Ma. Federated learning on R iemannian manifolds. arXiv preprint arXiv:2206.05668, 2022

    2022 arXiv

  31. [40]

    Model-contrastive federated learning

    Qinbin Li, Bingsheng He, and Dawn Song. Model-contrastive federated learning. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), 2021

    2021

  32. [41]

    Federated optimization in heterogeneous networks

    Tian Li, Anit Kumar Sahu, Manzil Zaheer, Maziar Sanjabi, Ameet Talwalkar, and Virginia Smith. Federated optimization in heterogeneous networks. In Proceedings of the Third Conference on Machine Learning and Systems (MLSys), 2020 b

    2020

  33. [42]

    Think locally, act globally: F ederated learning with local and global representations

    Paul Pu Liang, Terrance Liu, Liu Ziyin, Nicholas B Allen, Randy P Auerbach, David Brent, Ruslan Salakhutdinov, and Louis-Philippe Morency. Think locally, act globally: F ederated learning with local and global representations. arXiv preprint arXiv:2001.01523, 2020

    2001 arXiv

  34. [43]

    Adding vs

    Chenxin Ma, Virginia Smith, Martin Jaggi, Michael Jordan, Peter Richt \'a rik, and Martin Tak \'a c. Adding vs. averaging in distributed primal-dual optimization. In International Conference on Machine Learning, pp.\ 1973--1982. PMLR, 2015

    1973

  35. [44]

    Personalized federated learning via feature distribution adaptation

    Connor J McLaughlin and Lili Su. Personalized federated learning via feature distribution adaptation. Advances in Neural Information Processing Systems, 37: 0 77038--77059, 2024

    2024

  36. [45]

    Communication-efficient learning of deep networks from decentralized data

    Brendan McMahan, Eider Moore, Daniel Ramage, Seth Hampson, and Blaise Ag \" u era y Arcas. Communication-efficient learning of deep networks from decentralized data. In Proceedings of the 20th International Conference on Artificial Intelligence and Statistics (AISTATS), volume...

    2017

  37. [46]

    Exploiting unintended feature leakage in collaborative learning

    Luca Melis, Congzheng Song, Emiliano De Cristofaro, and Vitaly Shmatikov. Exploiting unintended feature leakage in collaborative learning. In IEEE Symposium on Security and Privacy (S&P), 2019

    2019

  38. [47]

    Contrastive and non-contrastive strategies for federated self-supervised representation learning and deep clustering

    Runxuan Miao and Erdem Koyuncu. Contrastive and non-contrastive strategies for federated self-supervised representation learning and deep clustering. IEEE Journal of Selected Topics in Signal Processing, 18 0 (6): 0 1070--1084, 2024

    2024

  39. [48]

    Relative representations enable zero-shot latent space communication

    Luca Moschella, Valentino Maiorca, Marco Fumero, Antonio Norelli, Francesco Locatello, and Emanuele Rodol \`a . Relative representations enable zero-shot latent space communication. In The Eleventh International Conference on Learning Representations, 2023. URL https://openrev...

    2023

  40. [49]

    Introductory Lectures on Convex Optimization: A Basic Course, volume 87 of Applied Optimization

    Yurii Nesterov. Introductory Lectures on Convex Optimization: A Basic Course, volume 87 of Applied Optimization. Springer, 2004

    2004

  41. [50]

    Latent space alignment for AI -native mimo semantic communications

    Mario Edoardo Pandolfo, Simone Fiorellino, Emilio Calvanese Strinati, and Paolo Di Lorenzo. Latent space alignment for AI -native mimo semantic communications. In 2025 International Joint Conference on Neural Networks (IJCNN), pp.\ 1--8. IEEE, 2025

    2025

  42. [51]

    SEMASIA : A large-scale dataset of semantically structured latent representations

    Mario Edoardo Pandolfo, Enrico Grimaldi, Lorenzo Marinucci, Leonardo Di Nino, Simone Fiorellino, Sergio Barbarossa, and Paolo Di Lorenzo. SEMASIA : A large-scale dataset of semantically structured latent representations. arXiv preprint arXiv:2605.09485, 2026

    2026 arXiv

  43. [52]

    A convergence theorem for non negative almost supermartingales and some applications

    Herbert Robbins and David Siegmund. A convergence theorem for non negative almost supermartingales and some applications. pp.\ 233--257. Academic Press, 1971

    1971

  44. [53]

    A framework for parallel and distributed training of neural networks

    Simone Scardapane and Paolo Di Lorenzo. A framework for parallel and distributed training of neural networks. Neural Networks, 91: 0 42--54, 2017

    2017

  45. [54]

    Sch \"o nemann

    Peter H. Sch \"o nemann. A generalized solution of the orthogonal P rocrustes problem. Psychometrika, 31 0 (1): 0 1--10, 1966

    1966

  46. [55]

    Khalil, and Hongliang Li

    Mehdi Setayesh, Mahdi Beitollahi, Yasser H. Khalil, and Hongliang Li. Toward enhancing representation learning in federated multi-task settings. In The Fourteenth International Conference on Learning Representations, 2026. URL https://openreview.net/forum?id=nIOIfHHYzk

    2026

  47. [56]

    Membership inference attacks against machine learning models

    Reza Shokri, Marco Stronati, Congzheng Song, and Vitaly Shmatikov. Membership inference attacks against machine learning models. In IEEE Symposium on Security and Privacy (S&P), pp.\ 3--18. IEEE, 2017

    2017

  48. [57]

    Angular synchronization by eigenvectors and semidefinite programming

    Amit Singer. Angular synchronization by eigenvectors and semidefinite programming. Applied and Computational Harmonic Analysis, 30 0 (1): 0 20--36, 2011

    2011

  49. [58]

    Vector diffusion maps and the connection L aplacian

    Amit Singer and H-T Wu. Vector diffusion maps and the connection L aplacian. Communications on Pure and Applied Mathematics, 65 0 (8): 0 1067--1144, 2012

    2012

  50. [59]

    Federated multi-task learning

    Virginia Smith, Chao-Kai Chiang, Maziar Sanjabi, and Ameet S Talwalkar. Federated multi-task learning. Advances in Neural Information Processing Systems, 30, 2017

    2017

  51. [60]

    Goal-oriented and semantic communication in 6G AI -native networks: The 6G-GOALS approach

    Emilio Calvanese Strinati, Paolo Di Lorenzo, et al. Goal-oriented and semantic communication in 6G AI -native networks: The 6G-GOALS approach. In Proceedings of EuCNC/6G Summit, pp.\ 1--6, 2024. doi:10.1109/EuCNC/6GSummit60053.2024.10597087

    2024

  52. [62]

    Fedproto: Federated prototype learning across heterogeneous clients

    Yue Tan, Guodong Long, Lu Liu, Tianyi Zhou, Qinghua Lu, Jing Jiang, and Chengqi Zhang. Fedproto: Federated prototype learning across heterogeneous clients. In Proceedings of the AAAI Conference on Artificial Intelligence, 2022

    2022

  53. [63]

    Distributed methods for synchronization of orthogonal matrices over graphs

    Johan Thunberg, Florian Bernard, and Jorge Gon c alves. Distributed methods for synchronization of orthogonal matrices over graphs. Automatica, 80: 0 243--252, 2017

    2017

  54. [64]

    Fedntproto: A prototype-based approach for personalized federated learning

    Trung-Kien Tran, Ha-Phuong Tran, Thi-Lan Le, and Thanh-Hai Tran. Fedntproto: A prototype-based approach for personalized federated learning. In 2024 International Conference on Multimedia Analysis and Pattern Recognition (MAPR), pp.\ 1--6. IEEE, 2024

    2024

  55. [65]

    Understanding contrastive representation learning through alignment and uniformity on the hypersphere

    Tongzhou Wang and Phillip Isola. Understanding contrastive representation learning through alignment and uniformity on the hypersphere. In International Conference on Machine Learning, pp.\ 9929--9939. PMLR, 2020

    2020

  56. [66]

    Federated unsupervised representation learning

    Fengda Zhang, Kun Kuang, Long Chen, Zhaoyang You, Tao Shen, Jun Xiao, Yin Zhang, Chao Wu, Fei Wu, Yueting Zhuang, and Xiaolin Li. Federated unsupervised representation learning. Frontiers of Information Technology & Electronic Engineering, 24 0 (8): 0 1181--1193, 2023

    2023

  57. [67]

    Stochastic whitening batch normalization

    Shengdong Zhang, Ehsan Nezhadarya, Homa Fashandi, Jiayi Liu, Darin Graham, and Mohak Shah. Stochastic whitening batch normalization. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pp.\ 10978--10987, 2021

    2021

  58. [68]

    Learning sparse task relations in multi-task learning

    Yu Zhang and Qiang Yang. Learning sparse task relations in multi-task learning. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 31, 2017

    2017

  59. [69]

    A convex formulation for learning task relationships in multi-task learning

    Yu Zhang and Dit-Yan Yeung. A convex formulation for learning task relationships in multi-task learning. In Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence, pp.\ 733--742, 2010

    2010

  60. [70]

    Collaborative unsupervised visual representation learning from decentralized data

    Weiming Zhuang, Xin Gan, Yonggang Wen, Shuai Zhang, and Shuai Yi. Collaborative unsupervised visual representation learning from decentralized data. In Proceedings of the IEEE/CVF International Conference on Computer Vision, pp.\ 4912--4921, 2021

    2021

  61. [71]

    Communication-Efficient Learning of Deep Networks from Decentralized Data , booktitle =

    Brendan McMahan and Eider Moore and Daniel Ramage and Seth Hampson and Blaise Ag. Communication-Efficient Learning of Deep Networks from Decentralized Data , booktitle =

  62. [72]

    IEEE Communications Magazine , volume=

    Semantic communications based on adaptive generative models and information bottleneck , author=. IEEE Communications Magazine , volume=. 2023 , publisher=

    2023

  63. [73]

    Proceedings of the Third Conference on Machine Learning and Systems (MLSys) , year =

    Tian Li and Anit Kumar Sahu and Manzil Zaheer and Maziar Sanjabi and Ameet Talwalkar and Virginia Smith , title =. Proceedings of the Third Conference on Machine Learning and Systems (MLSys) , year =

  64. [74]

    Optimizing Methods in Statistics , pages=

    A convergence theorem for non negative almost supermartingales and some applications , author=. Optimizing Methods in Statistics , pages=. 1971 , publisher=

    1971

  65. [75]

    ICML , year=

    Multimodal deep learning , author=. ICML , year=

  66. [76]

    CVPR , year=

    Learning deep structure-preserving image-text embeddings , author=. CVPR , year=

  67. [77]

    CVPR , year=

    Model-contrastive federated learning , author=. CVPR , year=

  68. [78]

    ICML , year=

    Learning transferable visual models from natural language supervision , author=. ICML , year=

  69. [79]

    2020 , series =

    Karimireddy, Sai Praneeth and Kale, Satyen and Mohri, Mehryar and Reddi, Sashank and Stich, Sebastian and Suresh, Ananda Theertha , booktitle =. 2020 , series =

    2020

  70. [80]

    Learning Sheaf

    Di Nino, Leonardo and Barbarossa, Sergio and Di Lorenzo, Paolo , booktitle=. Learning Sheaf. 2024 , organization=

    2024

  71. [81]

    arXiv preprint arXiv:2204.14198 , year=

    Flamingo: a Visual Language Model for Few-Shot Learning , author=. arXiv preprint arXiv:2204.14198 , year=

    arXiv

  72. [82]

    Ghalkha, Abdulmomen and Tian, Zhuojun and Issaid, Chaouki Ben and Bennis, Mehdi , journal=. Sheaf. 2026 , publisher=

    2026

  73. [83]

    and others , URL =

    Kairouz, Peter and Mcmahan, Brendan H. and others , URL =. 2021 , DOI =

    2021

  74. [84]

    International Conference on Machine Learning , pages=

    Understanding contrastive representation learning through alignment and uniformity on the hypersphere , author=. International Conference on Machine Learning , pages=. 2020 , organization=

    2020

  75. [85]

    Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS) , year=

    Model inversion attacks that exploit confidence information and basic countermeasures , author=. Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security (CCS) , year=

  76. [86]

    IEEE Symposium on Security and Privacy (S&P) , pages=

    Membership inference attacks against machine learning models , author=. IEEE Symposium on Security and Privacy (S&P) , pages=. 2017 , organization=

    2017

  77. [87]

    IEEE Symposium on Security and Privacy (S&P) , year=

    Exploiting unintended feature leakage in collaborative learning , author=. IEEE Symposium on Security and Privacy (S&P) , year=

  78. [88]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , year=

    MMRL: Multi-Modal Representation Learning for Vision-Language Models , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , year=

  79. [89]

    1997 , publisher=

    Sheaf theory , author=. 1997 , publisher=

    1997

  80. [90]

    ICASSP 2026-2026 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=

    Learning the structure of connection graphs , author=. ICASSP 2026-2026 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pages=. 2026 , organization=

    2026

  81. [91]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , year =

    Qingchao Li and Bingsheng He and Dawn Song , title =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , year =

  82. [92]

    International Conference on Medical Image Computing and Computer-Assisted Intervention , pages=

    Federated contrastive learning for decentralized unlabeled medical images , author=. International Conference on Medical Image Computing and Computer-Assisted Intervention , pages=. 2021 , organization=

    2021

  83. [93]

    Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI) , pages =

    Yue Tan and Guodong Long and Lu Liu and Tianyi Zhou and Qinghua Lu and Jing Jiang and Chengqi Zhang , title =. Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence (AAAI) , pages =. 2022 , doi =

    2022

  84. [94]

    Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in

    Cristian Bodnar and Francesco Di Giovanni and Benjamin Paul Chamberlain and Pietro Li. Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in. Advances in Neural Information Processing Systems (NeurIPS) , year =

  85. [95]

    Journal of Applied and Computational Topology , year =

    Toward a Spectral Theory of Cellular Sheaves , author =. Journal of Applied and Computational Topology , year =

  86. [96]

    Peter H. Sch. A generalized solution of the orthogonal. Psychometrika , volume =. 1966 , publisher=

    1966

  87. [97]

    Applied and Computational Harmonic Analysis , volume=

    Angular synchronization by eigenvectors and semidefinite programming , author=. Applied and Computational Harmonic Analysis , volume=. 2011 , publisher=

    2011

  88. [98]

    Vector Diffusion Maps and the Connection

    Singer, Amit and Wu, H-T , journal=. Vector Diffusion Maps and the Connection. 2012 , publisher=

    2012

  89. [99]

    Internet Mathematics , volume=

    Ranking and sparsifying a connection graph , author=. Internet Mathematics , volume=. 2014 , publisher=

    2014

  90. [100]

    Forty-second International Conference on Machine Learning , year=

    Causal Abstraction Learning based on the Semantic Embedding Principle , author=. Forty-second International Conference on Machine Learning , year=

  91. [101]

    2004 , series =

    Yurii Nesterov , title =. 2004 , series =

    2004

  92. [102]

    2017 , publisher=

    First-order methods in optimization , author=. 2017 , publisher=

    2017

  93. [103]

    Bertsekas , title =

    Dimitri P. Bertsekas , title =

  94. [104]

    Journal of Optimization Theory and Applications , volume =

    Paul Tseng , title =. Journal of Optimization Theory and Applications , volume =

  95. [105]

    Proximal Alternating Linearized Minimization for Nonconvex and Nonsmooth Problems , journal =

    J. Proximal Alternating Linearized Minimization for Nonconvex and Nonsmooth Problems , journal =

  96. [106]

    Convergence of Descent Methods for Semi-Algebraic and Tame Problems: Proximal Algorithms, Forward–Backward Splitting, and Regularized Gauss–Seidel Methods , journal =

    Hedy Attouch and J. Convergence of Descent Methods for Semi-Algebraic and Tame Problems: Proximal Algorithms, Forward–Backward Splitting, and Regularized Gauss–Seidel Methods , journal =

  97. [107]

    Neural Networks , volume=

    A framework for parallel and distributed training of neural networks , author=. Neural Networks , volume=. 2017 , publisher=

    2017

  98. [108]

    Peter H. Sch. A Generalized Solution of the Orthogonal Procrustes Problem , journal =

  99. [109]

    Absil and R

    P.-A. Absil and R. Mahony and R. Sepulchre , title =

  100. [110]

    Proceedings of the 38th International Conference on Machine Learning (ICML) , year =

    Exploiting Shared Representations for Personalized Federated Learning , author =. Proceedings of the 38th International Conference on Machine Learning (ICML) , year =

  101. [111]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , year =

    Model-Contrastive Federated Learning , author =. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) , year =

  102. [112]

    Proceedings of the AAAI Conference on Artificial Intelligence , year=

    FedProto: Federated Prototype Learning across Heterogeneous Clients , author=. Proceedings of the AAAI Conference on Artificial Intelligence , year=

  103. [113]

    arXiv preprint arXiv:1912.00818 , year =

    Federated Learning with Personalization Layers , author =. arXiv preprint arXiv:1912.00818 , year =

    1912 arXiv

  104. [114]

    arXiv preprint arXiv:1910.03581 , year =

    FedMD: Heterogenous Federated Learning via Model Distillation , author =. arXiv preprint arXiv:1910.03581 , year =

    1910 arXiv

  105. [115]

    Advances in Neural Information Processing Systems (NeurIPS) , year =

    Ensemble Distillation for Robust Model Fusion in Federated Learning , author =. Advances in Neural Information Processing Systems (NeurIPS) , year =

  106. [116]

    Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

    Collaborative Unsupervised Visual Representation Learning from Decentralized Data , author=. Proceedings of the IEEE/CVF International Conference on Computer Vision , pages=

  107. [117]

    Federated Unsupervised Representation Learning , year=

    Zhang, Fengda and Kuang, Kun and Chen, Long and You, Zhaoyang and Shen, Tao and Xiao, Jun and Zhang, Yin and Wu, Chao and Wu, Fei and Zhuang, Yueting and Li, Xiaolin , journal=. Federated Unsupervised Representation Learning , year=

  108. [118]

    and Singer, Amit and Spielman, Daniel A

    Bandeira, Afonso S. and Singer, Amit and Spielman, Daniel A. , journal =. A. 2013 , doi =

    2013

  109. [119]

    Automatica , volume =

    Distributed Methods for Synchronization of Orthogonal Matrices over Graphs , author =. Automatica , volume =

  110. [120]

    Optimization Algorithms on Matrix Manifolds , author =

  111. [121]

    SIAM Journal on Matrix Analysis and Applications , volume =

    The Geometry of Algorithms with Orthogonality Constraints , author =. SIAM Journal on Matrix Analysis and Applications , volume =. 1998 , doi =

    1998

  112. [122]

    Federated Learning on

    Li, Jiaxiang and Ma, Shiqian , journal =. Federated Learning on

  113. [123]

    Journal of Applied and Computational Topology , volume=

    Toward a spectral theory of cellular sheaves , author=. Journal of Applied and Computational Topology , volume=. 2019 , publisher=

    2019

  114. [124]

    Sheaf Neural Networks with Connection

    Barbero, Federico and Bodnar, Cristian and de Oc. Sheaf Neural Networks with Connection. Topological, Algebraic and Geometric Learning Workshops 2022 , pages=. 2022 , organization=

    2022

  115. [125]

    2014 , note =

    Meisam Razaviyayn , title =. 2014 , note =

    2014

  116. [126]

    SIAM Journal on Imaging Sciences , volume =

    Yangyang Xu and Wotao Yin , title =. SIAM Journal on Imaging Sciences , volume =

  117. [127]

    Machine Learning , year=

    Multitask Learning , author=. Machine Learning , year=

  118. [128]

    Journal of Machine Learning Research , volume=

    The benefit of multitask representation learning , author=. Journal of Machine Learning Research , volume=

  119. [129]

    Advances in Neural Information Processing Systems , volume=

    Radial basis function network for multi-task learning , author=. Advances in Neural Information Processing Systems , volume=

  120. [130]

    Machine Learning , volume=

    Inductive transfer with context-sensitive neural networks , author=. Machine Learning , volume=. 2008 , publisher=

    2008

  121. [131]

    IEEE Transactions on Knowledge and Data Engineering , volume=

    A survey on multi-task learning , author=. IEEE Transactions on Knowledge and Data Engineering , volume=. 2021 , publisher=

    2021

  122. [132]

    Machine learning , volume=

    Convex multi-task feature learning , author=. Machine learning , volume=. 2008 , publisher=

    2008

  123. [133]

    International conference on machine learning , pages=

    Sparse coding for multitask and transfer learning , author=. International conference on machine learning , pages=. 2013 , organization=

    2013

  124. [134]

    Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , pages=

    Regularized multi--task learning , author=. Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , pages=

  125. [135]

    Statistics Department, UC Berkeley, Tech

    Multi-task feature selection , author=. Statistics Department, UC Berkeley, Tech. Rep , volume=

  126. [136]

    Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence , pages=

    Multi-task feature learning via efficient l2, 1-norm minimization , author=. Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence , pages=

  127. [137]

    Advances in Neural Information Processing Systems , volume=

    Adaptive multi-task lasso: with application to eQTL detection , author=. Advances in Neural Information Processing Systems , volume=

  128. [138]

    , author=

    A framework for learning predictive structures from multiple tasks and unlabeled data. , author=. Journal of Machine Learning Research , volume=

  129. [139]

    Proceedings of the 26th International Conference on Machine Learning , pages=

    A convex formulation for learning shared structures from multiple tasks , author=. Proceedings of the 26th International Conference on Machine Learning , pages=

  130. [140]

    , author=

    Learning multiple tasks with kernel methods. , author=. Journal of Machine Learning Research , volume=

  131. [141]

    Advances in Neural Information Processing Systems , volume=

    Large margin multi-task metric learning , author=. Advances in Neural Information Processing Systems , volume=

  132. [142]

    Advances in Neural Information Processing Systems , volume=

    Multi-task learning via conic programming , author=. Advances in Neural Information Processing Systems , volume=

  133. [143]

    Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence , pages=

    A convex formulation for learning task relationships in multi-task learning , author=. Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence , pages=

  134. [144]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Learning sparse task relations in multi-task learning , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  135. [145]

    Advances in Neural Information Processing Systems , volume=

    Clustered multi-task learning: A convex formulation , author=. Advances in Neural Information Processing Systems , volume=

  136. [146]

    IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=

    Flexible clustered multi-task learning by learning representative tasks , author=. IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=. 2015 , publisher=

    2015

  137. [147]

    IEEE Open Journal of Signal Processing , volume=

    Learning over multitask graphs—Part I: Stability analysis , author=. IEEE Open Journal of Signal Processing , volume=. 2020 , publisher=

    2020

  138. [148]

    IEEE Signal Processing Magazine , volume=

    Multitask learning over graphs: An approach for distributed, streaming machine learning , author=. IEEE Signal Processing Magazine , volume=. 2020 , publisher=

    2020

  139. [149]

    Journal of Machine Learning Research , volume=

    A unified framework for structured graph learning via spectral constraints , author=. Journal of Machine Learning Research , volume=

  140. [150]

    The Eleventh International Conference on Learning Representations , year=

    Relative representations enable zero-shot latent space communication , author=. The Eleventh International Conference on Learning Representations , year=

  141. [151]

    Advances in Neural Information Processing Systems , volume=

    Federated multi-task learning , author=. Advances in Neural Information Processing Systems , volume=

  142. [152]

    Advances in neural information processing systems , volume=

    Federated multi-task learning under a mixture of distributions , author=. Advances in neural information processing systems , volume=

  143. [153]

    A new look and convergence rate of federated multitask learning with

    Dinh, Canh T and Vu, Tung T and Tran, Nguyen H and Dao, Minh N and Zhang, Hongyu , journal=. A new look and convergence rate of federated multitask learning with. 2022 , publisher=

    2022

  144. [154]

    arXiv preprint arXiv:2506.10102 , year=

    Learning to Collaborate Over Graphs: A Selective Federated Multi-Task Learning Approach , author=. arXiv preprint arXiv:2506.10102 , year=

    arXiv

  145. [155]

    Transactions on Machine Learning Research , issn=

    Tackling Feature and Sample Heterogeneity in Decentralized Multi-Task Learning: A Sheaf-Theoretic Approach , author=. Transactions on Machine Learning Research , issn=. 2025 , url=

    2025

  146. [156]

    Proceedings of the 7th ACM International Conference on Multimedia in Asia , pages=

    Task-Aware Federated Multi-Task Learning , author=. Proceedings of the 7th ACM International Conference on Multimedia in Asia , pages=

  147. [157]

    Advances in Neural Information Processing Systems , volume=

    Communication-efficient distributed dual coordinate ascent , author=. Advances in Neural Information Processing Systems , volume=

  148. [158]

    averaging in distributed primal-dual optimization , author=

    Adding vs. averaging in distributed primal-dual optimization , author=. International Conference on Machine Learning , pages=. 2015 , organization=

    2015

  149. [159]

    The Fourteenth International Conference on Learning Representations , year=

    Toward Enhancing Representation Learning in Federated Multi-Task Settings , author=. The Fourteenth International Conference on Learning Representations , year=

  150. [160]

    arXiv preprint arXiv:2509.25236 , year=

    Networks of Causal Abstractions: A Sheaf-theoretic Framework , author=. arXiv preprint arXiv:2509.25236 , year=

    arXiv

  151. [161]

    Communication-Efficient and Robust Multi-Modal Federated Learning via Latent-Space Consensus , year=

    Badi, Mohamed and Issaid, Chaouki Ben and Bennis, Mehdi , journal=. Communication-Efficient and Robust Multi-Modal Federated Learning via Latent-Space Consensus , year=

  152. [162]

    2014 , school=

    Sheaves, cosheaves and applications , author=. 2014 , school=

    2014

  153. [163]

    Sensors , volume=

    Multimodal federated learning: A survey , author=. Sensors , volume=. 2023 , publisher=

    2023

  154. [164]

    Multimedia Systems , volume=

    A survey of multimodal federated learning: background, applications, and perspectives , author=. Multimedia Systems , volume=. 2024 , publisher=

    2024

  155. [165]

    IEEE Open Journal of the Communications Society , year=

    Survey of multimodal federated learning: exploring data integration, challenges, and future directions , author=. IEEE Open Journal of the Communications Society , year=

  156. [166]

    Proceedings of the 29th ACM SIGKDD conference on knowledge discovery and data mining , pages=

    Fedmultimodal: A benchmark for multimodal federated learning , author=. Proceedings of the 29th ACM SIGKDD conference on knowledge discovery and data mining , pages=

  157. [167]

    Machine Intelligence Research , volume=

    Federated learning on multimodal data: A comprehensive survey , author=. Machine Intelligence Research , volume=. 2023 , publisher=

    2023

  158. [168]

    2024 International Conference on Multimedia Analysis and Pattern Recognition (MAPR) , pages=

    FedNTProto: A prototype-based approach for personalized federated learning , author=. 2024 International Conference on Multimedia Analysis and Pattern Recognition (MAPR) , pages=. 2024 , organization=

    2024

  159. [169]

    Advances in Neural Information Processing Systems , volume=

    Personalized federated learning via feature distribution adaptation , author=. Advances in Neural Information Processing Systems , volume=

  160. [170]

    European Conference on Computer Vision , pages=

    Fedx: Unsupervised federated learning with cross knowledge distillation , author=. European Conference on Computer Vision , pages=. 2022 , organization=

    2022

  161. [171]

    IEEE Journal of Selected Topics in Signal Processing , volume=

    Contrastive and Non-Contrastive Strategies for Federated Self-Supervised Representation Learning and Deep Clustering , author=. IEEE Journal of Selected Topics in Signal Processing , volume=. 2024 , publisher=

    2024

  162. [172]

    SIAM Journal on Applied Mathematics , volume=

    Opinion dynamics on discourse sheaves , author=. SIAM Journal on Applied Mathematics , volume=. 2021 , publisher=

    2021

  163. [173]

    2019 57th annual allerton conference on communication, control, and computing (allerton) , pages=

    Distributed optimization with sheaf homological constraints , author=. 2019 57th annual allerton conference on communication, control, and computing (allerton) , pages=. 2019 , organization=

    2019

  164. [174]

    2025 , booktitle=

    A Model of Flocking Using Sheaves , author=. 2025 , booktitle=

    2025

  165. [175]

    Learning network sheaves for

    Grimaldi, Enrico and Pandolfo, Mario Edoardo and D’Acunto, Gabriele and Barbarossa, Sergio and Di Lorenzo, Paolo , booktitle=. Learning network sheaves for. 2025 , organization=

    2025

  166. [176]

    2025 IEEE 64th Conference on Decision and Control (CDC) , pages=

    Distributed multi-agent coordination over cellular sheaves , author=. 2025 IEEE 64th Conference on Decision and Control (CDC) , pages=. 2025 , organization=

    2025

  167. [177]

    Latent space alignment for

    Pandolfo, Mario Edoardo and Fiorellino, Simone and Strinati, Emilio Calvanese and Di Lorenzo, Paolo , booktitle=. Latent space alignment for. 2025 , organization=

    2025

  168. [178]

    2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall) , pages=

    Robust semantic communications against semantic noise , author=. 2022 IEEE 96th Vehicular Technology Conference (VTC2022-Fall) , pages=. 2022 , organization=

    2022

  169. [179]

    International Conference on Learning Representations (ICLR) , year=

    Deep Variational Information Bottleneck , author=. International Conference on Learning Representations (ICLR) , year=

  170. [180]

    Transformer Circuits Thread , year=

    Toy Models of Superposition , author=. Transformer Circuits Thread , year=

  171. [181]

    Transformer Circuits Thread , year=

    Scaling Monosemanticity: Extracting Interpretable Features from Claude 3 Sonnet , author=. Transformer Circuits Thread , year=

  172. [182]

    International conference on machine learning , pages=

    Barlow twins: Self-supervised learning via redundancy reduction , author=. International conference on machine learning , pages=. 2021 , organization=

    2021

  173. [183]

    Communications of the ACM , volume=

    Algorithm 432 [C2]: Solution of the matrix equation AX+ XB= C [F4] , author=. Communications of the ACM , volume=. 1972 , publisher=

    1972

  174. [184]

    Journal of Scientific Computing , volume=

    A splitting method for orthogonality constrained problems , author=. Journal of Scientific Computing , volume=. 2014 , publisher=

    2014

  175. [185]

    Foundations and Trends

    Distributed optimization and statistical learning via the alternating direction method of multipliers , author=. Foundations and Trends. 2011 , publisher=

    2011

  176. [186]

    International Conference on Learning Representations (ICLR) , year =

    Enmao Diao and Jie Ding and Vahid Tarokh , title =. International Conference on Learning Representations (ICLR) , year =

  177. [187]

    Think locally, act globally:

    Liang, Paul Pu and Liu, Terrance and Ziyin, Liu and Allen, Nicholas B and Auerbach, Randy P and Brent, David and Salakhutdinov, Ruslan and Morency, Louis-Philippe , journal=. Think locally, act globally:

  178. [188]

    Li, Ang and Sun, Jingwei and Wang, Binghui and Duan, Lin and Li, Sicheng and Chen, Yiran and Li, Hai , journal=. Lottery

  179. [189]

    Pandolfo, Mario Edoardo and Grimaldi, Enrico and Marinucci, Lorenzo and Di Nino, Leonardo and Fiorellino, Simone and Barbarossa, Sergio and Di Lorenzo, Paolo , journal=

  180. [190]

    arXiv preprint arXiv:2605.30596 , year=

    Improving Relative Representations with Learned Anchors and Whitened Inner Products , author=. arXiv preprint arXiv:2605.30596 , year=

    arXiv

  181. [191]

    The American Statistician , volume=

    Optimal whitening and decorrelation , author=. The American Statistician , volume=. 2018 , publisher=

    2018

  182. [192]

    Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

    Stochastic whitening batch normalization , author=. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition , pages=

  183. [193]

    IEEE Journal on Selected Areas in Communications , volume=

    Beyond transmitting bits: Context, semantics, and task-oriented communications , author=. IEEE Journal on Selected Areas in Communications , volume=. 2022 , publisher=

    2022

  184. [194]

    IEEE Communications Magazine , volume=

    Semantics-empowered communication for networked intelligent systems , author=. IEEE Communications Magazine , volume=. 2021 , publisher=

    2021

  185. [195]

    De and others , journal=

    Alwis, C. De and others , journal=. Survey on. 2021 , volume=

    2021

  186. [196]

    Goal-Oriented and Semantic Communication in

    Strinati, Emilio Calvanese and Di Lorenzo, Paolo and others , booktitle=. Goal-Oriented and Semantic Communication in. 2024 , volume=

    2024

  187. [197]

    Calvanese and Barbarossa, S

    Strinati, E. Calvanese and Barbarossa, S. , journal=

  188. [198]

    GLOBECOM 2023-2023 IEEE Global Communications Conference , pages=

    Semantic channel equalizer: Modelling language mismatch in multi-user semantic communications , author=. GLOBECOM 2023-2023 IEEE Global Communications Conference , pages=. 2023 , organization=

    2023

  189. [199]

    Federated Latent Space Alignment for Multi-User Semantic Communications , author=. Proc. IEEE SPAWC , pages=

  190. [200]

    arXiv preprint arXiv:2406.15057 , year=

    Latent space translation via inverse relative projection , author=. arXiv preprint arXiv:2406.15057 , year=

    arXiv

  191. [201]

    ICLR 2023 Tiny Papers Track , year =

    Bootstrapping Parallel Anchors for Relative Representations , author =. ICLR 2023 Tiny Papers Track , year =. 2303.00721 , archivePrefix =

    2023 arXiv

  192. [202]

    Frame-based zero-shot semantic channel equalization for

    Fiorellino, Simone and Battiloro, Claudio and Strinati, Emilio Calvanese and Di Lorenzo, Paolo , journal=. Frame-based zero-shot semantic channel equalization for. 2026 , publisher=

    2026

  193. [203]

    Relative Representations of Latent Spaces enable Efficient Semantic Channel Equalization , author=. Proc. IEEE GLOBECOM , year=

  194. [204]

    Dynamic relative representations for goal-oriented semantic communications , author=. Proc. IEEE EUSIPCO , pages=

Pith tools

Reviewed August 12, 2026 · model on record in the stance chip above.