Pith. sign in

REVIEW 1 cited by

Tiny Models are the Computational Saver for Large Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.17726 v4 pith:FVPBNSBS submitted 2024-03-26 cs.AI

classification cs.AI
keywords modelscomputationalmodelcompressiontinylargeapproachdynamic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This paper introduces TinySaver, an early-exit-like dynamic model compression approach which employs tiny models to substitute large models adaptively. Distinct from traditional compression techniques, dynamic methods like TinySaver can leverage the difficulty differences to allow certain inputs to complete their inference processes early, thereby conserving computational resources. Most existing early exit designs are implemented by attaching additional network branches to the model's backbone. Our study, however, reveals that completely independent tiny models can replace a substantial portion of the larger models' job with minimal impact on performance. Employing them as the first exit can remarkably enhance computational efficiency. By searching and employing the most appropriate tiny model as the computational saver for a given large model, the proposed approaches work as a novel and generic method to model compression. This finding will help the research community in exploring new compression methods to address the escalating computational demands posed by rapidly evolving AI models. Our evaluation of this approach in ImageNet-1k classification demonstrates its potential to reduce the number of compute operations by up to 90\%, with only negligible losses in performance, across various modern vision models.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AdaScale: Dynamic Context-aware DNN Scaling via Automated Adaptation Loop on Mobile Devices

    cs.AI 2024-12 conditional novelty 4.0 of 10

    AdaScale continuously rescales a deployed neural network to match a mobile device's fluctuating resources, reporting faster inference and lower energy use while keeping accuracy loss small.

Pith tools