Scalable and Robust Online Learning for AI-powered Networked Systems
Pages 39 - 42
Abstract
In today's world of pervasive connectivity and intelligent technologies, modern networked systems-ranging from sprawling data centers to large-scale Internet of Things (IoT) systems-have grown by leaps and bounds, unlocking numerous transformative services, like smart cities, immersive mixed reality, and generative artificial intelligence (AI). Traditional network optimization and resource allocation methods-built around static models-are increasingly unable to keep up with the evolving demands of these largescale environments. AI-driven solutions are emerging as game-changers, enabling networked systems to process massive streams of data in real time and adapt seamlessly to ever-changing demands. For instance, AI-powered softwaredefined networking (SDN) controllers can instantly reroute traffic in data centers to prevent congestion, while reinforcement learning (RL)-based task offloading can intelligently allocate resources in massive IoT systems. These advancements make AI central to the next generation of intelligent, adaptive network ecosystems.
References
[1]
Xutong Liu, Jinhang Zuo, Xiaowei Chen, Wei Chen, John C.S. Lui. Multi-layered Network Exploration via Random Walks: From Offline Optimization to Online Learning. ICML, 2021. (Long Oral)
[2]
Xutong Liu, Jinhang Zuo, Xiaowei Chen, Wei Chen, John C.S. Lui. Batch-size independent regret bounds for combinatorial semi-bandits with probabilistically triggered arms or independent arms. NeurIPS, 2022.
[3]
Xutong Liu, Xiangxiang Dai, Xuchuang Wang, Mohammad Hajiesmaili, John C.S. Lui. Combinatorial Logistic Bandits. SIGMETRICS, 2025. (To appear)
[4]
Xutong Liu, Jinhang Zuo, Siwei Wang, John C.S. Lui, Mohammad Hajiesmaili, Adam Wierman, and Wei Chen. Contextual combinatorial bandits with probabilistically triggered arms. ICML, 2023.
[5]
Xutong Liu, Jinhang Zuo, Hong Xie, Carlee Joe- Wong, and John C.S. Lui. Variance-adaptive algorithm for probabilistic maximum coverage bandits with general feedback. INFOCOM, 2023.
[6]
Xutong Liu, Jinhang Zuo, Junkai Wang, Zhiyong Wang, Yuedong Xu, and John C.S. Lui. Learning Context-Aware ProbabilisticMaximum Coverage Bandits: A Variance-Adaptive Approach. INFOCOM, 2024.
[7]
Xutong Liu, Haoru Zhao, Tong Yu, Shuai Li, John C.S. Lui. Federated Online Clustering of Bandits. UAI, 2022.
[8]
Hantao Yang, Xutong Liu, ZhiyongWang, Hong Xie, John C.S. Lui, Defu Lian, and Enhong Chen. Federated Contextual Cascading Bandits with Asynchronous Communication and Heterogeneous Users. AAAI, 2024.
[9]
Xutong Liu, Siwei Wang, Jinhang Zuo, Han Zhong, Xuchuang Wang, Zhiyong Wang, Shuai Li, Mohammad Hajiesmaili, John C.S. Lui, and Wei Chen. Combinatorial Multivariant Multi-Armed Bandits with Applications to Episodic Reinforcement Learning and Beyond. ICML, 2024.
[10]
Zhiyong Wang, Jize Xie, Xutong Liu, Shuai Li, John C.S. Lui. Online Clustering of Bandits with Misspecified User Models. NeurIPS, 2023.
[11]
Xiangxiang Dai, Zeyu Zhang, Peng Yang, Yuedong Xu, Xutong Liu, John C.S. Lui. AxiomVision: Accuracy- Guaranteed Adaptive Visual Model Selection for Perspective- Aware Video Analytics. ACM MM, 2024.
[12]
Xiangxiang Dai, Jin Li, Xutong Liu, Anqi Yu, John C.S. Lui. Cost-Effective Online Multi-LLM Selection with Versatile Reward Models. arXiv:2405.16587, 2024.
Index Terms
- Scalable and Robust Online Learning for AI-powered Networked Systems
Index terms have been assigned to the content through auto-classification.
Recommendations
Active Learning for Streaming Networked Data
CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge ManagementMining high-speed data streams has become an important topic due to the rapid growth of online data. In this paper, we study the problem of active learning for streaming networked data. The goal is to train an accurate model for classifying networked ...
Comments
Information & Contributors
Information
Published In
Copyright © 2025 Copyright is held by the owner/author(s).
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 11 January 2025
Published in SIGMETRICS Volume 52, Issue 3
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 12Total Downloads
- Downloads (Last 12 months)12
- Downloads (Last 6 weeks)12
Reflects downloads up to 25 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in