CoChat

Bandit Convex Optimization for Scalable and Dynamic IoT Management

Open access
Chen, Tianyi, Giannakis, Georgios B. · 2019 · IEEE Internet of Things Journal

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/jiot.2018.2839563

Cites

40 of 40 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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?

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

Show all 40 references

Research works printed but not linked: 2

  1. chen, 2017, Bandit convex optimization for scalable and dynamic IoT management, arXiv preprint 1707 09060
  2. 2017, 8 Sensors to Help You Create a Smart Home

Cited by

See all 139

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
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.