- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
Background: This paper studies decoding algorithms to reduce the risk of copyright infringement in LLMs. Typical copyright infringment decoding has two LLMs (a risky LLM and safer anchor LLM). While decoding from the risky LLM, the algorithm ensures the divergence between the risky/anchor LLM is below a threshold.
This paper argues that as generations get longer, the divergence between the risky LLM and the anchor LLM will grow, and this will make it harder to certify that the generation is copyright-safe. This paper instead proposes generating n=64 full sequences in parallel from the anchor LLM, and then scoring them using a reward model. This ensures that the probability of copyright infringement is bounded by a low threshold of np, where p is the anchor LLM's probability of generating the copyright text. Unlike previous methods, this bound does not grow with the generation length.
The main experiments use a 1.8B anchor with 8B / 70B risky models as baselines in math, creative writing, and Wikipedia biography domains. Selection improves LLM-judged quality in some configurations and produces no observed near-verbatim copying in the clean anchor setup. However the quality gains depend on the experimental setup and do not always help factual accuracy (perhaps due to the usage of a much smaller anchor LLM). The authors additionally study the computational tradeoff between the options.
(note: the paper is very dense and hard to read, so the summary above is a best-effort after spending ~2 hours on it, I might have missed details)
Critical strengths
None
Critical weaknesses
-
The paper is confusing and very hard to understand. The exposition is unnecessarily dense and makes the work sound more substantial than it actually is. It keeps mixing what the math guarantees, what actually happens in experiments, and whether the answers are useful. I strongly urge the authors to rewrite the paper in a more accessible way for the standard ICLR readers.
-
Generating n=64 generations from an anchor LLM, followed by a rescoring step seems impractical. While I agree a lot of it can be parallelized, it needs an order of magnitude more compute to sustain the same QPS, despite sharing prefill. Why not instead have a copyright checker at inference, which can block decoding / individual tokens once they cross an n-gram thereshold of similarity against copyright corpora?
-
Training anchor LLMs at fronter LLM scale is probably not feasible. Frontier LLM pretraining is an extremely complex and expensive engineering process (millions of dollars at the minimum) and involve web-scale corpora of text. At this scale, it's hard to guarantee the the training is completely copyright-free --- even if the sources are copyright-free, there could be several derived web sources which leak content. Given these constraints, I don't think assuming access to an equal quality anchor LLM is a realistic assumption for frontier LLMs. I would much rather see significantly cheaper post-training strategies which can minimize recitation.
-
Related to (2), (3), I find it hard to imagine that significantly smaller anchor LLMs can match the quality of a frontier LLM when rescoring n=64 (unless they distill from the risky LLM, which increases copyright risk). I believe this gap will especially grow for longer agentic rollouts / complex tasks where a smaller LLM might not be able to land on the correct solution in the larger search space. Even the experiments in the paper show mixed results in quality parity, so I'm a bit skeptical overall. The selection accuracy is also fundamentally bounded by the quality of the reward model / selector judge.
Questions for authors
N/A, see above