26 citations · 56 across the 17 of their papers we have counts for
8 papers · 1 filter
Interleaved Composite Quantization for High-Dimensional Similarity Search
Soroosh Khoram, Stephen J Wright, Jing Li
Similarity search retrieves the nearest neighbors of a query vector from a dataset of high-dimensional vectors. As the size of the dataset grows, the cost of performing the distanc…
A Distributed Quasi-Newton Algorithm for Primal and Dual Regularized Empirical Risk Minimization
Ching-pei Lee, Cong Han Lim, Stephen J. Wright
We propose a communication- and computation-efficient distributed optimization algorithm using second-order information for solving empirical risk minimization (ERM) problems with…
Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization
Frank E. Curtis, Daniel P. Robinson, Clément Royer +1
Worst-case complexity guarantees for nonconvex optimization algorithms have been a topic of growing interest. Multiple frameworks that achieve the best known complexity bounds amon…
Schwarz iteration method for elliptic equation with rough media based on random sampling
Ke Chen, Qin Li, Stephen J. Wright
We propose a computationally efficient Schwarz method for elliptic equations with rough media. A random sampling strategy is used to find low-rank approximations of all local solut…
Structured random sketching for PDE inverse problems
Ke Chen, Qin Li, Kit Newton +1
For an overdetermined system with and given, the least-square (LS) formulation $\min_x \, \|\mathsf{A}\mathsf{x}…
Complexity of Proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints
Yue Xie, Stephen J. Wright
We analyze worst-case complexity of a Proximal augmented Lagrangian (Proximal AL) framework for nonconvex optimization with nonlinear equality constraints. When an approximate firs…