In this work we have presented Aspis, a Byzantine-resilient distributed scheme that utilizes redundancy and robust aggregation in novel ways to detect adversarial behavior by the worker nodes. Our theoretical analysis and numerical experiments clearly indicate the superior performance of Aspis as compared to prior work. Our numerical experiments indicate that Aspis requires increased computation and communication time as compared to prior work, e.g., note that each worker has to transmit \(l\)  gradients instead of 1 in related work [1]}, [2]} (see Appendix Section REF  for a detailed discussion). There are opportunities for reducing the time-overhead. For instance, utilizing GPUs and communication-related algorithmic improvements are worth exploring.
