MétaCan
Menu
Back to cohort

Early-Exit Strategies for Dynamic Graph CNNs to Accelerate Inference of Point Clouds

2025· article· W7139048563 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venuenot available
Typearticle
Language
FieldComputer Science
TopicAdvanced Graph Neural Networks
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsInferenceScalabilityGraphConvolutional neural networkPoint (geometry)Point cloudVirtual reality

Abstract

fetched live from OpenAlex

Dynamic Graph Convolutional Neural Networks (DGCNNs) are effective for processing graph-structured data, particularly point clouds used in immersive media, augmented reality (AR), and virtual reality (VR) applications. However, their inference can be computationally intensive, especially with high-resolution inputs, posing challenges for latency-sensitive and resource-constrained deployments. To address these challenges, we propose confidence-based early exit architectures tailored for fast inference in multimedia-oriented DGCNN systems. The proposed method accelerates inference by allowing samples to exit at intermediate layers once a confidence threshold is met, while preserving or even enhancing classification accuracy. Our best-performing configuration achieves a 3× speed-up alongside a 0.59% accuracy gain, while the most efficient design provides a 4.3× speed-up with only a minor accuracy trade-off. These results demonstrate the potential of early exiting as a lightweight and scalable solution for point-cloud inference in future multimedia communication systems.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.830
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.006
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0030.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.022
GPT teacher head0.317
Teacher spread0.295 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations0
Published2025
Admission routes2
Has abstractyes

Explore more

Same topicAdvanced Graph Neural NetworksFrench-language works237,207