Privacy-Preserving and Verifiable Approximate Distributed Coded Computing
Distributed machine learning enables collaborative model training without centralizing data, but it also exposes learning processes to privacy leakage and malicious manipulation. Existing defenses typically address these threats in isolation and are often tailored to specific learning paradigms or model architectures, limiting their applicability in realistic deployments. In particular, federated learning and decentralized learning exhibit distinct adversarial surfaces that are rarely addressed within a unified framework. In this paper, we present a model-agnostic framework for adversary-resis
Lineage graph
Paper → model → repo connections mined from source citations (Tier-1 exact match).
Why these links exist
- Linked via arxiv authorXavier Martínez-Luaña →
Privacy-Preserving and Verifiable Approximate Distributed Coded Computing
- Linked via arxiv authorAlba Gude-Santos →
Privacy-Preserving and Verifiable Approximate Distributed Coded Computing
- Linked via arxiv authorManuel Fernández-Veiga →
Privacy-Preserving and Verifiable Approximate Distributed Coded Computing
- Linked via arxiv authorRebeca P. Díaz-Redondo →
Privacy-Preserving and Verifiable Approximate Distributed Coded Computing
