Petals: Collaborative Inference and Fine-tuning of Large Models
Open accessAbstract
Alexander Borzunov, Dmitry Baranchuk, Tim Dettmers, Maksim Riabinin, Younes Belkada, Artem Chumachenko, Pavel Samygin, Colin Raffel. Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations). 2023.
AI snapshot
Written from the paper’s full text.
TL;DR
PETALS is a system for collaborative inference and fine-tuning of large language models by joining the resources of multiple parties, demonstrated on BLOOM-176B. It runs BLOOM-176B inference on consumer GPUs at ≈1 step per second and outperforms offloading for very large models, while exposing hidden states for parameter-efficient training.
Key findings
- PETALS runs BLOOM-176B inference on consumer GPUs at ≈1 step per second, enough for many interactive LLM applications; in a real-world setup with 14 servers across Europe and North America, it achieved 0.83 steps/s for sequence length 128 and 0.79 steps/s for sequence length 2048.
- It outperforms offloading for single-batch inference by about an order of magnitude: PETALS on 3 physical A100 servers at 1 Gbit/s and <5 ms latency reached 1.71 steps/s, versus offloading upper bounds of 0.18 steps/s on 1× A100 at 256 Gbit/s and 0.09 steps/s at 128 Gbit/s.
- 8-bit weight compression reduces the number of required nodes for BLOOM from 44 to 22, halving latency, with little quality effect: zero-shot average was 75.3 (16-bit) vs 74.9 (8-bit) for OPT-175B and 70.1 vs 70.3 for BLOOM; quantization overhead was about 5% at batch size 1 (20 tokens) and negligible for larger batches.
- With 8 clients running inference concurrently on 12 servers at 100 Mbit/s and 100 ms latency, each client gets ≈20% slowdown compared to running alone.
Methods
- PETALS uses a distributed pipeline-parallel design: servers host subsets of Transformer blocks, clients store token embeddings locally, form chains of consecutive servers, and run inference or distributed backpropagation for parameter-efficient fine-tuning such as adapters, prompt tuning, LoRA, or prefix tuning.
- The system includes fault-tolerant generation with cached activations and partial restarts, server load balancing across blocks, client-side routing by latency, dynamic blockwise quantization of hidden states, and 8-bit mixed matrix decomposition for weights.
- Evaluation used BLOOM-176B in emulated setups with 3 local A100 80GB servers and 12 virtual servers under three network configurations (1 Gbit/s <5 ms, 100 Mbit/s <5 ms, 100 Mbit/s 100 ms), plus a real-world setup of 14 servers across Europe and North America with 2× RTX 3060, 4× 2080Ti, 2× 3090, 2× A4000, and 4× A5000 GPUs; results were compared against offloading upper bounds.
Limitations
- The paper states that data privacy is an important limitation: intermediate activations for given inputs are sent to servers without encryption, so server hosts might recover user input data; it recommends using only trusted servers or an isolated PETALS swarm.
- The paper states security limitations: peers may return faulty outputs due to faulty hardware or malicious intent, and while detection/penalization approaches are discussed, privacy-preserving and secure decentralized inference without performance penalties remains an open research problem.
- The paper also notes in the appendix that peers serving the first layers can recover input tokens, and that clients are not required to run servers, which may lead to an imbalance between supply and demand; the benchmarks make evident additional performance sensitivity to higher latency, lower bandwidth, and concurrent clients.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
6 of 17 cited sources checked · 3 supported · 1 flagged · accuracy not yet measured
- Premisecitation
Offloading allows running LLMs with a single low-end accelerator by loading parameters from RAM just-in-time for each forward pass.
“This method allows running LLMs with a single low-end accelerator by loading parameters from RAM justin-time for each forward pass.”
Quote in the paperNot a substantial claim2 of 2 sources checked- cites Pudipeddi et al., 2020 source
The Abstract (p. 1) and §1.2 (p. 3) describe keeping the model in host DRAM and transferring layers to a single device as needed. But the demonstrated device is a 16 GB V100, not a low-end accelerator, and L2L runs multiple micro-batches on each layer rather than loading parameters for each forward pass. (LLM, conf=0.86)
Experimental — accuracy not yet measured - cites Ren et al., 2021 source
Section 4.1 (Single GPU Schedule) says ZeRO-Offload keeps fp16 parameters on the GPU, so forward propagation requires no CPU communication. Although it enables large-model training on a single GPU, it does not load parameters from RAM just in time for each forward pass; the paper describes that layer-by-layer transfer as L2L's approach in Section 2. (LLM, conf=0.90)
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measured
- Premisecitation
Parameter-efficient approaches are often competitive with full model fine-tuning.
“Despite their lower memory requirements, parameter-efficient approaches are often competitive with full model fine-tuning (Hu et al., 2021;Liu et al., 2021a;Yong and Nikoulina, 2022) and even outperform it in low-data regimes (Liu et al., 2022b).”
Quote in the paperNot a substantial claim1 of 3 sources checked- cites Hu et al., 2021
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites Liu et al., 2021a
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites Yong and Nikoulina, 2022 source
The Results and Discussion (p. 4) say that lightweight adaptation nearly closes the gap with upper-bound baselines for German, supporting competitiveness in that setting. The gap remains substantial for Korean, and the paper does not directly compare these approaches with full fine-tuning of the same model, so it does not establish the broader claim. (LLM, conf=0.82)
Experimental — accuracy not yet measured
- Premisecitation
LLMs often need training to achieve the best results.
“While LLMs achieve high quality on many problems with simple prompt engineering (Brown et al., 2020), they often need training to achieve the best results.”
Quote in the paperSubstantial claim1 of 1 sources checked- cites Brown et al., 2020 source
- Findingown data
Quantization has about 5% overhead with batch size 1 (20 tokens).
“In terms of inference time, Table 2 demonstrates that quantization has about 5% of overhead with batch size 1 (20 tokens), but becomes negligible for larger batches.”
Quote in the paperNot a substantial claim - Findingown data
8-bit mixed matrix decomposition has little effect on LLM quality for major benchmarks.
“As shown in Table 1, this method has little effect on LLM quality for major benchmarks.”
Quote in the paperSubstantial claim
- Findingown data
Offloading is about an order of magnitude slower for single-batch inference compared to PETALS.
“We can see that offloading is about an order of magnitude slower for single-batch inference compared to PETALS.”
Quote in the paperSubstantial claim - Findingown data
PETALS outperforms offloading for very large models.
“We demonstrate that this strategy outperforms offloading for very large models, running inference of BLOOM-176B on consumer GPUs with ≈ 1 step per second, which is enough for many interactive LLM applications.”
Quote in the paperSubstantial claim - Findingown data
In other cases, PETALS offers higher throughput than offloading for training.
“In other cases, PETALS offers higher throughput than offloading for training.”
Quote in the paperNot a substantial claim - Findingown data
Quantization overhead becomes negligible for larger batches.
“In terms of inference time, Table 2 demonstrates that quantization has about 5% of overhead with batch size 1 (20 tokens), but becomes negligible for larger batches.”
Quote in the paperNot a substantial claim - Findingown data
Parallel forward passes with large batches are affected by both bandwidth and latency.
“Parallel forward passes with large batches (used for fine-tuning and parallel inference) are affected by both bandwidth and latency.”
Quote in the paperSubstantial claim - Findingnone given
In PETALS, the intermediate activations of the model for given inputs are sent to the servers without any encryption.
“An important limitation of our work is data privacy: the intermediate activations of the model for given inputs are sent to the servers without any encryption.”
Quote in the paperSubstantial claim - Findingnone given
PETALS is a system for efficient collaborative inference and fine-tuning of large language models.
“This paper introduces PETALS, a system for efficient collaborative inference and fine-tuning of large language models.”
Quote in the paperSubstantial claim - Findingown data
For 12 servers with 100 Mbit/s bandwidth and 100 ms latency, if 8 clients run inference concurrently, each gets approximately 20% slowdown compared to running alone.
“For 12 servers with 100 Mbit/s bandwidth and 100 ms latency, if 8 clients run inference concurrently, each of them gets ≈ 20% slowdown compared to the case when it runs inference alone.”
Quote in the paperNot a substantial claim - Findingreasoning
Compressing weights to 8-bit precision changes the number of required nodes for BLOOM from 44 to 22.
“For BLOOM, this changes the number of required nodes from 44 to 22, which reduces latency in half and decreases the probability of a failure.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Each server has at least 16 GB of CPU RAM and 8 GB of GPU memory.
- Findingnone given
PETALS develops algorithms for reliable routing and load balancing.
“In addition, we develop algorithms for reliable routing and load balancing.”
Quote in the paperSubstantial claim - Findingnone given
Unlike most inference APIs, PETALS natively exposes hidden states of served models.
“Unlike most inference APIs, PETALS also natively exposes hidden states of served models, allowing to train and share custom model extensions based on efficient fine-tuning methods.”
Quote in the paperNot a substantial claim - Findingown data
PETALS runs inference of BLOOM-176B on consumer GPUs at approximately 1 step per second.
“We demonstrate that this strategy outperforms offloading for very large models, running inference of BLOOM-176B on consumer GPUs with ≈ 1 step per second, which is enough for many interactive LLM applications.”
Quote in the paperSubstantial claim - Premiseown data
Offloading has inherently high latency.
“Offloading can be efficient for processing many tokens in parallel, but it has inherently high latency: for example, generating one token at a time with BLOOM-176B takes at least 5.5 seconds for the fastest RAM offloading setup and 22 seconds for the fastest SSD offloading.”
Quote in the paperSubstantial claim - Premisereasoning
The more participants in generation, the higher the chance that one fails and the entire procedure needs to restart.
“Also, the more participants take part in the generation procedure, the higher the chance that one of them fails and the entire procedure needs to restart.”
Quote in the paperSubstantial claim - Premisereasoning
A naive restart solution for server failures has scaling issues: longer sequences require more frequent restarts, increasing inference time superlinearly.
“A naive solution would be to restart the generation procedure, treating previously generated tokens as part of the prompt.This approach has two scaling issues.When generating longer sequences, the inference would have to restart more often, increasing the inference time superlinearly.”
Quote in the paperSubstantial claim - Interpretationnone given
PETALS interface can support other popular parameter-efficient fine-tuning algorithms, such as LoRA or prefix tuning.
“This interface can also support other popular parameter-efficient fine-tuning algorithms, such as LoRA (Hu et al., 2021) or prefix tuning (Li and Liang, 2021).”
Quote in the paperNot a substantial claim0 of 2 sources checked- cites Hu et al., 2021
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites Li and Liang, 2021
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationreasoning
In the worst case, BLOOM is distributed among 44 nodes (352 GB / 8 GB per server).
“Thus, in the worst case, the model is distributed among 352 GB / 8 GB (per server) = 44 nodes.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Each server has at least 16 GB of CPU RAM and 8 GB of GPU memory.
- Interpretationreasoning
The reduction from 44 to 22 nodes decreases the probability of a failure.
“For BLOOM, this changes the number of required nodes from 44 to 22, which reduces latency in half and decreases the probability of a failure.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Each server has at least 16 GB of CPU RAM and 8 GB of GPU memory.
- Premisecitation
Current API pricing can make some research projects prohibitively expensive.
“On top of that, current API pricing can make some research projects prohibitively expensive (Liu et al., 2022a).”
Quote in the paperSubstantial claim0 of 1 sources checked- cites Liu et al., 2022a
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationreasoning
If all peers serving certain blocks leave, the rebalancing procedure quickly redistributes remaining resources to close gaps.
“In particular, if all peers serving certain blocks suddenly leave the system, this procedure quickly redistributes the remaining resources to close the emerged gaps.”
Quote in the paperSubstantial claim - Premisecitation
Parameter-efficient approaches even outperform full model fine-tuning in low-data regimes.
“Despite their lower memory requirements, parameter-efficient approaches are often competitive with full model fine-tuning (Hu et al., 2021;Liu et al., 2021a;Yong and Nikoulina, 2022) and even outperform it in low-data regimes (Liu et al., 2022b).”
- Also stated in: § Security. · plain
“and even outperform it in low-data regimes(Liu et al., 2022b).”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Liu et al., 2022b
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Also stated in: § Security. · plain
- Interpretationown data
PETALS's inference speed of approximately 1 step per second for BLOOM-176B is enough for many interactive LLM applications.
“We demonstrate that this strategy outperforms offloading for very large models, running inference of BLOOM-176B on consumer GPUs with ≈ 1 step per second, which is enough for many interactive LLM applications.”
Quote in the paperSubstantial claim - Premisereasoning
OPT-175B and BLOOM-176B need significantly more than 350 GB accelerator memory for fine-tuning.
“For instance, OPT-175B and BLOOM-176B need over 350 GB accelerator memory for inference and significantly more for fine-tuning.”
Quote in the paperSubstantial claim - Premiseown data
For very large models, fine-tuning all model parameters becomes impractical due to hardware requirements.
“However, for very large models, this strategy becomes impractical due to hardware requirements.”
Quote in the paperSubstantial claim - Premisereasoning
During generation, inference time is mostly sensitive to network latency.
“During generation, clients process one or few tokens at a time; in practice, the inference time is mostly sensitive to the network latency.”
Quote in the paperSubstantial claim - Interpretationreasoning
A key limitation of PETALS is that peers serving the first layers of the model can use their inputs to recover input tokens.
“A key limitation of our approach is that peers serving the first layers of the model can use their inputs to recover input tokens.”
Quote in the paperSubstantial claim - Premisecitation
Parameter-efficient approaches are often competitive with full model fine-tuning despite their lower memory requirements.
“Despite their lower memory requirements, parameter-efficient approaches are often competitive with full model fine-tuning(Hu et al., 2021; Liu et al., 2021a;Yong and Nikoulina, 2022)”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Hu et al., 2021; Liu et al., 2021a;Yong and Nikoulina, 2022
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationreasoning
The reduction from 44 to 22 nodes reduces latency in half.
“For BLOOM, this changes the number of required nodes from 44 to 22, which reduces latency in half and decreases the probability of a failure.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Each server has at least 16 GB of CPU RAM and 8 GB of GPU memory.
- Interpretationreasoning
Making intermediate servers send output activations directly to the next server reduces the next server's start time to one network hop instead of two.
“To address this, we can make intermediate servers send the output activations both (a) directly to the next server and (b) back to the client.This way, the next server will start computations as soon as possible (after only one network hop instead of two hops), while the client will still be able to reuse the activations in case of server failures.”
Quote in the paperSubstantial claim - Interpretationreasoning
PETALS allows training and sharing custom model extensions based on efficient fine-tuning methods.
“Unlike most inference APIs, PETALS also natively exposes hidden states of served models, allowing to train and share custom model extensions based on efficient fine-tuning methods.”
Quote in the paperSubstantial claim - Premisereasoning
The algorithm where clients send requests and receive responses from servers one by one is suboptimal for sequential inference, where performance is bounded by network latency.
“The algorithm above implies that clients send requests and receive responses from servers one by one, while servers do not directly pass activations to each other.This is suboptimal for sequential inference, where performance is bounded by the network latency.”
Quote in the paperSubstantial claim - Interpretationreasoning
It might be possible for people hosting the servers to recover the user's input data from the intermediate activations.
“As such, it might be possible for people hosting the servers to recover the user's input data.”
Quote in the paperSubstantial claim - Premiseown data
Generating one token at a time with BLOOM-176B takes 22 seconds for the fastest SSD offloading.
“Offloading can be efficient for processing many tokens in parallel, but it has inherently high latency: for example, generating one token at a time with BLOOM-176B takes at least 5.5 seconds for the fastest RAM offloading setup and 22 seconds for the fastest SSD offloading.”
Quote in the paperSubstantial claim - Premisenone given
BLOOM has 176B parameters, which takes 352 GB of GPU memory in 16-bit precision.
“For example, BLOOM has 176B parameters, which takes 352 GB of GPU memory in 16-bit precision.”
Quote in the paperSubstantial claim - Premisenone given
Generating one token at a time with BLOOM-176B takes at least 5.5 seconds for the fastest RAM offloading setup.
“Offloading can be efficient for processing many tokens in parallel, but it has inherently high latency: for example, generating one token at a time with BLOOM-176B takes at least 5.5 seconds for the fastest RAM offloading setup and 22 seconds for the fastest SSD offloading.”
Quote in the paperSubstantial claim - Interpretationreasoning
These LLMs usually require multiple high-end GPUs or multi-node clusters to be run.
“As a result, these LLMs usually require multiple highend GPUs or multi-node clusters to be run.”
Quote in the paperSubstantial claim - Interpretationcitation
As more and more users train the base model, it will effectively become more capable over time.
“This capability provides a meaningful step towards collaborative improvement of machine learning models (Raffel, 2021): as more and more users train the base model, it will effectively become more capable over time.”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites Raffel, 2021
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Premisecitation
In terms of raw FLOPs, even consumer-grade GPUs like GeForce RTX 3070 could run a complete inference step of BLOOM-176B in less than a second.
“In terms of raw FLOPs, even consumer-grade GPUs like GeForce RTX 3070 could run a complete inference step of BLOOM-176B in less than a second (NVIDIA, 2020).”
Quote in the paperNot a substantial claim0 of 1 sources checked- cites NVIDIA, 2020
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Interpretationreasoning
Servers maximize total model throughput by choosing blocks with the lowest throughput, eliminating bottlenecks.
“Formally, servers maximize the total model throughput by choosing the blocks with the lowest throughput, thus eliminating potential bottlenecks.”
Quote in the paperSubstantial claim - Interpretationreasoning
Clients can simultaneously run different training tasks on the same set of servers without interfering with one another.
“Thus, clients can simultaneously run different training tasks on the same set of servers without interfering with one another.”
Quote in the paperSubstantial claim
- May combine two claims. 22
- Classified as probably not a substantial claim. 19
May combine two claims.
InterpretationcitationUsers can insert custom local modules after some existing blocks, which could allow use-cases like retrieval-augmented generation.
“Finally, users can insert custom local modules after some of the existing blocks, which could allow use-cases like retrieval-augmented generation (Borgeaud et al., 2021;Lewis et al., 2020).”
Quote in the paperNot a substantial claim2 of 2 sources checkedClassified as probably not a substantial claim.
Findingnone givenIn PETALS, peers using the client are not required to run a server.
“In PETALS, peers using the client are not required to run a server.”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataFor the fine-tuning forward pass, offloading is competitive if multiple GPUs are used and PETALS networking is limited to 100 Mbit/s or has high latency.
“For the fine-tuning forward pass, offloading is competitive if multiple GPUs are used and the networking for PETALS is limited to 100 Mbit/s or has high latency.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Findingnone givenFor BLOOM-176B inference, clients need at least 12 GB RAM, most of which is used to store 3.6B embedding parameters.
“For BLOOM-176B inference, clients need at least 12 GB RAM, most of which is used to store 3.6B embedding parameters.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataFor OPT-175B, zero-shot accuracy with 16-bit weights is 78.5 on HellaSwag, 74.7 on LAMBADA, 72.6 on WinoGrande, and 75.3 average.
“| OPT-175B | 16 8 | 78.5 78.5 | 74.7 74.6 | 72.6 71.7 | 75.3 74.9 |”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataFor inference, performance does not depend much on bandwidth or sequence length but degrades with higher latency.
“For inference, performance does not depend much on bandwidth or sequence length but degrades with higher latency.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
Findingnone given§ Initialize distributed BLOOM model model = DistributedBloomForCausalLM \ .from_pretrained("bigscience/bloom-petals")input_ids = tokenizer(prefix_text) with model.inference_session()as session: # Session maintains a set of servers that # store attention KV from previous steps for _ in range(sequence_length): # Compute the word embeddings locally hid = model.word_embeddings(input_ids)# Run distributed Transformer blocks, # store attention KV for future steps hid = session.step(hid)# Sample the next token locally probs = model.lm_head(hid)input_ids = sample_next_token(probs) In turn, servers need at least 16 GB of CPU RAM, 100 Mbit/s bandwidth and a GPU with at least 8 GB of memory.Servers need at least 16 GB of CPU RAM, 100 Mbit/s bandwidth and a GPU with at least 8 GB of memory.
“In turn, servers need at least 16 GB of CPU RAM, 100 Mbit/s bandwidth and a GPU with at least 8 GB of memory.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Findingnone givenPETALS uses 8-bit compression that reduces the resource requirements to run very large models.
“We use 8-bit compression that reduces the resource requirements to run very large models.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.
Findingnone givenPETALS offers a user-friendly generation interface and a flexible API to access models served over the Internet.
“We offer a user-friendly generation interface and a flexible API to access models served over the Internet.”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataExisting 100B+ models can run efficiently in PETALS with dynamic quantization, prioritizing low-latency connections, and load balancing between servers.
“We demonstrate that existing 100B+ models can run efficiently in this setting with the help of several optimizations: dynamic quantization, prioritizing low-latency connections, and load balancing between servers (Section 3).”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataFor OPT-175B, zero-shot accuracy with 8-bit weights is 78.5 on HellaSwag, 74.6 on LAMBADA, 71.7 on WinoGrande, and 74.9 average.
“| OPT-175B | 16 8 | 78.5 78.5 | 74.7 74.6 | 72.6 71.7 | 75.3 74.9 |”
Quote in the paperNot a substantial claimMay combine two claims.
FindingreasoningOffloading 176B parameters takes 5.5 seconds for a regular setup and 11 seconds for a multi-GPU setup.
“As such, offloading 176B parameters takes 5.5 seconds for a regular setup and 11 seconds for a multi-GPU setup.”
Quote in the paperNot a substantial claim- The authors state this as an assumption: Offloading latency is zero for the upper bound estimation.
May combine two claims.
Findingown dataPETALS on 14 real servers in Europe and North America achieves 0.83 sequential inference steps/s for sequence length 128, 0.79 for sequence length 2048, 32.6 tokens/s for batch size 1, and 179.4 tokens/s for batch size 64 under real-world network conditions.
“| Real world | 0.83 | 0.79 | 32.6 | 179.4 |”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataFor BLOOM-176B, zero-shot accuracy with 16-bit weights is 73.0 on HellaSwag, 67.2 on LAMBADA, 70.1 on WinoGrande, and 70.1 average.
“| BLOOM | 16 8 | 73.0 72.8 | 67.2 68.1 | 70.1 70.1 | 70.1 70.3 |”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataPETALS on 12 virtual servers achieves 1.24 sequential inference steps/s for sequence length 128, 1.06 for sequence length 2048, 37.9 tokens/s for batch size 1, and 180.0 tokens/s for batch size 64 under 1 Gbit/s bandwidth and <5 ms RTT.
“| 1 Gbit/s, < 5 ms | 1.24 | 1.06 | 37.9 | 180.0 |”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataFor BLOOM-176B on 8× A100 GPUs, generation throughput with 16-bit weights is 4.18 tokens/s at batch size 1, 31.3 at batch size 8, and 100.6 at batch size 32.
“| 16-bit | 4.18 31.3 100.6 |”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataFor BLOOM-176B on 8× A100 GPUs, generation throughput with 8-bit weights is 3.95 tokens/s at batch size 1, 29.4 at batch size 8, and 95.8 at batch size 32.
“| 8-bit | 3.95 29.4 95.8 |”
Quote in the paperNot a substantial claimMay combine two claims.
Findingown dataPETALS on 3 physical servers with one A100 each achieves 1.71 sequential inference steps/s for sequence length 128, 1.54 for sequence length 2048, 70.0 tokens/s for batch size 1, and 253.6 tokens/s for batch size 64 under 1 Gbit/s bandwidth and <5 ms RTT.
“| 1 Gbit/s, < 5 ms | 1.71 | 1.54 | 70.0 | 253.6 |”
Quote in the paperSubstantial claimMay combine two claims.
Findingown dataFor BLOOM-176B, zero-shot accuracy with 8-bit weights is 72.8 on HellaSwag, 68.1 on LAMBADA, 70.1 on WinoGrande, and 70.3 average.
“| BLOOM | 16 8 | 73.0 72.8 | 67.2 68.1 | 70.1 70.1 | 70.1 70.3 |”
Quote in the paperNot a substantial claimClassified as probably not a substantial claim.
Interpretationnone givenThere is a chance that peers may send faulty outputs due to faulty hardware or malicious intent.
“Another limitation is security: while there are ways to detect and penalize peers sending faulty outputs, still there is a chance that peers may do that due to faulty hardware or a malicious intent.”
Quote in the paperSubstantial claim- The authors state this as an assumption: Servers in PETALS are run by many independent parties.
Probably not a substantial claim: may not pass S4 (based).
Premisenone givenHosting disjointed blocks would harm inference latency.
“The server only considers contiguous intervals, since hosting disjointed blocks would harm the inference latency.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
Interpretationnone givenIt is possible to leverage the AdapterHub library for training adapters in the distributed setting.
“While PETALS does not depend on AdapterHub, it is possible to leverage this library for training adapters in the distributed setting.”
Quote in the paperNot a substantial claimMay combine two claims.
Premisecitation8-bit mixed matrix decomposition separates hidden states and weights into about 0.1% of 16-bit outlier and 99.9% of 8-bit regular values, which roughly halves the memory footprint.
“This decomposition separates hidden states and weights into two portions: about 0.1% of 16-bit outlier and 99.9% of 8-bit regular values, which roughly halves the memory footprint.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites Dettmers et al., 2022a
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Probably not a substantial claim: may not pass S4 (based).
Premisenone givenParameter-efficient approaches allow rapidly switching a pretrained LLM between different uses.
“Another appealing property of these approaches for our use-case is that they allow rapidly switching a pretrained LLM between different uses.”
- Also stated in: § Security. · plain
“Another appealing property of these approaches for our use-case is that they allow rapidly switching a pretrained LLM between different uses.”
Quote in the paperNot a substantial claim- Also stated in: § Security. · plain
Probably not a substantial claim: may not pass S4 (based).
Premisenone givenOPT-175B and BLOOM-176B need over 350 GB accelerator memory for inference.
“For instance, OPT-175B and BLOOM-176B need over 350 GB accelerator memory for inference and significantly more for fine-tuning.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing), S4 (based).
InterpretationreasoningIntroducing a newer version of the model reduces to adding a new group of layers, which naturally supersedes older parameters based on the approach from Section 3.2.
“Introducing a newer version of the model then reduces to adding a new group of layers, which then naturally supersedes older parameters based on the approach from Section 3.2.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Premisenone givenAPIs are often not flexible enough for research use because there is no way to change the model control flow or access internal states.
“However, APIs are often not flexible enough for research use: there is no way to change the model control flow or access internal states.”
Quote in the paperNot a substantial claimMay combine two claims.
PremisecitationDynamic blockwise quantization halves the bandwidth requirements without any noticeable effect on generation quality.
“Dynamic blockwise quantization halves the bandwidth requirements without any noticeable effect on generation quality.”
Quote in the paperSubstantial claim0 of 1 sources checked- cites Dettmers et al., 2022b
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.
InterpretationreasoningThis may happen due to a malicious intent to influence other people's outputs or, when rewards are introduced, to earn a reward for serving layers without actually performing the calculations.
“This may happen due to a malicious intent to influence other people's outputs or, when rewards are introduced (as described above), to earn a reward for serving layers without actually performing the calculations.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
InterpretationreasoningSome servers in PETALS may be faulty and return incorrect outputs instead of the actual results of forward and backward passes.
“In practice, some of them may turn out to be faulty and return incorrect outputs instead of the actual results of forward and backward passes.”
Quote in the paperNot a substantial claim- The authors state this as an assumption: Servers in PETALS are run by many independent parties.
Probably not a substantial claim: may not pass S4 (based).
Premisenone givenUsing 100B+ parameter models requires high-end hardware unavailable to many researchers.
“Still, using these models requires high-end hardware unavailable to many researchers.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based). May combine two claims.
PremisereasoningSending two times more data does not worsen performance because sequential inference is typically not bounded by network bandwidth.
“Note that, in this case, sending two times more data does not worsen performance since, typically, sequential inference is not bounded by network bandwidth.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S3 (load-bearing).
InterpretationreasoningThis may lead to an imbalance between supply (peers who dedicate GPUs to serve model layers) and demand (peers using the servers to perform inference or fine-tuning for their own needs) in the network.
“This may lead to an imbalance between supply (peers who dedicate GPUs to serve model layers) and demand (peers using the servers to perform inference or fine-tuning for their own needs) in the network.”
Quote in the paperNot a substantial claimProbably not a substantial claim: may not pass S4 (based).
Premisenone givenFine-tuning BLOOM-176B with Adam would require almost 3 TB of GPU memory to store model, gradients, and optimizer states.
“For example, fine-tuning BLOOM-176B with Adam would require almost 3 TB of GPU memory to store model, gradients, and optimizer states.”
Quote in the paperNot a substantial claimMay combine two claims.
PremisereasoningRunning naïvely would require 44 RTX 3070 GPUs and 44 communication rounds.
“However, the GPU memory can only hold a small fraction of model layers: running naïvely would require 44 RTX 3070 GPUs and 44 communication rounds.”
Quote in the paperSubstantial claimProbably not a substantial claim: may not pass S4 (based).
Premisenone givenMany computers do not have enough RAM to offload 175B parameters.
“In addition, many computers do not have enough RAM to offload 175B parameters.”
Quote in the paperNot a substantial claim
The authors state this as an assumption.
Each server has at least 16 GB of CPU RAM and 8 GB of GPU memory.
“We assume that each server has at least 16 GB of CPU RAM, 8 GB of GPU memory.”
The authors state this as an assumption.
Offloading latency is zero for the upper bound estimation.
“We assume an offloading latency of zero for the upper bound estimation.”
The paper relies on this without support.
All models served by PETALS are already in open access.
“However, all models we serve are already in open access and thus can be exposed via APIs or other means.”
The authors state this as an assumption.
Servers in PETALS are run by many independent parties.
“We assume that servers in our system are run by many independent parties.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Petals supports collaborative deployment of a fixed LLM across volunteer GPUs, limiting flexibility in multi-model scenarios, and cannot adapt to dynamically changing resources.
“Petals (Borzunov et al., 2023) supports collaborative deployment of a fixed LLM across volunteer GPUs, limiting flexibility in multi-model scenarios, and cannot adapt to dynamically changing resources.”
From WWW.Serve: Interconnecting Global LLM Services through Decentralization (2026) · cites this paper as Borzunov et al., 2023
The Introduction supports collaborative deployment across participants’ GPUs. But Section 3.2, “Collaborating over the Internet” (page unavailable), explicitly describes rebalancing when peers leave, rerouting after server failures, and assigning layers when new servers join—contrary to the claim that Petals cannot adapt to changing resources. The cited passages do not establish the claimed limitation in multi-model scenarios. (LLM, conf=0.88)
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredPetals focuses only on model placement and request scheduling.
“They are only focus on the model placement and request scheduling.”
From Distributed LLM Serving on Consumer-Grade GPUs by Reconciling Computation and Communication (2025) · cites this paper as [4]
The Introduction describes PETALS as a platform for collaborative inference and fine-tuning, and says trained submodules can be shared on a model hub. Section 2 likewise identifies inference, adaptation, and adapter sharing as use cases. Model placement and request scheduling are therefore not its only focus. (LLM, conf=0.91)
Checked by a reasoning model — may be wrong.
Experimental — accuracy not yet measuredExisting distributed serving systems suffer from transmission competition between prefill and decode requests.
“However, existing systems [28, 14, 4, 12] suffer from transmission competition between requests at different phases.”
From Distributed LLM Serving on Consumer-Grade GPUs by Reconciling Computation and Communication (2025) · cites this paper as [4]
Section 3.3 (Benchmarks; page unavailable) reports that eight clients running inference concurrently each experienced about a 20% slowdown, supporting a general contention concern. It does not attribute that slowdown to transmission competition or distinguish prefill from decode requests. (LLM, conf=0.76)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Each contradiction between two passages listed here was confirmed by an independent check.
Offloading is faster in a case where PETALS is claimed to be faster
MajorThe statement says PETALS has higher training forward-pass throughput outside the cited limited-bandwidth or high-latency cases. Yet Table 3 reports 253.6 tokens/s for PETALS at 1 Gbit/s and <5 ms latency, versus 325.1 tokens/s for three-GPU offloading.
“In other cases, PETALS offers higher throughput than offloading for training.”
“| Offloading, max. speed on 3x A100 | | | | | | 256 Gbit/s | 0.09 | 0.09 | 5.1 | 325.1 |”
Cites
Language Models are Few-Shot Learners
Brown, T. B., Mann, B., Ryder, N., Subbiah, M., Kaplan, J., Dhariwal, P., Neelakantan, A., Shyam, P., Sastry, G., Askell, A., et al. (2020) · arXiv · doi:10.48550/arxiv.2005.14165 · Cited by 23,372 · see citing works
Transformers: State-of-the-Art Natural Language Processing
Wolf, T., Debut, L., Sanh, V., Chaumond, J., Delangue, C., Moi, A., Cistac, P., Rault, T., Louf, R., Funtowicz, M., et al. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing: System Demonstrations · doi:10.18653/v1/2020.emnlp-demos.6 · Cited by 8,741 · see citing works
LLaMA: Open and Efficient Foundation Language Models
Touvron, H., Lavril, T., Izacard, G., Martinet, X., Lachaux, M.-A., Lacroix, T., Rozière, B., Goyal, N., Hambro, E., Azhar, F., et al. (2023) · arXiv · doi:10.48550/arxiv.2302.13971 · Cited by 4,602 · see citing works
Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks
Lewis, P., Perez, E., Piktus, A., Petroni, F., Karpukhin, V., Goyal, N., Küttler, H., Lewis, M., Yih, W.-T., Rocktäschel, T., et al. (2020) · arXiv · doi:10.48550/arxiv.2005.11401 · Cited by 3,101 · see citing works
The Power of Scale for Parameter-Efficient Prompt Tuning
Lester, B., Al-Rfou, R., & Constant, N. (2021) · Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2021.emnlp-main.243 · Cited by 3,096 · see citing works
The Power of Scale for Parameter-Efficient Prompt Tuning
Lester, B., Al-Rfou, R., & Constant, N. (2021) · arXiv · doi:10.48550/arxiv.2104.08691 · Cited by 3,092
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
Maymounkov, P., & Mazières, D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45748-8_5 · Cited by 3,022 · see citing works
LoRA: Low-Rank Adaptation of Large Language Models
Hu, E. J., Shen, Y., Wallis, P., Allen-Zhu, Z., Li, Y., Wang, S., Wang, L., & Chen, W. (2021) · arXiv · doi:10.48550/arxiv.2106.09685 · Cited by 2,523 · see citing works
Prefix-Tuning: Optimizing Continuous Prompts for Generation
Li, X. L., & Liang, P. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.353 · Cited by 2,473 · see citing works
Parameter-efficient transfer learning for NLP
Houlsby, N., Giurgiu, A., Jastrzebski, S., Morrone, B., de Laroussilhe, Q., Gesmundo, A., Attariyan, M., & Gelly, S. (2019) · arXiv · doi:10.48550/arxiv.1902.00751 · Cited by 2,270 · see citing works
Scaling Laws for Neural Language Models
Kaplan, J., McCandlish, S., Henighan, T., Brown, T. B., Chess, B., Child, R., Gray, S., Radford, A., Wu, J., & Amodei, D. (2020) · arXiv · Cited by 1,749 · see citing works
Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context LearningPreprint
Liu, H., Tam, D., Muqeeth, M., Mohta, J., Huang, T., Bansal, M., & Raffel, C. A. (2022) · Neural Information Processing Systems · doi:10.48550/arxiv.2205.05638 · Cited by 1,558 · see citing works
Self-citationGLaM: Efficient Scaling of Language Models with Mixture-of-ExpertsPreprint
Du, N., Huang, Y.-P., Dai, A. M., Tong, S., Lepikhin, D., Xu, Y.-Z., Krikun, M., Zhou, Y.-Q., Yu, A. W., Firat, O., et al. (2021) · International Conference on Machine Learning · doi:10.48550/arxiv.2112.06905 · Cited by 1,379 · see citing works
Liu, X., Zheng, Y., Du, Z., Ding, M., Qian, Y., Yang, Z., & Tang, J. (2023) · AI Open · doi:10.1016/j.aiopen.2023.08.012 · Cited by 1,124 · see citing works
Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsity
Fedus, W., Zoph, B., & Shazeer, N. (2021) · arXiv · doi:10.48550/arxiv.2101.03961 · Cited by 1,005 · see citing works
Liu, X., Zheng, Y., Du, Z., Ding, M., Qian, Y., Yang, Z., & Tang, J. (2021) · arXiv · doi:10.48550/arxiv.2103.10385 · Cited by 908
AdapterHub: A Framework for Adapting Transformers
Pfeiffer, J., Rücklé, A., Poth, C., Kamath, A., Vulić, I., Ruder, S., Cho, K., & Gurevych, I. (2020) · Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP) · doi:10.18653/v1/2020.emnlp-demos.7 · Cited by 506 · see citing works
Few-Shot Parameter-Efficient Fine-Tuning is Better and Cheaper than In-Context Learning
Liu, H., Tam, D., Muqeeth, M., Mohta, J., Huang, T., Bansal, M., & Raffel, C. (2022) · neural information processing systems · doi:10.52202/068431-0142 · Cited by 445 · see citing works
Self-citationGShard: Scaling Giant Models with Conditional Computation and Automatic Sharding
Lepikhin, D., Lee, H., Xu, Y., Chen, D., Firat, O., Huang, Y., Krikun, M., Shazeer, N., & Chen, Z. (2020) · arXiv · doi:10.48550/arxiv.2006.16668 · Cited by 412 · see citing works
P-Tuning v2: Prompt Tuning Can Be Comparable to Fine-tuning Universally Across Scales and TasksPreprint
Liu, X., Ji, K., Fu, Y., Tam, W. L., Du, Z., Yang, Z., & Tang, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.07602 · Cited by 386 · see citing works
Improving language models by retrieving from trillions of tokens
Borgeaud, S., Mensch, A., Hoffmann, J., Cai, T., Rutherford, E., Millican, K., Driessche, G. V. D., Lespiau, J.-B., Damoc, B., Clark, A., et al. (2021) · arXiv · doi:10.48550/arxiv.2112.04426 · Cited by 382 · see citing works
Crosslingual Generalization through Multitask Finetuning
Muennighoff, N., Wang, T., Sutawika, L., Roberts, A., Biderman, S., Le Scao, T., Bari, M. S., Shen, S., Yong, Z. X., Schoelkopf, H., et al. (2023) · Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2023.acl-long.891 · Cited by 361 · see citing works
Self-citationA Pragmatic Introduction to Secure Multi-Party Computation
Evans, D., Kolesnikov, V., & Rosulek, M. (2018) · Foundations and Trends® in Privacy and Security · doi:10.1561/3300000019 · Cited by 334 · see citing works
LLM.int8(): 8-Bit Matrix Multiplication for Transformers at Scale
Dettmers, T., Lewis, M., Belkada, Y., & Zettlemoyer, L. (2022) · Advances in Neural Information Processing Systems 35 · doi:10.52202/068431-2198 · Cited by 305 · see citing works
Self-citationLLM.int8(): 8-bit Matrix Multiplication for Transformers at Scale
Dettmers, T., Lewis, M., Belkada, Y., & Zettlemoyer, L. (2022) · arXiv · doi:10.48550/arxiv.2208.07339 · Cited by 305 · see citing works
Self-citationGLM-130B: An Open Bilingual Pre-trained Model
Zeng, A., Liu, X., Du, Z., Wang, Z., Lai, H., Ding, M., Yang, Z., Xu, Y., Zheng, W., Xia, X., et al. (2022) · arXiv · doi:10.48550/arxiv.2210.02414 · Cited by 281 · see citing works
(2021) · doi:10.1145/3458817.3476205 · Cited by 257 · see citing works
Dynabench: Rethinking Benchmarking in NLP
Kiela, D., Bartolo, M., Nie, Y., Kaushik, D., Geiger, A., Wu, Z., Vidgen, B., Prasad, G., Singh, A., Ringshia, P., et al. (2021) · Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/2021.naacl-main.324 · Cited by 254 · see citing works
Scaling Language Models: Methods, Analysis & Insights from Training Gopher
Rae, J. W., Borgeaud, S., Cai, T., Millican, K., Hoffmann, J., Song, F., Aslanides, J., Henderson, S., Ring, R., Young, S., et al. (2021) · arXiv · doi:10.48550/arxiv.2112.11446 · Cited by 235 · see citing works
Parameter-Efficient Transfer Learning with Diff Pruning
Guo, D., Rush, A., & Kim, Y. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.378 · Cited by 220 · see citing works
A Pragmatic Introduction to Secure Multi-Party Computation
Evans, D. M., Kolesnikov, V., & Rosulek, M. (2018) · now publishers, Inc. eBooks · doi:10.1561/9781680835090 · Cited by 208 · see citing works
Zeng, W., Ren, X., Su, T., Wang, H., Liao, Y., Wang, Z., Jiang, X., Yang, Z., Wang, K., Zhang, X., et al. (2021) · arXiv · doi:10.48550/arxiv.2104.12369 · Cited by 172 · see citing works
ZeRO-Offload: Democratizing Billion-Scale Model Training
Ren, J., Rajbhandari, S., Aminabadi, R. Y., Ruwase, O., Yang, S., Zhang, M., Li, D., & He, Y. (2021) · arXiv · doi:10.48550/arxiv.2101.06840 · Cited by 151 · see citing works
A framework for few-shot language model evaluation
Sutawika, L., Gao, L., Schoelkopf, H., Biderman, S., Tow, J., Abbasi, B., fattori, B., Lovering, C., farzanehnakhaee70, Phang, J., et al. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.5371628 · Cited by 124 · see citing works
8-bit Optimizers via Block-wise QuantizationPreprint
Dettmers, T., Lewis, M., Shleifer, S., & Zettlemoyer, L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.02861 · Cited by 117 · see citing works
Self-citationTraining Neural Networks with Fixed Sparse MasksPreprint
Sung, Y.-L., Nair, V., & Raffel, C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.09839 · Cited by 74 · see citing works
Self-citationGPT-NeoX-20B: An Open-Source Autoregressive Language Model
Black, S., Biderman, S., Hallahan, E., Anthony, Q., Gao, L., Golding, L., He, H., Leahy, C., McDonell, K., Phang, J., et al. (2022) · arXiv · doi:10.48550/arxiv.2204.06745 · Cited by 67 · see citing works
ZeRO-Infinity: Breaking the GPU Memory Wall for Extreme Scale Deep LearningPreprint
Rajbhandari, S., Ruwase, O., Rasley, J., Smith, S., & He, Y. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.07857 · Cited by 60 · see citing works
Efficient Large-Scale Language Model Training on GPU ClustersPreprint
Narayanan, D., Shoeybi, M., Casper, J., LeGresley, P., Patwary, M. A., Korthikanti, V. A., Vainbrand, D., Kashinkunti, P., Bernauer, J., Catanzaro, B., et al. (2021) · arXiv (Cornell University) · Cited by 35 · see citing works
Crosslingual Generalization through Multitask Finetuning
Muennighoff, N., Wang, T., Sutawika, L., Roberts, A., Biderman, S., Scao, T. L., Bari, M. S., Shen, S., Yong, Z.-X., Schoelkopf, H., et al. (2022) · arXiv · doi:10.48550/arxiv.2211.01786 · Cited by 29 · see citing works
Self-citationTowards Crowdsourced Training of Large Neural Networks using Decentralized Mixture-of-ExpertsPreprint
Ryabinin, M., & Gusev, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2002.04013 · Cited by 28 · see citing works
Training Large Neural Networks with Constant Memory using a New Execution Algorithm
Pudipeddi, B., Mesmakhosroshahi, M., Xi, J., & Bharadwaj, S. (2020) · arXiv · doi:10.48550/arxiv.2002.05645 · Cited by 25 · see citing works
GEMv2: Multilingual NLG Benchmarking in a Single Line of Code
Gehrmann, S., Bhattacharjee, A., Mahendiran, A., Wang, A., Papangelis, A., Madaan, A., McMillan-Major, A., Shvets, A., Upadhyay, A., Bohnet, B., et al. (2022) · Conference on Empirical Methods in Natural Language Processing: System Demonstrations (EMNLP) · doi:10.18653/v1/2022.emnlp-demos.27 · Cited by 17 · see citing works
SWARM Parallelism: Training Large Models Can Be Surprisingly Communication-Efficient
Ryabinin, M., Dettmers, T., Diskin, M., & Borzunov, A. (2023) · arXiv · doi:10.48550/arxiv.2301.11913 · Cited by 8 · see citing works
Self-citationAdapting BigScience Multilingual Model to Unseen Languages
Yong, Z.-X., & Nikoulina, V. (2022) · arXiv · doi:10.48550/arxiv.2204.04873 · Cited by 3 · see citing works
OPT: Open Pre-trained Transformer Language Models
Zhang, S., Roller, S., Goyal, N., Artetxe, M., Chen, M., Chen, S., Dewan, C., Diab, M., Li, X., Lin, X. V., et al. (2022) · arXiv · doi:10.48550/arxiv.2205.01068
BLOOM: A 176B-Parameter Open-Access Multilingual Language Model
Workshop, B., :, Scao, T. L., Fan, A., Akiki, C., Pavlick, E., Ilić, S., Hesslow, D., Castagné, R., Luccioni, A. S., et al. (2022) · arXiv · doi:10.48550/arxiv.2211.05100
Self-citationDynabench: Rethinking Benchmarking in NLP
Kiela, D., Bartolo, M., Nie, Y., et al. (2021) · arXiv · doi:10.48550/arxiv.2104.14337
Efficient Large-Scale Language Model Training on GPU Clusters Using Megatron-LM
Narayanan, D., Shoeybi, M., Casper, J., et al. (2021) · arXiv · doi:10.48550/arxiv.2104.04473
Kim, B., Kim, H., Lee, S.-W., Lee, G., Kwak, D., Jeon, D. H., Park, S., Kim, S., Kim, S., Seo, D., et al. (2021) · arXiv · doi:10.48550/arxiv.2109.04650
AdapterHub: A Framework for Adapting Transformers
Pfeiffer, J., Rücklé, A., Poth, C., Kamath, A., Vulić, I., Ruder, S., Cho, K., & Gurevych, I. (2020) · arXiv · doi:10.48550/arxiv.2007.07779
Flagged first, then by citations
Cited by
Sorted by citations
EdgeShard: Efficient LLM Inference via Collaborative Edge Computing
Zhang, M., Shen, X., Cao, J., Cui, Z., & Jiang, S. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3524255 · Cited by 253 · see citing works
Integrating LLMs With ITS: Recent Advances, Potentials, Challenges, and Future Directions
Mahmud, D., Hajmohamed, H., Almentheri, S., Alqaydi, S., Aldhaheri, L., Khalil, R. A., & Saeed, N. (2025) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2025.3528116 · Cited by 100 · see citing works
Towards Efficient Generative Large Language Model Serving: A Survey from Algorithms to Systems
Miao, X., Oliaro, G., Zhang, Z., Cheng, X., Jin, H., Chen, T., & Jia, Z. (2025) · ACM Computing Surveys · doi:10.1145/3754448 · Cited by 107 · see citing works
Understanding LLMs: A comprehensive overview from training to inference
Liu, Y., He, H., Han, T., Zhang, X., Liu, M., Tian, J., Zhang, Y., Wang, J., Gao, X., Zhong, T., et al. (2024) · Neurocomputing · doi:10.1016/j.neucom.2024.129190 · Cited by 68 · see citing works
Edge-LLM: A Collaborative Framework for Large Language Model Serving in Edge Computing
Cai, F., Yuan, D., Yang, Z., & Cui, L. (2024) · IEEE International Conference on Web Services (ICWS) · doi:10.1109/icws62655.2024.00099 · Cited by 59 · see citing works
Achieving Peak Performance for Large Language Models: A Systematic Review
Rostam, Z. R. K., Szénási, S., & Kertész, G. (2024) · IEEE Access · doi:10.1109/access.2024.3424945 · Cited by 39 · see citing works
A Comprehensive Overview and Analysis of Large Language Models: Trends and Challenges
Mohammed, A., & Kora, R. (2025) · IEEE Access · doi:10.1109/access.2025.3573955 · Cited by 38 · see citing works
LLM for Mobile: An Initial Roadmap
Chen, D., Liu, Y., Zhou, M., Zhao, Y., Wang, H., Wang, S., Chen, X., Bissyandé, T. F., Klein, J., & Li, L. (2024) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3708528 · Cited by 21 · see citing works
Investigating translation for Indic languages with BLOOMZ-3b through prompting and LoRA fine-tuning
Nair, A. R., Gupta, D., & Premjith, B. (2024) · Scientific Reports · doi:10.1038/s41598-024-74617-9 · Cited by 16 · see citing works
Distributed training of large language models: A survey
Zeng, F., Gan, W., Wang, Y., & Yu, P. S. (2025) · Natural Language Processing Journal · doi:10.1016/j.nlp.2025.100174 · Cited by 12 · see citing works
He, C., Tian, Y., & Lu, Z. (2024) · Journal of Membrane Computing · doi:10.1007/s41965-024-00172-x · Cited by 10 · see citing works
Prompt Inversion Attack Against Collaborative Inference of Large Language Models
Qu, W., Zhou, Y., Wu, Y., Xiao, T., Yuan, B., Li, Y., & Zhang, J. (2025) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp61157.2025.00160 · Cited by 11 · see citing works
Language-Models-as-a-Service: Overview of a New Paradigm and its Challenges
La Malfa, E., Petrov, A., Frieder, S., Weinhuber, C., Burnell, R., Nazar, R., Cohn, A., Shadbolt, N., & Wooldridge, M. (2024) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.15865 · Cited by 9 · see citing works
Training Large Models on Heterogeneous and Geo-Distributed Resource with Constricted Networks
Zong, Z., Guo, M., Zhai, M., Tang, Y., Li, J., & Zhai, J. (2025) · Big Data Mining and Analytics · doi:10.26599/bdma.2025.9020031 · Cited by 8 · see citing works
A GPT-Based Approach for Sentiment Analysis and Bakery Rating Prediction
Magdaleno, D., Montes, M., Estrada, B., & Ochoa-Zezzatti, A. (2024) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-51940-6_7 · Cited by 7 · see citing works
Hive: A secure, scalable framework for distributed Ollama inference
Vake, D., Vičič, J., & Tošić, A. (2025) · SoftwareX · doi:10.1016/j.softx.2025.102183 · Cited by 6 · see citing works
Prediction of Boiling Heat Transfer Coefficient for Micro-Fin Using Mini-Channel
Kinjo, T., Sei, Y., Giannetti, N., Saito, K., & Enoki, K. (2024) · Applied Sciences · doi:10.3390/app14156777 · Cited by 5 · see citing works
Distributed Inference of Large Language Models on Edge Devices
Namboori, K., Suresh, R. P., Sathwik, H. J., Mohanty, S., & Rangareddy, J. (2025) · International Conference on Software and Computer Applications (ICSCA) · doi:10.1145/3731806.3731859 · Cited by 3 · see citing works
Prompt Inference Attack on Distributed Large Language Model Inference Frameworks
Luo, X., Yu, T., & Xiao, X. (2025) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3719027.3744820 · Cited by 2 · see citing works
Communication-Efficient Decentralized LLM Inference over Low-Bandwidth Distributed Nodes
Wang, Z., Shu, S., Wang, Y., Lai, I.-H., & Peng, C.-C. (2026) · International Conference on Electronics and Communication, Network and Computer Technology (ECNCT) · doi:10.1109/ecnct70535.2026.11661442 · Cited by 2 · see citing works
Singh, R. K., Bandamudi, L., Kunde, S., Mishra, M., & Singhal, R. (2024) · ACM/SPEC International Conference on Performance Engineering (ICPE) · doi:10.1145/3629526.3645045 · Cited by 2 · see citing works
JARVIS: Disjoint Large Language Models on Radio VLANs for Intelligent Services
Sirera, M., Groen, J., Liu, W., Ioannidis, S., & Chowdhury, K. R. (2024) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom61039.2024.10773726 · Cited by 2 · see citing works
Polygon training architecture for foundation models with network- and device-level heterogeneity
Li, C., Liu, F., Wu, X.-M., Huo, J., Wang, C., Liang, A., Zhao, Z., & Gao, L. (2025) · Information Fusion · doi:10.1016/j.inffus.2025.103264 · Cited by 2 · see citing works
RTT- or Bandwidth-Bound? Demystifying the KV Cache Transfer in Large Language Model Serving
Yue, S., Wang, M., Yan, Y., Cheng, W., Jiang, Z., & Zhang, Z. (2025) · doi:10.1145/3748273.3749196 · Cited by 1 · see citing works
Birds in Cages: Edge Inference Allocation for Distributed LLM Deployment
Zhu, J., Zhao, L., Xiao, F., & Duan, L. (2025) · International Workshop on Quality of Service · doi:10.1109/iwqos65803.2025.11143464 · Cited by 1 · see citing works
Context-Aware Application Recommendations in Augmented Reality
Pluisch, M., Gugenheimer, J., & Kruijff, E. (2025) · ACM Symposium on Spatial User Interaction (SUI) · doi:10.1145/3694907.3765932 · Cited by 1 · see citing works
Zero-Shot Learning for Obsolescence Risk Forecasting
Saad, E., Mrabah, A., Besbes, M., Zolghadri, M., Czmil, V., Baron, C., & Bourgeois, V. (2025) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2025.09.405 · Cited by 1 · see citing works
PC-MoE: memory-efficient and privacy-preserving collaborative training for Mixture-of-Experts LLMs
Zhang, Z.-Y., Ding, B.-L., & Low, B. (2025) · Machine-mediated learning · doi:10.1007/s10994-025-06901-2 · Cited by 1 · see citing works
Zhang, B., Hou, J., & Zhang, J. (2026) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2026.3703757 · Cited by 1 · see citing works
Federated Inference: Towards Collaborative and Privacy-Preserving Inference over Edge Devices
Fan, B., Su, X. J., Tarkoma, S., & Hui, P. (2025) · ACM SIGCOMM Conference Posters and Demos · doi:10.1145/3744969.3748418 · Cited by 1 · see citing works
Ti-skol: A Modular Federated Learning Framework Supporting Security Countermeasure Composition
Lacour, D. D., Lacoste, M., Mario Südholt, B., & Traoré, J. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10825127
Toward Sustainable AI: A Review of Energy-Efficient Large Language Models
Kaushik, B., Taneja, A., & Dahiya, S. (2025) · International Conference on Computing Methodologies and Communication (ICCMC) · doi:10.1109/iccmc65190.2025.11140923
Finding the Sweet Spot: Speed vs. Fidelity in Encrypted LLMs via Proxy Simulation
Savani, R., Benhnini, A., & Bauer, A. (2025) · IEEE International Conference on eScience · doi:10.1109/escience65000.2025.00060
Poster: Vortex: Efficient Decentralized Vector Overlay for Similarity Search and Delivery
Wang, S., Liu, Y., & Qian, C. (2025) · IEEE International Conference on Network Protocols (ICNP) · doi:10.1109/icnp65844.2025.11192399
Pan, D., Li, B., Zheng, Y., Ma, J., & Fei, V. (2025) · Journal of Computer Science and Artificial Intelligence · doi:10.54097/bvpfjj49
Pan, Y., Zhang, C., Zeng, Y., Yue, H., Hou, Z., & Xiong, J. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.108338
Inference-Time Scaling for Visual AutoRegressive Modeling by Searching Representative Samples
Tang, W., Wan, X., Li, S., & Wang, X. (2026) · Lecture notes in computer science · doi:10.1007/978-981-95-5699-1_28
Imagining a Democratic, Affordable Future of Foundation Models: A Decentralised Avenue
He, F., Nan, L., & Zhu, T. (2025) · Springer handbooks of computational statistics · doi:10.1007/978-3-031-95418-4_16
Du, C., Yu, Z., Xu, H., Wang, H., Liu, B., & Li, J. (2025) · Asia Communications and Photonics Conference · doi:10.1109/acp66871.2025.11350784
Distributed Inference Software for Large Language Models
G, H. M., Raj, P. P., Rishith, P., & Vasugi, I. (2025) · International Conference on Advances in Next-Gen Computer Science (ICANCS) · doi:10.1109/icancs65819.2025.11377729
Zhang, T., Hu, Y., Chen, S., Wang, Z., Qin, H., & Zou, Z. (2025) · International Conference on Information Communication and Software Engineering (ICICSE) · doi:10.1109/icicse66971.2025.11430117
Trust-Aware Routing for Distributed Generative AI Inference at the Edge
Nguyen, C., & Elmroth, E. (2026) · 2026 22nd International Conference on Distributed Computing in Smart Systems and the Internet of Things (DCOSS-IoT) · doi:10.1109/dcoss-iot69657.2026.00036
HyperCluster: Decentralized Large Language Model Inference over Peer-to-Peer Wireless Networks
Samarth, P., Jain, V., Raghunandan, S., Sri, A. R., & Sharma, R. (2026) · Lecture notes in computer science · doi:10.1007/978-3-032-27358-1_2
Uslu, E. E., & Dağdevıren, O. (2026) · International Symposium on AI-Driven Engineering Systems (ISADES) · doi:10.1109/isades69945.2026.11608080
Exploring the Feasibility and Performance of Distributed Llm Serving on Consumer-Grade Gpus
Jin, L., Liu, Y., Chen, Y., Guo, X., Zhang, K., Gao, Y. C., & Dong, W. (2026) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/2575-8411.2026.00077
Su, Z., Zhang, M., Zhang, X., Hong, G., You, X., & Yang, M. (2026) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3770855.3818136
Chronus: Accurate and Memory-Efficient Sketching for High-Cumulative-RTT Flow Detection
Zhang, H., Huang, H., Sun, Y.-E., & Li, C. (2026) · International Workshop on Quality of Service · doi:10.1109/iwqos70441.2026.11661093
M-CSN: Joint Architecture and Flow Scheduling for Metro-Scale AI Fabric Based on Supernodes
Guo, L., Zhao, J., Quan, W., Wang, S., Li, J., & Zhang, H. (2026) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2026.3727990
Privacy-Preserving LLM Embedding Transmission for End-Cloud Collaboration
Jin, S., Pang, X., Wang, Z., Wang, H., Du, J., Hu, J., & Ren, K. (2026) · IEEE Transactions on Networking · doi:10.1109/ton.2026.3729842
Gao, Y., Ye, Y., Huang, S., & Shao, M. (2026) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/cluster68337.2026.00050
Dai, J., & Xu, X. (2026) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2026.105370
Congestion-aware routing and dynamic replication for scalable mixture-of-experts inference
Ahmadpanah, S. H., & Mirabi, M. (2026) · Cluster Computing · doi:10.1007/s10586-026-06732-3
WWW.Serve: Interconnecting Global LLM Services through Decentralization
Wang, H., Xia, Z., Chen, Z., & Chen, B. (2026) · arXiv · doi:10.48550/arxiv.2603.20661
- Authors
- Borzunov, A., Baranchuk, D., Dettmers, T., Riabinin, M., Belkada, Y., Chumachenko, A., Samygin, P., & Raffel, C.
- Affiliations
- University of Washington (US)
- Yandex (Russia) (RU)
- Corresponding author
- Borzunov, Alexander
- Venue
- Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)
- Published
- 2023
- Pages
- 558-568
- ISSN
- 0736-587X (ISSN-L)
- OpenAlex
- W4385570483
- Cited by
- 52
- References
- 36
- Citations by year
- 2026: 15 · 2025: 24 · 2024: 13
- FWCI
- 9.21
- Type
- conference paper
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- Locations
- Proceedings of the conference - Association for Computational Linguistics. Meeting (publishedVersion, cc-by)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
- Keywords
- collaborative inference, large language models, fine-tuning, distributed inference, model parallelism
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-31.
Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-31.
Cited sources are checked by gpt-6-sol.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review