activity
20162021
most citedSub-sampled Newton Methods with Non-uniform Sampling

69 citations · 235 across the 8 of their papers we have counts for

collaborators

8 papers

math.OC2021

Inexact Newton-CG Algorithms With Complexity Guarantees

Zhewei Yao, Peng Xu, Fred Roosta +2

We consider variants of a recently-developed Newton-CG algorithm for nonconvex problems \citep{royer2018newton} in which inexact estimates of the gradient and the Hessian informati…

math.OC2018★ 1 cited

Newton-MR: Inexact Newton Method With Minimum Residual Sub-problem Solver

Fred Roosta, Yang Liu, Peng Xu +1

We consider a variant of inexact Newton Method, called Newton-MR, in which the least-squares sub-problems are solved approximately using Minimum Residual method. By construction, N…

math.OC2018★ 28 cited

Inexact Non-Convex Newton-Type Methods

Zhewei Yao, Peng Xu, Farbod Roosta-Khorasani +1

For solving large-scale non-convex problems, we propose inexact variants of trust region and adaptive cubic regularization methods, which, to increase efficiency, incorporate vario…

cs.LG2017★ 30 cited

GIANT: Globally Improved Approximate Newton Method for Distributed Optimization

Shusen Wang, Farbod Roosta-Khorasani, Peng Xu +1

For distributed computing environment, we consider the empirical risk minimization problem and propose a distributed and communication-efficient Newton-type optimization method. At…

math.OC2017★ 34 cited

Second-Order Optimization for Non-Convex Machine Learning: An Empirical Study

Peng Xu, Farbod Roosta-Khorasani, Michael W. Mahoney

While first-order optimization methods such as stochastic gradient descent (SGD) are popular in machine learning (ML), they come with well-known deficiencies, including relatively-…

math.OC2017★ 53 cited

Newton-Type Methods for Non-Convex Optimization Under Inexact Hessian Information

Peng Xu, Fred Roosta, Michael W. Mahoney

We consider variants of trust-region and cubic regularization methods for non-convex optimization, in which the Hessian matrix is approximated. Under mild conditions on the inexact…

math.OC2017★ 20 cited

Accelerated Stochastic Power Iteration

Christopher De Sa, Bryan He, Ioannis Mitliagkas +2

Principal component analysis (PCA) is one of the most powerful tools in machine learning. The simplest method for PCA, the power iteration, requires full-data pas…

math.OC2016★ 69 cited

Sub-sampled Newton Methods with Non-uniform Sampling

Peng Xu, Jiyan Yang, Farbod Roosta-Khorasani +2

We consider the problem of finding the minimizer of a convex function of the form where a low-rank facto…