activity
20172020
most citedOn Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization

15 citations · 17 across the 2 of their papers we have counts for

collaborators

6 papers

cs.DC2020

Communication-Efficient Distributed Stochastic AUC Maximization with Deep Neural Networks

Zhishuai Guo, Mingrui Liu, Zhuoning Yuan +3

In this paper, we study distributed algorithms for large-scale AUC maximization with a deep neural network as a predictive model. Although distributed learning techniques have been…

cs.LG2019

Improved Schemes for Episodic Memory-based Lifelong Learning

Yunhui Guo, Mingrui Liu, Tianbao Yang +1

Current deep neural networks can achieve remarkable performance on a single task. However, when the deep neural network is continually trained on a sequence of tasks, it seems to g…

cs.LG2019

Stochastic AUC Maximization with Deep Neural Networks

Mingrui Liu, Zhuoning Yuan, Yiming Ying +1

Stochastic AUC maximization has garnered an increasing interest due to better fit to imbalanced data classification. However, existing works are limited to stochastic AUC maximizat…

stat.ML2018

Fast Rates of ERM and Stochastic Approximation: Adaptive to Error Bound Conditions

Mingrui Liu, Xiaoxuan Zhang, Lijun Zhang +2

Error bound conditions (EBC) are properties that characterize the growth of an objective function when a point is moved away from the optimal set. They have recently received incre…

math.OC20172 cited

Stochastic Non-convex Optimization with Strong High Probability Second-order Convergence

Mingrui Liu, Tianbao Yang

In this paper, we study stochastic non-convex optimization with non-convex random functions. Recent studies on non-convex optimization revolve around establishing second-order conv…

math.OC201715 cited

On Noisy Negative Curvature Descent: Competing with Gradient Descent for Faster Non-convex Optimization

Mingrui Liu, Tianbao Yang

The Hessian-vector product has been utilized to find a second-order stationary solution with strong complexity guarantee (e.g., almost linear time complexity in the problem's dimen…