6 papers · 1 filter
Learning-Theoretic Foundation for General Coded Computing: The Adversarial Setting
Parsa Moradi, Hanzaleh Akbarinodehi, Mohammad Ali Maddah-Ali
Adversarial workers pose a severe challenge in distributed computing systems by returning corrupted outputs that can substantially distort the recovered computations. Coded computi…
Manifold-Aware General Coded Computing for Straggler-Resilient Distributed Computing
Parsa Moradi, Mohammad Ali Maddah-Ali
Existing coded-computing designs do not explicitly exploit the intrinsic structure of the input data. In communication systems, statistical structure and redundancy are often remov…
Learning-Theoretic Foundation for General Coded Computing: The Straggler Setting
Parsa Moradi, Behrooz Tahmasebi, Mohammad Ali Maddah-Ali
Coded computing has emerged as a powerful paradigm for mitigating the impact of straggling workers in distributed computing systems. However, existing coded-computing schemes are p…
Learning from Acceptance: Cumulative Regret in the Game of Coding
Hanzaleh Akbari Nodehi, Parsa Moradi, Mohammad Ali Maddah-Ali
Classical coding-theoretic guarantees often rely on trust assumptions, such as requiring sufficiently many honest nodes compared with adversarial ones. These assumptions are diffic…
\mathsf{VISTA}: Decentralized Machine Learning in Adversary Dominated Environments
Hanzaleh Akbari Nodehi, Parsa Moradi, Soheil Mohajer +1
Decentralized machine learning often relies on outsourcing computations, such as gradient evaluations, to untrusted worker nodes. Existing robust aggregation methods can mitigate m…
Game of Coding for Vector-Valued Computations
Hanzaleh Akbari Nodehi, Parsa Moradi, Soheil Mohajer +1
Traditional coding theory guarantees valid decoding only if a minority of symbols are adversarially manipulated. In contrast, the game of coding framework ensures reliable decoding…