The reviewed record of science sign in
Pith

arxiv: 2312.14712 · v3 · pith:BIZ5CTBW · submitted 2023-12-22 · cs.LG · cs.CR· cs.DC

Balancing Privacy, Robustness, and Efficiency in Machine Learning

Reviewed by Pithpith:BIZ5CTBWopen to challenge →

classification cs.LG cs.CRcs.DC
keywords learningmachinemodelsefficiencyprivacyrobustnessthreatachieving
0
0 comments X
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Dangerous Liaisons of Convex Learning and Non-Affine Aggregation

    cs.LG 2026-06 unverdicted novelty 8.0

    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.