Cited by 53Topic ModelingNatural Language Processing TechniquesDomain Adaptation and Few-Shot Learning

Petals: Collaborative Inference and Fine-tuning of Large Models

Open access
Borzunov, Alexander, Baranchuk, Dmitry, Dettmers, Tim, Riabinin, Maksim, Belkada, Younes, Chumachenko, Artem, Samygin, Pavel, Raffel, Colin·2023·Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics (Volume 3: System Demonstrations)

Abstract

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

Crossref · 10.18653/v1/2023.acl-demo.54

Cites

48 of 51 references verified0 citation errors · 3 not checkable

Statistics

Nothing to recompute.

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
  • May combine two claims. 22
  • Classified as probably not a substantial claim. 19
  • May combine two claims.

    Interpretationcitation

    Users 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 checked
    • cites Borgeaud et al., 2021 source
    • cites Lewis et al., 2020 source
  • Classified as probably not a substantial claim.

    Findingnone given

    In 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based). May combine two claims.

    Findingnone given

    For 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • Probably 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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Findingnone given

    PETALS 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing). May combine two claims.

    Findingnone given

    PETALS 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 claim
  • May combine two claims.

    Findingown data

    Existing 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • May combine two claims.

    Findingreasoning

    Offloading 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 data

    PETALS 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • May combine two claims.

    Findingown data

    PETALS 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • May combine two claims.

    Findingown data

    PETALS 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 claim
  • May combine two claims.

    Findingown data

    For 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 claim
  • Classified as probably not a substantial claim.

    Interpretationnone given

    There 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 given

    Hosting 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationnone given

    It 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 claim
  • May combine two claims.

    Premisecitation

    8-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 given

    Parameter-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
  • Probably not a substantial claim: may not pass S4 (based).

    Premisenone given

    OPT-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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing), S4 (based).

    Interpretationreasoning

    Introducing 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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Premisenone given

    APIs 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 claim
  • May combine two claims.

    Premisecitation

    Dynamic 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.

    Interpretationreasoning

    This 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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Interpretationreasoning

    Some 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 given

    Using 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 claim
  • Probably not a substantial claim: may not pass S4 (based). May combine two claims.

    Premisereasoning

    Sending 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 claim
  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Interpretationreasoning

    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.

    “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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Premisenone given

    Fine-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 claim
  • May combine two claims.

    Premisereasoning

    Running 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 claim
  • Probably not a substantial claim: may not pass S4 (based).

    Premisenone given

    Many 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
36 of 36
  • 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.”
4 of 4

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 measured
  • Petals 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 measured
  • Existing 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

    Major

    The 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.

1 of 1

Cites

Flagged first, then by citations

Cited by

Sorted by citations

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
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