Yuejiao Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yuejiao Sun has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Tao Sun
National University of Defense Technology
3 shared publications - Wotao Yin
Damo Academy, Alibaba Group US, Bellevue, USA
3 shared publications - Yangyang Xu
Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180 USA
2 shared publications - Dongsheng Li
PDL Lab, College of Computer Science and Technology, National University of Defense Technology, Changsha, Hunan, China
1 shared publication - Qing Liao
Harbin Institute of Technology, Shenzhen, China
1 shared publication - Yifan Chen
Tsinghua University
1 shared publication
Latest Publications
- 22 October 2019
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 75 (1) , 35-61
Markov chain block coordinate descent
- 22 October 2019
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 75 (1) , 35-61
Markov chain block coordinate descent
- Open Access
General Proximal Incremental Aggregated Gradient Algorithms: Better and Novel Results under General Scheme
The incremental aggregated gradient algorithm is popular in network optimization and machine learning research. However, the current convergence results require the objective function to be strongly convex. And the existing convergence rates are also limited to linear convergence. Due to the mathematical techniques, the stepsize in the algorithm is restricted by the strongly convex constant, which may make the stepsize be very small (the strongly convex constant may be small). In this paper, we propose a general proximal incremental aggregated gradient algorithm, which contains various existing algorithms including the basic incremental aggregated gradient method. Better and new convergence results are proved even with the general scheme. The novel results presented in this paper, which have not appeared in previous literature, include: a general scheme, nonconvex analysis, the sublinear convergence rates of the function values, much larger stepsizes that guarantee the convergence, the convergence when noise exists, the line search strategy of the proximal incremental aggregated gradient algorithm and its convergence.
Open AccessGeneral Proximal Incremental Aggregated Gradient Algorithms: Better and Novel Results under General Scheme
The incremental aggregated gradient algorithm is popular in network optimization and machine learning research. However, the current convergence results require the objective function to be strongly convex. And the existing convergence rates are also limited to linear convergence. Due to the mathematical techniques, the stepsize in the algorithm is restricted by the strongly convex constant, which may make the stepsize be very small (the strongly convex constant may be small). In this paper, we propose a general proximal incremental aggregated gradient algorithm, which contains various existing algorithms including the basic incremental aggregated gradient method. Better and new convergence results are proved even with the general scheme. The novel results presented in this paper, which have not appeared in previous literature, include: a general scheme, nonconvex analysis, the sublinear convergence rates of the function values, much larger stepsizes that guarantee the convergence, the convergence when noise exists, the line search strategy of the proximal incremental aggregated gradient algorithm and its convergence.
- 27 April 2019
- Published by Springer Nature in Mathematical Programming
- Vol. 176 (1-2) , 39-67
Run-and-Inspect Method for nonconvex optimization and global optimality bounds for R-local minimizers
- 27 April 2019
- Published by Springer Nature in Mathematical Programming
- Vol. 176 (1-2) , 39-67
Run-and-Inspect Method for nonconvex optimization and global optimality bounds for R-local minimizers
- Open Access
Markov Chain Block Coordinate Descent
The method of block coordinate gradient descent (BCD) has been a powerful method for large-scale optimization. This paper considers the BCD method that successively updates a series of blocks selected according to a Markov chain. This kind of block selection is neither i.i.d. random nor cyclic. On the other hand, it is a natural choice for some applications in distributed optimization and Markov decision process, where i.i.d. random and cyclic selections are either infeasible or very expensive. By applying mixing-time properties of a Markov chain, we prove convergence of Markov chain BCD for minimizing Lipschitz differentiable functions, which can be nonconvex. When the functions are convex and strongly convex, we establish both sublinear and linear convergence rates, respectively. We also present a method of Markov chain inertial BCD. Finally, we discuss potential applications.
Open AccessMarkov Chain Block Coordinate Descent
The method of block coordinate gradient descent (BCD) has been a powerful method for large-scale optimization. This paper considers the BCD method that successively updates a series of blocks selected according to a Markov chain. This kind of block selection is neither i.i.d. random nor cyclic. On the other hand, it is a natural choice for some applications in distributed optimization and Markov decision process, where i.i.d. random and cyclic selections are either infeasible or very expensive. By applying mixing-time properties of a Markov chain, we prove convergence of Markov chain BCD for minimizing Lipschitz differentiable functions, which can be nonconvex. When the functions are convex and strongly convex, we establish both sublinear and linear convergence rates, respectively. We also present a method of Markov chain inertial BCD. Finally, we discuss potential applications.