Pith. sign in

REVIEW 1 cited by

CascadeServe: Unlocking Model Cascades for Inference Serving

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 2406.14424 v1 pith:5YGN37HH submitted 2024-06-20 cs.DC cs.LG

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

Machine learning (ML) models are increasingly deployed to production, calling for efficient inference serving systems. Efficient inference serving is complicated by two challenges: (i) ML models incur high computational costs, and (ii) the request arrival rates of practical applications have frequent, high, and sudden variations which make it hard to correctly provision hardware. Model cascades are positioned to tackle both of these challenges, as they (i) save work while maintaining accuracy, and (ii) expose a high-resolution trade-off between work and accuracy, allowing for fine-grained adjustments to request arrival rates. Despite their potential, model cascades haven't been used inside an online serving system. This comes with its own set of challenges, including workload adaption, model replication onto hardware, inference scheduling, request batching, and more. In this work, we propose CascadeServe, which automates and optimizes end-to-end inference serving with cascades. CascadeServe operates in an offline and online phase. In the offline phase, the system pre-computes a gear plan that specifies how to serve inferences online. In the online phase, the gear plan allows the system to serve inferences while making near-optimal adaptations to the query load at negligible decision overheads. We find that CascadeServe saves 2-3x in cost across a wide spectrum of the latency-accuracy space when compared to state-of-the-art baselines on different workloads.

Discussion (0). Sign in 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. AutoSLO: Practical Latency SLOs on Cloud Data Warehouses -- Extended Version

    cs.DB 2026-07 conditional novelty 6.0 of 10

    AutoSLO meets query latency SLOs on multi-cluster cloud warehouses while cutting cost ~26% versus the next-best baseline by combining forecast-driven planning, reactive scaling, and concurrency-aware routing.

Pith tools