arXiv Machine Learning By Aleksandr Shestakov, Vladimir Aletov, Aleksandr Beznosikov

On Johnson-Lindenstrauss Transforms for Byzantine-Robust Optimization

Read the original on arXiv Machine Learning →

The paper investigates the use of Johnson‑Lindenstrauss (JL) transforms in Byzantine‑robust distributed optimization. By leveraging JL’s ability to preserve inner products and distances, worker messages are weighted based on their alignment with a trusted reference gradient, reducing communication costs while maintaining robustness. Experimental results support the theoretical claims.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.