Alert button
Picture for Haibo Yang

Haibo Yang

Alert button

3DStyle-Diffusion: Pursuing Fine-grained Text-driven 3D Stylization with 2D Diffusion Models

Nov 09, 2023
Haibo Yang, Yang Chen, Yingwei Pan, Ting Yao, Zhineng Chen, Tao Mei

Viaarxiv icon

Federated Multi-Objective Learning

Oct 15, 2023
Haibo Yang, Zhuqing Liu, Jia Liu, Chaosheng Dong, Michinari Momma

Figure 1 for Federated Multi-Objective Learning
Figure 2 for Federated Multi-Objective Learning
Figure 3 for Federated Multi-Objective Learning
Figure 4 for Federated Multi-Objective Learning
Viaarxiv icon

Taming Fat-Tailed ("Heavier-Tailed'' with Potentially Infinite Variance) Noise in Federated Learning

Oct 03, 2022
Haibo Yang, Peiwen Qiu, Jia Liu

Figure 1 for Taming Fat-Tailed ("Heavier-Tailed'' with Potentially Infinite Variance) Noise in Federated Learning
Figure 2 for Taming Fat-Tailed ("Heavier-Tailed'' with Potentially Infinite Variance) Noise in Federated Learning
Figure 3 for Taming Fat-Tailed ("Heavier-Tailed'' with Potentially Infinite Variance) Noise in Federated Learning
Figure 4 for Taming Fat-Tailed ("Heavier-Tailed'' with Potentially Infinite Variance) Noise in Federated Learning
Viaarxiv icon

SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning

Oct 02, 2022
Haibo Yang, Zhuqing Liu, Xin Zhang, Jia Liu

Figure 1 for SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning
Figure 2 for SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning
Figure 3 for SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning
Figure 4 for SAGDA: Achieving $\mathcal{O}(ε^{-2})$ Communication Complexity in Federated Min-Max Learning
Viaarxiv icon

Denoising of 3D MR images using a voxel-wise hybrid residual MLP-CNN model to improve small lesion diagnostic confidence

Sep 28, 2022
Haibo Yang, Shengjie Zhang, Xiaoyang Han, Botao Zhao, Yan Ren, Yaru Sheng, Xiao-Yong Zhang

Viaarxiv icon

NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data

Aug 17, 2022
Xin Zhang, Minghong Fang, Zhuqing Liu, Haibo Yang, Jia Liu, Zhengyuan Zhu

Figure 1 for NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data
Figure 2 for NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data
Figure 3 for NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data
Figure 4 for NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data
Viaarxiv icon

CHARLES: Channel-Quality-Adaptive Over-the-Air Federated Learning over Wireless Networks

May 19, 2022
Jiayu Mao, Haibo Yang, Peiwen Qiu, Jia Liu, Aylin Yener

Figure 1 for CHARLES: Channel-Quality-Adaptive Over-the-Air Federated Learning over Wireless Networks
Figure 2 for CHARLES: Channel-Quality-Adaptive Over-the-Air Federated Learning over Wireless Networks
Figure 3 for CHARLES: Channel-Quality-Adaptive Over-the-Air Federated Learning over Wireless Networks
Viaarxiv icon

Over-the-Air Federated Learning with Joint Adaptive Computation and Power Control

May 12, 2022
Haibo Yang, Peiwen Qiu, Jia Liu, Aylin Yener

Figure 1 for Over-the-Air Federated Learning with Joint Adaptive Computation and Power Control
Viaarxiv icon

Anarchic Federated Learning

Aug 23, 2021
Haibo Yang, Xin Zhang, Prashant Khanduri, Jia Liu

Figure 1 for Anarchic Federated Learning
Figure 2 for Anarchic Federated Learning
Figure 3 for Anarchic Federated Learning
Figure 4 for Anarchic Federated Learning
Viaarxiv icon

STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning

Jun 19, 2021
Prashant Khanduri, Pranay Sharma, Haibo Yang, Mingyi Hong, Jia Liu, Ketan Rajawat, Pramod K. Varshney

Figure 1 for STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning
Figure 2 for STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning
Figure 3 for STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning
Figure 4 for STEM: A Stochastic Two-Sided Momentum Algorithm Achieving Near-Optimal Sample and Communication Complexities for Federated Learning
Viaarxiv icon