Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Runsheng Bai

dblp:372/4528 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Efficient and distributed learning · 100%
Software engineering, system software, and programming languages
1 paper
Compilers and program optimization · 100%

Topics — the 5 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
deep learning compilers
0.912025
depyf: Open the Opaque Box of PyTorch Compiler for Machine Learning Researchers · J. Mach. Learn. Res. 2025
Machine learning › Efficient and distributed learning › model compression › quantization
mixed-precision quantization
0.912025
SKIM: Any-bit Quantization Pushing The Limits of Post-Training Quantization · ICML 2025
Machine learning › Efficient and distributed learning
model compression
0.912025
SKIM: Any-bit Quantization Pushing The Limits of Post-Training Quantization · ICML 2025
Machine learning › Efficient and distributed learning › model compression › quantization
post-training quantization
0.912025
SKIM: Any-bit Quantization Pushing The Limits of Post-Training Quantization · ICML 2025
Machine learning › Efficient and distributed learning › model compression
quantization
0.912025
SKIM: Any-bit Quantization Pushing The Limits of Post-Training Quantization · ICML 2025

Methods — techniques the papers use, named apart from their topics

bytecode decompilation · 1.7scaled k-means clustering · 0.9greedy bit allocation · 0.9
YearPublicationVenuePosition
2025 SKIM: Any-bit Quantization Pushing The Limits of Post-Training Quantization
abstract
Large Language Models (LLMs) exhibit impressive performance across various tasks, but deploying them for inference poses challenges. Their high resource demands often necessitate complex, costly multi-GPU pipelines, or the use of smaller, less capable models. While quantization offers a promising solution utilizing lower precision for model storage, existing methods frequently experience significant performance drops at lower precision levels. Additionally, they typically provide only a limited set of solutions at specific bit levels, many of which are extensively manually tuned. To address these challenges, we propose a new method called SKIM: Scaled K-means clustering wIth Mixed precision. Our approach introduces two novel techniques: 1. A greedy algorithm to solve approximately optimal bit allocation across weight channels, and 2. A trainable scaling vector for non-differentiable K-means clustering. These techniques substantially improve the model performance and can be adapted to any given bit. Notably, in terms of perplexity, our method narrows the gap between quantized LLaMA models and their full precision counterparts by around 14% on average.
Runsheng Bai, Bo Liu 0042, Qiang Liu 0001
ICML1
2025 depyf: Open the Opaque Box of PyTorch Compiler for Machine Learning Researchers
abstract
PyTorch 2.x introduces a compiler designed to accelerate deep learning programs. However, for machine learning researchers, fully leveraging the PyTorch compiler can be challenging due to its operation at the Python bytecode level, making it appear as an opaque box. To address this, we introduce depyf, a tool designed to demystify the inner workings of the PyTorch compiler. depyf decompiles the bytecode generated by PyTorch back into equivalent source code and establishes connections between the code objects in the memory and their counterparts in source code format on the disk. This feature enables users to step through the source code line by line using debuggers, thus enhancing their understanding of the underlying processes. Notably, depyf is non-intrusive and user-friendly, primarily relying on two convenient context managers for its core functionality. The project is openly available at https://github.com/thuml/depyf and is recognized as a PyTorch ecosystem project at https://pytorch.org/blog/introducing-depyf.
Kaichao You, Runsheng Bai, Jianmin Wang 0001, Ion Stoica, Mingsheng Long
J. Mach. Learn. Res.2