Bandit Convex Optimization for Scalable and Dynamic IoT Management
Open accessThe DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Abstract
This paper deals with online convex optimization involving both time-varying loss functions, and time-varying constraints. The loss functions are not fully accessible to the learner, and instead only the function values (also known as bandit feedback) are revealed at queried points. The constraints are revealed after making decisions, and can be instantaneously violated, yet they must be satisfied in the long term. This setting fits nicely the emerging online network tasks such as fog computing in the Internet-of-Things, where online decisions must flexibly adapt to the changing user preferences (loss functions), and the temporally unpredictable availability of resources (constraints). Tailored for such human-in-the-loop systems where the loss functions are hard to model, a family of online bandit saddle-point (BanSaP) schemes are developed, which adaptively adjust the online operations based on (possibly multiple) bandit feedback of the loss functions, and the changing environment. Performance here is assessed by: 1) dynamic regret that generalizes the widely used static regret and 2) fit that captures the accumulated amount of constraint violations. Specifically, BanSaP is proved to simultaneously yield sublinear dynamic regret and fit, provided that the best dynamic solutions vary slowly over time. Numerical tests in fog computation offloading tasks corroborate that our proposed BanSaP approach offers competitive performance relative to existing approaches that are based on gradient feedback.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“At this background, large state and action spaces in the whole offloading problem make the conventional learning algorithms [245] [256] [247] infeasible actually.”
From Convergence of Edge Computing and Deep Learning: A Comprehensive Survey (2020) · cites this paper as [247]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(2010) · Cited by 8,261
A Survey on Mobile Edge Computing: The Communication Perspective
Mao, Y., You, C., Zhang, J., Huang, K., & Letaief, K. B. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2745201 · Cited by 5,607 · cited 3×
“The online computational offloading task of fog computing in IoT [5], [6], [8] takes the form of BCO with long-term constraints (1).”
BackgroundMobile Edge Computing: A Survey on Architecture and Computation Offloading
Mach, P., & Becvar, Z. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2682318 · Cited by 3,258 · cited 3×
“, N} with moderate processing capability; thus, part of workloads will be collaboratively processed by the local fog servers to meet the stringent latency requirement, and the rest will be offloaded to the remote data center in the cloud layer [6] (see Fig.”
BackgroundEfficient multi-user computation offloading for mobile-edge cloud computing
Chen, X., Jiao, L., Li, W., & Fu, X. (2016) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2015.2487344 · Cited by 2,675 · cited 1×
“Online optimization with time-varying and long-term constraints is well motivated for applications from power control in wireless communication [26], geographical load balancing in cloud networks [14], [27], to computation offloading in fog computing [28], [29].”
BackgroundWeik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
Fog and IoT: An Overview of Research Opportunities
Chiang, M., & Zhang, T. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2584538 · Cited by 2,362 · cited 2×
“Consider a mobile network with a sensor layer, a fog layer, and a cloud layer [3], [4].”
BackgroundStochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
(2003) · Cited by 1,733
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986276 · Cited by 1,404
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S., & Cesa-Bianchi, N. (2012) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000024 · Cited by 1,295
Research works printed but not linked: 2
- chen, 2017, Bandit convex optimization for scalable and dynamic IoT management, arXiv preprint 1707 09060
- 2017, 8 Sensors to Help You Create a Smart Home
Cited by
Convergence of Edge Computing and Deep Learning: A Comprehensive Survey
Wang, X., Han, Y., Leung, V. C. M., Niyato, D., Yan, X., & Chen, X. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2970550 · Cited by 1,498
“At this background, large state and action spaces in the whole offloading problem make the conventional learning algorithms [245], [256], [247] infeasible actually.”
BackgroundIntroduction to Multi-Armed Bandits
Slivkins, A. (2019) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000068 · Cited by 780
Feng, J., Richard Yu, F., Pei, Q., Chu, X., Du, J., & Zhu, L. (2020) · IEEE Internet of Things Journal · doi:10.1109/jiot.2019.2961707 · Cited by 332
“3) Dynamic Optimization: Moreover, most of the existing works [6], [10], [11] in the computation offloading decision and resource allocation strategies are optimized based on a one-time slot, and the long-term computation offloading performance cannot be characterized [12], [13].”
BackgroundLiu, S., Chen, P.-Y., Kailkhura, B., Zhang, G., Hero, A. O., & Varshney, P. K. (2020) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.3003837 · Cited by 185
“Online sensor management provides an example of such a scenario [27], [72].”
BackgroundDistributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
Yi, X., Li, X., Xie, L., & Johansson, K. H. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.2964200 · Cited by 167
“The papers [13], [14] used a virtual queue, which essentially is a modified Lagrange multiplier, to handle stochastic and time-varying constraints and the authors of [15] extended the algorithm proposed in [14] with bandit feedback.”
Method
Metadata
- Authors
- Chen, T., & Giannakis, G. B.
- Affiliations
- University of Minnesota (US)
- Venue
- IEEE Internet of Things Journal
- Published
- 2019-02
- Volume
- 6
- Issue
- 1
- Pages
- 1276-1286
- ISSN
- 2327-4662 (ISSN-L)
- 2372-2541
- OpenAlex
- W2739805727
- Cited by
- 139
- References
- 38
- Citations by year
- 2026: 2 · 2025: 8 · 2024: 14 · 2023: 21 · 2022: 16 · 2021: 21 · 2020: 27 · 2019: 23
- FWCI
- 15.48
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Internet of Things Journal (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1509040, 1508993, 1711471)
- Topics
- Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
- Physical Sciences › Mathematics › Theoretical Computer Science › Optimization and Search Problems
- Keywords
- online convex optimization, bandit feedback, time-varying constraints, dynamic regret, constraint violation, fog computing, computation offloading, Internet of Things, human-in-the-loop systems
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bandit Convex Optimization for Scalable and Dynamic IoT Management. https://app.cochat.ai/papers/10.1109/jiot.2018.2839563
- The paper
- Chen, T., & Giannakis, G. B. (2019). Bandit Convex Optimization for Scalable and Dynamic IoT Management. IEEE Internet of Things Journal. https://doi.org/10.1109/jiot.2018.2839563
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.