[2402.04359] Adaptive Inference: Theoretical Limits and Unexplored Opportunities
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Machine Learning

arXiv:2402.04359 (cs)
[Submitted on 6 Feb 2024]

Title:Adaptive Inference: Theoretical Limits and Unexplored Opportunities

Authors:Soheil Hor, Ying Qian, Mert Pilanci, Amin Arbabian
View PDF HTML (experimental)
Abstract:This paper introduces the first theoretical framework for quantifying the efficiency and performance gain opportunity size of adaptive inference algorithms. We provide new approximate and exact bounds for the achievable efficiency and performance gains, supported by empirical evidence demonstrating the potential for 10-100x efficiency improvements in both Computer Vision and Natural Language Processing tasks without incurring any performance penalties. Additionally, we offer insights on improving achievable efficiency gains through the optimal selection and design of adaptive inference state spaces.
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2402.04359 [cs.LG]
  (or arXiv:2402.04359v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2402.04359

Submission history

From: Soheil Hor [view email]
[v1] Tue, 6 Feb 2024 19:49:23 UTC (676 KB)
Full-text links:

Access Paper:

license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2024-02
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)