Balancing Privacy, Robustness, and Efficiency in Machine Learning
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:BIZ5CTBWrecord.jsonopen to challenge →
read the original abstract
This position paper argues that achieving robustness, privacy, and efficiency simultaneously in machine learning systems is infeasible under prevailing threat models. The tension between these goals arises not from algorithmic shortcomings but from structural limitations imposed by worst-case adversarial assumptions. We advocate for a systematic research agenda aimed at formalizing the robustness-privacy-efficiency trilemma, exploring how principled relaxations of threat models can unlock better trade-offs, and designing benchmarks that expose rather than obscure the compromises made. By shifting focus from aspirational universal guarantees to context-aware system design, the machine learning community can build models that are truly appropriate for real-world deployment.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Dangerous Liaisons of Convex Learning and Non-Affine Aggregation
Monotonicity of aggregated gradients holds if and only if the aggregation rule is positively affine; non-affine rules therefore prevent steady convergence and degrade stability.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.