3 citations · 4 across the 4 of their papers we have counts for
4 papers · 1 filter
Byzantine-Robust Distributed SGD: A Unified Analysis and Tight Error Bounds
Boyuan Ruan, Xiaoyu Wang, Ya-Feng Liu
Byzantine-robust distributed optimization relies on robust aggregation rules to mitigate the influence of malicious Byzantine workers. Despite the proliferation of such rules, a un…
On the non-ergodic convergence rate of an inexact augmented Lagrangian framework for composite convex programming
Ya-Feng Liu, Xin Liu, Shiqian Ma
In this paper, we consider the linearly constrained composite convex optimization problem, whose objective is a sum of a smooth function and a possibly nonsmooth function. We propo…
A Scalable Frank-Wolfe based Augmented Lagrangian Method for Linearly Constrained Composite Convex Programming
Ya-Feng Liu, Xiangfeng Wang, Xin Liu +1
In this paper, we consider large-scale linearly constrained composite convex optimization problem, whose objective is a sum of a smooth function and a possibly nonsmooth function.…
A Smoothing SQP Framework for a Class of Composite Minimization over Polyhedron
Ya-Feng Liu, Shiqian Ma, Yu-Hong Dai +1
The composite minimization problem over a general polyhedron has received various applications in machine learning, wireless communications, image restoration, signal…