Get our free extension to see links to code for papers anywhere online!

Chrome logo Add to Chrome

Firefox logo Add to Firefox
Picture for Kun Yuan

Kun Yuan

Effective Model Sparsification by Scheduled Grow-and-Prune Methods


Jun 18, 2021
Xiaolong Ma, Minghai Qin, Fei Sun, Zejiang Hou, Kun Yuan, Yi Xu, Yanzhi Wang, Yen-Kuang Chen, Rong Jin, Yuan Xie

Figure 1 for Effective Model Sparsification by Scheduled Grow-and-Prune Methods
Figure 2 for Effective Model Sparsification by Scheduled Grow-and-Prune Methods
Figure 3 for Effective Model Sparsification by Scheduled Grow-and-Prune Methods
Figure 4 for Effective Model Sparsification by Scheduled Grow-and-Prune Methods

  Access Paper or Ask Questions

Accelerating Gossip SGD with Periodic Global Averaging


May 19, 2021
Yiming Chen, Kun Yuan, Yingya Zhang, Pan Pan, Yinghui Xu, Wotao Yin

Figure 1 for Accelerating Gossip SGD with Periodic Global Averaging
Figure 2 for Accelerating Gossip SGD with Periodic Global Averaging
Figure 3 for Accelerating Gossip SGD with Periodic Global Averaging
Figure 4 for Accelerating Gossip SGD with Periodic Global Averaging
* Accepted to ICML 2021 
  Access Paper or Ask Questions

Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGD


May 17, 2021
Kun Yuan, Sulaiman A. Alghunaim

Figure 1 for Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGD
Figure 2 for Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGD

  Access Paper or Ask Questions

On the Comparison between Cyclic Sampling and Random Reshuffling


Apr 25, 2021
Xinmeng Huang, Kun Yuan, Xianghui Mao, Wotao Yin

Figure 1 for On the Comparison between Cyclic Sampling and Random Reshuffling
Figure 2 for On the Comparison between Cyclic Sampling and Random Reshuffling
Figure 3 for On the Comparison between Cyclic Sampling and Random Reshuffling
Figure 4 for On the Comparison between Cyclic Sampling and Random Reshuffling

  Access Paper or Ask Questions

DecentLaM: Decentralized Momentum SGD for Large-batch Deep Training


Apr 24, 2021
Kun Yuan, Yiming Chen, Xinmeng Huang, Yingya Zhang, Pan Pan, Yinghui Xu, Wotao Yin

Figure 1 for DecentLaM: Decentralized Momentum SGD for Large-batch Deep Training
Figure 2 for DecentLaM: Decentralized Momentum SGD for Large-batch Deep Training
Figure 3 for DecentLaM: Decentralized Momentum SGD for Large-batch Deep Training
Figure 4 for DecentLaM: Decentralized Momentum SGD for Large-batch Deep Training

  Access Paper or Ask Questions

Incorporating Convolution Designs into Visual Transformers


Apr 20, 2021
Kun Yuan, Shaopeng Guo, Ziwei Liu, Aojun Zhou, Fengwei Yu, Wei Wu

Figure 1 for Incorporating Convolution Designs into Visual Transformers
Figure 2 for Incorporating Convolution Designs into Visual Transformers
Figure 3 for Incorporating Convolution Designs into Visual Transformers
Figure 4 for Incorporating Convolution Designs into Visual Transformers

  Access Paper or Ask Questions

Differentiable Network Adaption with Elastic Search Space


Mar 30, 2021
Shaopeng Guo, Yujie Wang, Kun Yuan, Quanquan Li

Figure 1 for Differentiable Network Adaption with Elastic Search Space
Figure 2 for Differentiable Network Adaption with Elastic Search Space
Figure 3 for Differentiable Network Adaption with Elastic Search Space
Figure 4 for Differentiable Network Adaption with Elastic Search Space

  Access Paper or Ask Questions

Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch


Feb 08, 2021
Aojun Zhou, Yukun Ma, Junnan Zhu, Jianbo Liu, Zhijie Zhang, Kun Yuan, Wenxiu Sun, Hongsheng Li

Figure 1 for Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch
Figure 2 for Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch
Figure 3 for Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch
Figure 4 for Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch
* ICLR2021 
  Access Paper or Ask Questions

Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks


Oct 02, 2020
Kun Yuan, Quanquan Li, Dapeng Chen, Aojun Zhou, Junjie Yan

Figure 1 for Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks
Figure 2 for Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks
Figure 3 for Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks
Figure 4 for Dynamic Graph: Learning Instance-aware Connectivity for Neural Networks
* 13 pages, 3 figures, 6 tables 
  Access Paper or Ask Questions

Learning Connectivity of Neural Networks from a Topological Perspective


Aug 19, 2020
Kun Yuan, Quanquan Li, Jing Shao, Junjie Yan

Figure 1 for Learning Connectivity of Neural Networks from a Topological Perspective
Figure 2 for Learning Connectivity of Neural Networks from a Topological Perspective
Figure 3 for Learning Connectivity of Neural Networks from a Topological Perspective
Figure 4 for Learning Connectivity of Neural Networks from a Topological Perspective
* 17 pages, 5 figures, to be published in ECCV2020 
  Access Paper or Ask Questions

Towards Good Practices for Instance Segmentation


Oct 28, 2019
Dongdong Yu, Zehuan Yuan, Jinlai Liu, Kun Yuan, Changhu Wang

Figure 1 for Towards Good Practices for Instance Segmentation
Figure 2 for Towards Good Practices for Instance Segmentation
Figure 3 for Towards Good Practices for Instance Segmentation
Figure 4 for Towards Good Practices for Instance Segmentation

  Access Paper or Ask Questions

ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems and GANs


Jun 06, 2019
Ernest K. Ryu, Kun Yuan, Wotao Yin

Figure 1 for ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems and GANs
Figure 2 for ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems and GANs
Figure 3 for ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems and GANs
Figure 4 for ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems and GANs

  Access Paper or Ask Questions

On the Performance of Exact Diffusion over Adaptive Networks


Mar 26, 2019
Kun Yuan, Sulaiman A. Alghunaim, Bicheng Ying, Ali H. Sayed

Figure 1 for On the Performance of Exact Diffusion over Adaptive Networks
Figure 2 for On the Performance of Exact Diffusion over Adaptive Networks
Figure 3 for On the Performance of Exact Diffusion over Adaptive Networks
Figure 4 for On the Performance of Exact Diffusion over Adaptive Networks
* 10 pages, 1 figure, submitted for publication 
  Access Paper or Ask Questions

Multi-Agent Fully Decentralized Off-Policy Learning with Linear Convergence Rates


Oct 17, 2018
Lucas Cassano, Kun Yuan, Ali H. Sayed

Figure 1 for Multi-Agent Fully Decentralized Off-Policy Learning with Linear Convergence Rates
Figure 2 for Multi-Agent Fully Decentralized Off-Policy Learning with Linear Convergence Rates
* 28 pages, 3 figures 
  Access Paper or Ask Questions

Stochastic Learning under Random Reshuffling with Constant Step-sizes


Oct 09, 2018
Bicheng Ying, Kun Yuan, Stefan Vlaski, Ali H. Sayed

Figure 1 for Stochastic Learning under Random Reshuffling with Constant Step-sizes
Figure 2 for Stochastic Learning under Random Reshuffling with Constant Step-sizes
Figure 3 for Stochastic Learning under Random Reshuffling with Constant Step-sizes
Figure 4 for Stochastic Learning under Random Reshuffling with Constant Step-sizes

  Access Paper or Ask Questions

Variance-Reduced Stochastic Learning by Networked Agents under Random Reshuffling


May 29, 2018
Kun Yuan, Bicheng Ying, Jiageng Liu, Ali H. Sayed

Figure 1 for Variance-Reduced Stochastic Learning by Networked Agents under Random Reshuffling
Figure 2 for Variance-Reduced Stochastic Learning by Networked Agents under Random Reshuffling
Figure 3 for Variance-Reduced Stochastic Learning by Networked Agents under Random Reshuffling
Figure 4 for Variance-Reduced Stochastic Learning by Networked Agents under Random Reshuffling
* 23 pages, 12 figures, submitted for publication 
  Access Paper or Ask Questions

Learning Under Distributed Features


May 29, 2018
Bicheng Ying, Kun Yuan, Ali H. Sayed

Figure 1 for Learning Under Distributed Features
Figure 2 for Learning Under Distributed Features
Figure 3 for Learning Under Distributed Features
Figure 4 for Learning Under Distributed Features

  Access Paper or Ask Questions

Variance-Reduced Stochastic Learning under Random Reshuffling


Feb 16, 2018
Bicheng Ying, Kun Yuan, Ali H. Sayed

Figure 1 for Variance-Reduced Stochastic Learning under Random Reshuffling
Figure 2 for Variance-Reduced Stochastic Learning under Random Reshuffling
Figure 3 for Variance-Reduced Stochastic Learning under Random Reshuffling

  Access Paper or Ask Questions

On the Influence of Momentum Acceleration on Online Learning


Oct 12, 2016
Kun Yuan, Bicheng Ying, Ali H. Sayed

Figure 1 for On the Influence of Momentum Acceleration on Online Learning
Figure 2 for On the Influence of Momentum Acceleration on Online Learning
Figure 3 for On the Influence of Momentum Acceleration on Online Learning
Figure 4 for On the Influence of Momentum Acceleration on Online Learning
* 66 pages, 9 figures, to appear in Journal of Machine Learning Research, 2016 
  Access Paper or Ask Questions

Online Dual Coordinate Ascent Learning


Feb 24, 2016
Bicheng Ying, Kun Yuan, Ali H. Sayed

Figure 1 for Online Dual Coordinate Ascent Learning
Figure 2 for Online Dual Coordinate Ascent Learning
Figure 3 for Online Dual Coordinate Ascent Learning

  Access Paper or Ask Questions