I am happy to announce that our recent that studies Safe-EF algorithm for distributed non-smooth optimization with constraints has been accepted to ICML 2025! Quick summary of our contributions: ⚙️ Safe-EF algorithm which provably converges in the federated non-smooth optimization with constraints; 🚨 Algorithms like Compressed SGD and EF21 fail to converge in such a setting; 🛠️ Lower bounds for first-order methods in the compressed non-smooth convex setting. 🔄 High probability analysis in the stochastic setting; 🤖 Extensive experiments, including distributed humanoid training, show that Safe-EF efficiently minimizes the objective while preserving constraint violations. This is a joint work with Yarden As and Ilyas Fatkhullin. Check out our paper for more details!
