Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systems
December 23, 2023 Β· The Cartographer Β· π ACM Computing Surveys
"No code URL or promise found in abstract"
"Title-pattern auto-detect: Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systems"
Evidence collected by the PWNC Scanner
Authors
Xupeng Miao, Gabriele Oliaro, Zhihao Zhang, Xinhao Cheng, Hongyi Jin, Tianqi Chen, Zhihao Jia
arXiv ID
2312.15234
Category
cs.LG: Machine Learning
Cross-listed
cs.AI,
cs.DC,
cs.PF
Citations
129
Venue
ACM Computing Surveys
Last Checked
1 day ago
Abstract
In the rapidly evolving landscape of artificial intelligence (AI), generative large language models (LLMs) stand at the forefront, revolutionizing how we interact with our data. However, the computational intensity and memory consumption of deploying these models present substantial challenges in terms of serving efficiency, particularly in scenarios demanding low latency and high throughput. This survey addresses the imperative need for efficient LLM serving methodologies from a machine learning system (MLSys) research perspective, standing at the crux of advanced AI innovations and practical system optimizations. We provide in-depth analysis, covering a spectrum of solutions, ranging from cutting-edge algorithmic modifications to groundbreaking changes in system designs. The survey aims to provide a comprehensive understanding of the current state and future directions in efficient LLM serving, offering valuable insights for researchers and practitioners in overcoming the barriers of effective LLM deployment, thereby reshaping the future of AI.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Machine Learning
ποΈ
ποΈ
Transcended
ποΈ
ποΈ
Transcended
Continuous control with deep reinforcement learning
π
π
Old Age
Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks
π
π
Old Age
Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actor
π
π
Old Age
SGDR: Stochastic Gradient Descent with Warm Restarts
ποΈ
ποΈ
Transcended