Efficient Multi-stage Inference on Tabular Data

Daniel S Johnson, Igor L Markov
3/21/2023
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Many ML applications and products train on medium amounts of input data but get bottlenecked in real-time inference. When implementing ML systems, conventional wisdom favors segregating ML code into services queried by product code via Remote Procedure Call (RPC) APIs. This approach clarifies the overall software architecture and simplifies product code by abstracting away ML internals. However, the separation adds network latency and entails additional CPU overhead. Hence, we simplify inference algorithms and embed them into the product code to reduce network communication. For public datasets and a high-performance real-time platform that deals with tabular data, we show that over half of the inputs are often amenable to such optimization, while the remainder can be handled by the original model. By applying our optimization with AutoML to both training and inference, we reduce inference latency by 1.3x, CPU resources by 30%, and network communication between application front-end and ML back-end by about 50% for a commercial end-to-end ML platform that serves millions of real-time decisions per second.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{johnson2023efficient,
  title  = {Efficient Multi-stage Inference on Tabular Data},
  author = {Daniel S Johnson and Igor L Markov},
  year   = {2023},
  eprint = {2303.11580},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2303.11580v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2303.11580.svg)](https://codeofpaper.com/paper/2303.11580)

Discussion