{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T06:01:57Z","timestamp":1767679317078,"version":"3.48.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/ton.2025.3627140","type":"journal-article","created":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T18:44:01Z","timestamp":1762195441000},"page":"1569-1581","source":"Crossref","is-referenced-by-count":0,"title":["Theoretical Analysis of Mixture-of-Experts in Mobile Edge Computing"],"prefix":"10.1109","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8173-234X","authenticated-orcid":false,"given":"Hongbo","family":"Li","sequence":"first","affiliation":[{"name":"Pillar of Engineering Systems and Design, Singapore University of Technology and Design, Tampines, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0217-6507","authenticated-orcid":false,"given":"Lingjie","family":"Duan","sequence":"additional","affiliation":[{"name":"Internet of Things Thrust, The Hong Kong University of Science and Technology, Guangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM55648.2025.11044567"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3140660"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC55385.2023.10118940"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2018.2869954"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2020.107496"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737543"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3059692"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2983119"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2985080"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2979807"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2876941"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2022.3188997"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/s0079-7421(08)60536-8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611835114"},{"key":"ref15","first-page":"16165","article-title":"Beyond not-forgetting: Continual learning with backward knowledge transfer","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lin"},{"key":"ref16","first-page":"1","article-title":"Inference for the generalization error","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Bengio"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1996.548872"},{"key":"ref18","article-title":"Learning factored representations in a deep mixture of experts","author":"Eigen","year":"2013","journal-title":"arXiv:1312.4314"},{"key":"ref19","first-page":"1","article-title":"Outrageously large neural networks: The sparsely-gated mixture-of-experts layer","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Shazeer"},{"key":"ref20","first-page":"8583","article-title":"Scaling vision with sparse mixture of experts","volume-title":"Proc. NIPS","author":"Riquelme"},{"key":"ref21","first-page":"5547","article-title":"GLaM: Efficient scaling of language models with mixture-of-experts","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"162","author":"Du"},{"key":"ref22","first-page":"288","article-title":"MegaBlocks: Efficient sparse training with mixture-of-experts","volume-title":"Proc. Mach. Learn. Syst.","author":"Gale"},{"issue":"120","key":"ref23","first-page":"1","article-title":"Switch transformers: Scaling to trillion parameter models with simple and efficient sparsity","volume":"23","author":"Fedus","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref24","first-page":"23049","article-title":"Towards understanding the mixture-of-experts layer in deep learning","volume-title":"Proc. NIPS","author":"Chen"},{"key":"ref25","first-page":"1","article-title":"Theory on mixture-of-experts in continual learning","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Li","year":"2025"},{"key":"ref26","first-page":"18332","article-title":"DeepSpeed-MoE: Advancing mixture-of-experts inference and training to power next-generation AI scale","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rajbhandari"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3577193.3593704"},{"key":"ref28","article-title":"Toward scalable generative AI via mixture of experts in mobile edge networks","author":"Wang","year":"2024","journal-title":"arXiv:2402.06942"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3399654"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19809-0_15"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.23919\/ONDM51796.2021.9492396"},{"key":"ref32","article-title":"LocMoE: A low-overhead MoE for large language model training","author":"Li","year":"2024","journal-title":"arXiv:2401.13920"},{"key":"ref33","first-page":"1","article-title":"A theoretical understanding of shallow vision transformers: Learning, generalization, and sample complexity","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Li"},{"key":"ref34","first-page":"4028","article-title":"How catastrophic can catastrophic forgetting be in linear regression?","volume-title":"Proc. Conf. Learn. Theory","author":"Evron"},{"key":"ref35","first-page":"21078","article-title":"Theory on forgetting and generalization of continual learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lin"},{"key":"ref36","first-page":"2932","article-title":"Characterizing implicit bias in terms of optimization geometry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gunasekar"},{"key":"ref37","first-page":"1","article-title":"Efficient lifelong learning with A-GEM","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Chaudhry"},{"key":"ref38","first-page":"1072","article-title":"A theoretical analysis of catastrophic forgetting through the NTK overlap matrix","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Doan"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.06.008"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2022.103366"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2023.100616"},{"key":"ref42","first-page":"396","article-title":"Handwritten digit recognition with a back-propagation network","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"2","author":"LeCun"}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/11317935\/11224727.pdf?arnumber=11224727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:57:45Z","timestamp":1767679065000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11224727\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/ton.2025.3627140","relation":{},"ISSN":["2998-4157"],"issn-type":[{"type":"electronic","value":"2998-4157"}],"subject":[],"published":{"date-parts":[[2026]]}}}