Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 338

The DOI matches its Crossref record; 47 of the 47 references it cites were found in a registry or an index.

Learning Task-Oriented Communication for Edge Inference: An Information Bottleneck Approach

Open access
Shao, Jiawei, Mao, Yuyi, Zhang, Jun · 2022 · IEEE Journal on Selected Areas in Communications

Abstract

This paper investigates task-oriented communication for edge inference, where a low-end edge device transmits the extracted feature vector of a local data sample to a powerful edge server for processing. It is critical to encode the data into aninformativeandcompactrepresentation for low-latency inference given the limited bandwidth. We propose a learning-based communication scheme that jointly optimizes feature extraction, source coding, and channel coding in a task-oriented manner, i.e., targeting the downstream inference task rather than data reconstruction. Specifically, we leverage an information bottleneck (IB) framework to formalize a rate-distortion tradeoff between the informativeness of the encoded feature and the inference performance. As the IB optimization is computationally prohibitive for the high-dimensional data, we adopt a variational approximation, namely the variational information bottleneck (VIB), to build a tractable upper bound. To reduce the communication overhead, we leverage a sparsity-inducing distribution as the variational prior for the VIB framework to sparsify the encoded feature vector. Furthermore, considering dynamic channel conditions in practical communication systems, we propose a variable-length feature encoding scheme based on dynamic neural networks to adaptively adjust the activated dimensions of the encoded feature to different channel conditions. Extensive experiments evidence that the proposed task-oriented communication system achieves a better rate-distortion tradeoff than baseline methods and significantly reduces the feature transmission latency in dynamic channel conditions.

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/jsac.2021.3126087

Cites

47 of 47 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

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

Research works printed but not linked: 8

  1. choi, 2019, Neural joint source-channel coding, Proc Int Conf Mach Learn, 1182
  2. alemi, 2017, Deep variational information bottleneck, Proc Int Conf Learn Represent, 1
  3. wen, 2016, Learning structured sparsity in deep neural networks, Proc Int Conf Neural Inf Process, 2082
  4. 10.1109/ISIT.2004.1365385 · doi:10.1109/isit.2004.1365385
  5. kingma, 2015, Variational dropout and the local reparameterization trick, Proc Adv Neural Inf Process Syst, 2575
  6. 10.1109/MSPEC.2020.9078454 · doi:10.1109/mspec.2020.9078454
  7. le, 2015, Tiny imagenet visual recognition challenge
  8. molchanov, 2017, Variational dropout sparsifies deep neural networks, Proc Int Conf Mach Learn, 2498

Cited by

See all 338

Metadata

Authors
Shao, J., Mao, Y., & Zhang, J.
Venue
IEEE Journal on Selected Areas in Communications
Published
2022-01
Volume
40
Issue
1
Pages
197-211
ISSN
  • 0733-8716 (ISSN-L)
  • 1558-0008
OpenAlex
W3214462705
Cited by
338
References
47
FWCI
19.33
Type
journal article
Language
en
Open access
green

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

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.