Guangzeng Xie — accepted AI-conference papers

2021

Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices

Luo Luo, Cheng Chen, Guangzeng Xie, Haishan Ye

AAAI 2021technical

We study the streaming model for approximate matrix multiplication (AMM). We are interested in the scenario that the algorithm can only take one pass over the data with limited memory. The state-of-the-art deterministic sketching algorithm for streaming AMM is the co-occurring directions (COD), whic…

Cited by 4 Source ↗PDF ↗Scholar ↗

2020

Lower Complexity Bounds for Finite-Sum Convex-Concave Minimax Optimization Problems

Guangzeng Xie, Luo Luo, Yijiang Lian, Zhihua Zhang

ICML 2020poster

This paper studies the lower bound complexity for minimax optimization problem whose objective function is the average of $n$ individual smooth convex-concave functions. We consider the algorithm which gets access to gradient and proximal oracle for each individual component. For the strongly-convex…

Cited by 24 Source ↗PDF ↗Scholar ↗