Summary
This paper presents a system designed for decentralized inference and fine-tuning of large language models over distributed hardware, which allows users to efficiently run LLMs without requiring high-end hardware. The system leverages pipeline-based model parallelism, distributing model layers across nodes. Additionally, this work proposes fault-tolerant inference algorithms and load-balancing protocols to enable dynamic deployment of models. During the evaluation, experiments were conducted using the BLOOM-176B model, which demonstrated a 10x improvement in performance compared to the offloading method.
Strengths
The writing of this paper is fluent, with clear and logical reasoning, and the proposed solution is well-aligned with the requirements;
The design is consistent with current trends and can effectively address the problem, making it highly practical;
This paper presents a comprehensive system, with reasonable comparisons made against upper bounds and benchmarks.
Weaknesses
The innovative aspects of the paper are not sufficiently elaborated upon. For example, I would like to know if there are any outstanding advantages compared to the latest research such as DeepSpeed, aside from differences in application scenarios. Has there been any comparison of similar metrics?
The results are somewhat unsatisfactory. Caching with restarts appears to be quite competitive, and the algorithm proposed in the paper performs better only under high failure rates. However, for short sequences, Cache-less inference performs better under high failure rate conditions (which may be due to some inherent communication issues in system). It would be helpful to compare several lengths or plot curves to more clearly show the trend and find the optimal point.
Although the focus of the research is on the inference process, it would be best to systematically elaborate on the experimental results and methods related to fine-tuning for the sake of experimental completeness.
A minor suggestion is to cite Algorithms 2/3 more specifically in the text to make the writing clearer.
I am not particularly familiar with distributed learning, so please forgive me if I make any inaccuracies in my statements.
Questions
The paper mentions that autoregressive LLM inference cannot be performed with a single pass through the model, leading to a higher system complexity. Do the proposed algorithms still have advantages for models that are not autoregressive? Was this the primary design point of the system, or is it also applicable to other models?
During the evaluation of offloading, how many GPUs were used for benchmarking? Is there a strict basis for the best-case scenario?
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
3: You are fairly confident in your assessment. It is possible that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work. Math/other details were not carefully checked.
Limitations
(1)To better evaluate the system, it would be beneficial to extend the experiments to include more models.
(2)Data privacy is a concern, as multiple clients may contribute to data misuse. It would be helpful to propose some solutions to address this issue.
(3)Furthermore, the innovative aspects of the paper could be further clarified.