CoChat

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

EPNet: Learning to Exit with Flexible Multi-Branch Network

Dai, Xin, Kong, Xiangnan, Guo, Tian · 2020 · Proceedings of the 29th ACM International Conference on Information & Knowledge Management

Abstract

Dynamic inference is an emerging technique that reduces the computational cost of deep neural network under resource-constrained scenarios, such as inference on mobile devices. One way to achieve dynamic inference is to leverage multi-branch neural networks that apply different computation on input data by following different branches. Conventional research on multi-branch neural networks mainly targeted at improving the accuracy of each branch, and use manually designed rules to decide which input follows which branch of the network. Furthermore, these networks often provide a small number of exits, limiting their ability to adapt to external changes. In this paper, we investigate the problem of designing a flexible multi-branch network and early-exiting policies that can adapt to the resource consumption to individual inference request without impacting the inference accuracy. We propose a lightweight branch structure that also provides fine-grained flexibility for early-exiting and leverage Markov decision process (MDP) to automatically learn the early-exiting policies. Our proposed model, EPNet, was effective in reducing inference cost without impacting accuracy by choosing the most suitable branch exit. We also observe that EPNet achieved 3% higher accuracy with an inference budget, compared to state-of-the-art approaches.

Overview

Integrity signals

Registry

Crossref · 10.1145/3340531.3411973

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 24 references

Research works printed but not linked: 1

  1. Song Han Jeff Pool John Tran and William Dally. 2015. Learning both weights and connections for efficient neural network. InAdvances in Neural Information Processing Systems 28 (NeurIPS'15). 1135--1143. Song Han Jeff Pool John Tran and William Dally. 2015. Learning both weights and connections for efficient neural network. InAdvances in Neural Information Processing Systems 28 (NeurIPS'15). 1135--1143.

Cited by

See all 48

Metadata

Authors
Dai, X., Kong, X., & Guo, T.
Affiliations
Worcester Polytechnic Institute (US)
Venue
Proceedings of the 29th ACM International Conference on Information & Knowledge Management
Publisher
ACM
Published
2020-10-19
Pages
235-244
ISSN
2155-0751 (ISSN-L)
OpenAlex
W3094307698
Cited by
48
References
24
Citations by year
2026: 6 · 2025: 9 · 2024: 14 · 2023: 10 · 2022: 4 · 2021: 5
FWCI
1.47
Type
conference paper
Language
en
Open access
closed
Locations
ACM International Conference on Information and Knowledge Management (CIKM) (publishedVersion)
Funders
NSF (CNS-1815619)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Computer Networks and Communications › IoT and Edge/Fog Computing
Keywords
dynamic inference, multi-branch network, Markov decision process, resource-constrained inference, mobile devices, inference cost reduction

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: EPNet: Learning to Exit with Flexible Multi-Branch Network. https://app.cochat.ai/papers/10.1145/3340531.3411973
The paper
Dai, X., Kong, X., & Guo, T. (2020). EPNet: Learning to Exit with Flexible Multi-Branch Network. Proceedings of the 29th ACM International Conference on Information & Knowledge Management. https://doi.org/10.1145/3340531.3411973

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.