Digital Twin for Federated Analytics Using a Bayesian Approach

被引:24
作者
Chen, Dawei [1 ]
Wang, Dan [2 ]
Zhu, Yifei [3 ]
Han, Zhu [1 ,4 ]
机构
[1] Univ Houston, Dept Elect & Comp Engn, Houston, TX 77004 USA
[2] Hong Kong Polytech Univ, Dept Comp, Hong Kong, Peoples R China
[3] Shanghai Jiao Tong Univ, Univ Michigan, Shanghai Jiao Tong Univ Joint Inst, Shanghai 200240, Peoples R China
[4] Kyung Hee Univ, Dept Comp Sci & Engn, Seoul 446701, South Korea
关键词
Digital twin; Monte Carlo methods; Markov processes; Internet of Things; Distributed databases; Data models; Convergence; Delayed rejection; digital twin; edge computing; federated analytics; finite Gaussian mixture; Markov chain Monte Carlo (MCMC); MONTE-CARLO METHODS; SCHEME;
D O I
10.1109/JIOT.2021.3098692
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We are now in an information era and the volume of data is growing explosively. However, due to privacy issues, it is very common that data cannot be freely shared among the data generating. Federated analytics was recently proposed aiming at deriving analytical insights among data-generating devices without exposing the raw data, but the intermediate analytics results. Note that the computing resources at the data generating devices are limited, thus making on-device execution of computing-intensive tasks challenging. We thus propose to apply the digital twin technique, which emulates the resource-limited physical/end side, while utilizing the rich resource at the virtual/computing side. Nevertheless, how to use the digital twin technique to assist federated analytics while preserving distributed data privacy is challenging. To address such a challenge, this work first formulates a problem on digital twin-assisted federated distribution discovery. Then, we propose a federated Markov chain Monte Carlo with a delayed rejection (FMCMC-DR) method to estimate the representative parameters of the global distribution. We combine a rejection-acceptance sampling technique and a delayed rejection technique, allowing our method to be able to explore the full state space. Finally, we evaluate FMCMC-DR against the Metropolis-Hastings (MH) algorithm and random walk Markov chain Monte Carlo method (RW-MCMC) using numerical experiments. The results show our algorithm outperforms the other two methods by 50% and 95% contour accuracy, respectively, and has a better convergence rate.
引用
收藏
页码:16301 / 16312
页数:12
相关论文
共 42 条
[11]   An empirical comparison of EM, SEM and MCMC performance for problematic Gaussian mixture likelihoods [J].
Dias, JG ;
Wedel, M .
STATISTICS AND COMPUTING, 2004, 14 (04) :323-332
[12]   Deep Learning for Hybrid 5G Services in Mobile Edge Computing Systems: Learn From a Digital Twin [J].
Dong, Rui ;
She, Changyang ;
Hardjawana, Wibowo ;
Li, Yonghui ;
Vucetic, Branka .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (10) :4692-4707
[13]   Digital-Twin-Based Job Shop Scheduling Toward Smart Manufacturing [J].
Fang, Yilin ;
Peng, Chao ;
Lou, Ping ;
Zhou, Zude ;
Hu, Jianmin ;
Yan, Junwei .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2019, 15 (12) :6425-6435
[14]   A Digital Twin Based Industrial Automation and Control System Security Architecture [J].
Gehrmann, Christian ;
Gunnarsson, Martin .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (01) :669-680
[15]   Delayed rejection in reversible jump Metropolis-Hastings [J].
Green, PJ ;
Mira, A .
BIOMETRIKA, 2001, 88 (04) :1035-1053
[16]  
Grieves M., 2017, Transdisciplinary Perspectives on Complex Systems: New Findings and Approaches, P85, DOI [DOI 10.1007/978-3-319-38756-7_4, 10.1007/978-3-319-38756-7_4 10.1007/978-3-319-38756-7_4, 10.1007/978-3-319-38756-7_4]
[17]   Componentwise adaptation for high dimensional MCMC [J].
Haario, H ;
Saksman, E ;
Tamminen, J .
COMPUTATIONAL STATISTICS, 2005, 20 (02) :265-273
[18]   DRAM: Efficient adaptive MCMC [J].
Haario, Heikki ;
Laine, Marko ;
Mira, Antonietta ;
Saksman, Eero .
STATISTICS AND COMPUTING, 2006, 16 (04) :339-354
[19]  
Kairouz P., 2020, FEDERATED LEARNING A
[20]  
Khan L. U., 2020, IEEE ACCESS, V8