research
∙
12/31/2021
Complex contraction on trees without proof of correlation decay
We prove complex contraction for zero-free regions of counting weighted ...
share
research
∙
04/12/2021
Meta-Regularization: An Approach to Adaptive Choice of the Learning Rate in Gradient Descent
We propose Meta-Regularization, a novel approach for the adaptive choice...
research
∙
03/15/2021
Lower Complexity Bounds of Finite-Sum Optimization Problems: The Results and Construction
The contribution of this paper includes two aspects. First, we study the...
research
∙
03/15/2021
DIPPA: An improved Method for Bilinear Saddle Point Problems
This paper studies bilinear saddle point problems min_xmax_y g(x) + x^⊤A...
research
∙
09/05/2020
Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices
We study the streaming model for approximate matrix multiplication (AMM)...
research
∙
08/30/2020
Optimal Quantization for Batch Normalization in Neural Network Deployments and Beyond
Quantized Neural Networks (QNNs) use low bit-width fixed-point numbers f...
research
∙
09/13/2019
A Stochastic Proximal Point Algorithm for Saddle-Point Problems
We consider saddle point problems which objective functions are the aver...
research
∙
08/22/2019
A General Analysis Framework of Lower Complexity Bounds for Finite-Sum Optimization
This paper studies the lower bound complexity for the optimization probl...
research
∙
05/17/2018