1.8k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Chinese University of Hong KongHK197 papers
- Shenzhen Research Institute of Big DataCN158 papers
- Chinese Academy of SciencesCN61 papers
- The University of TokyoJP53 papers
- Tsinghua UniversityCN51 papers
- Shinshu UniversityJP42 papers
- University of Hong KongHK41 papers
- University of Science and Technology of ChinaCN39 papers
- University of MünsterDE33 papers
- National University of SingaporeSG28 papers
- Nagoya UniversityJP27 papers
- Peking UniversityCN26 papers
5 papers · 2 filters
Analysis of Optimal Thresholding Algorithms for Compressed Sensing
Yun-Bin Zhao, Zhi-Quan Luo
The optimal -thresholding (OT) and optimal -thresholding pursuit (OTP) are newly introduced frameworks of thresholding techniques for compressed sensing and signal approximat…
A Stochastic Extra-Step Quasi-Newton Method for Nonsmooth Nonconvex Optimization
Minghan Yang, Andre Milzarek, Zaiwen Wen +1
In this paper, a novel stochastic extra-step quasi-Newton method is developed to solve a class of nonsmooth nonconvex composite optimization problems. We assume that the gradient o…
On The Geometric Analysis of A Quartic-quadratic Optimization Problem under A Spherical Constraint
Haixiang Zhang, Andre Milzarek, Zaiwen Wen +1
This paper considers the problem of solving a special quartic-quadratic optimization problem with a single sphere constraint, namely, finding a global and local minimizer of $\frac…
Asymptotic Network Independence in Distributed Stochastic Optimization for Machine Learning
Shi Pu, Alex Olshevsky, Ioannis Ch. Paschalidis
We provide a discussion of several recent results which, in certain scenarios, are able to overcome a barrier in distributed stochastic optimization for machine learning. Our focus…
Inexact Block Coordinate Descent Algorithms for Nonsmooth Nonconvex Optimization
Yang Yang, Marius Pesavento, Zhi-Quan Luo +1
In this paper, we propose an inexact block coordinate descent algorithm for large-scale nonsmooth nonconvex optimization problems. At each iteration, a particular block variable is…