Provable Copyright Protection for Generative Models

See arxiv link for paper by Nikhil Vyas, Sham Kakade, and me.

Conditional generative models hold much promise for novel content creation. Whether it is generating a snippet of code, piece of text, or image, such models can potentially save substantial human effort and unlock new capabilities. But there is a fly in this ointment. These models are trained on vast quantities of data, much of which is copyrighted. Due to precedents such as Authors Guild vs Google, many legal scholars believe that training a machine-learning model on copyrighted material constitutes fair use. However, the legal permissibility of using the sampled outputs of such models could be a different matter.

This is not just a theoretical concern. Large models do memorize significant chunks of their training data. For example, if you feed the first sentence of Harry Potter and the Sorcerer’s Stone to GPT-3, it provides the remaining ones:

Left - first page of Harry Potter Book 1. Right - GPT3 Playground showing that if we input the first sentence, it completes the rest.

(To be fair to GPT-3, this text likely appears many times in its training set; deduplication can help with reducing memorization but is not a panacea.)

Similarly, as shown by Carlini et al, diffusion models can (and do) memorize images from their training set as well; see this figure from their paper:

Figure 1 from Carlini et al. Left: an image from Stable Diffusion’s training set (licensed CC BY-SA 3.0). Right: a Stable Diffusion generation when prompted with “Ann Graham Lotz.” (Their attack focused on images appearing at least 100 times in the training set, though see section 7.1 for discussion on the effect of deduplication.) — *Figure 1 from* *Carlini et al*. Left: an image from Stable Diffusion’s training set (licensed CC BY-SA 3.0). Right: a Stable Diffusion generation when prompted with “Ann Graham Lotz.” (Their attack focused on images appearing at least 100 times in the training set, though see Section 7.1 in their paper for discussion on the effect of deduplication.)

Given the above, if you use a generated code in your program or a generated art in your design, how can you be sure it is not substantially similar to some copyrighted work from the training set, with all the legal and ethical implications this entails?

In a new paper, we (Nikhil, Sham, and Boaz) provide a formalism that enables rigorous guarantees on the similarity (and, more importantly, guarantees on the lack of similarity) between the output of a generative model and any potentially copyrighted data in its training set. Our work is not just theoretical: we give algorithms that can transform a training pipeline into one that satisfies our definition with minimal degradation in efficiency and quality of output. We demonstrate this on both language (transformer) and image (diffusion) models.

As noted in our paper, there are a number of ethical and legal issues in generative models. We should emphasize that our work focuses solely only on copyright infringements by the outputs of these models, and our concepts and tools do not address issues related to other forms of intellectual property, including privacy, trademarks, or fair use. Also, despite superficial similarities between the goals of privacy and copyright protection, these notions are distinct, and our work shows that solution concepts for the latter need not address the former. (See the paper for a detailed discussion of the differences between our definition and differential privacy.)

This post only provides an informal presentation of the concepts and tools formally defined in the paper. Please see the paper for full details.

The Technical Concept: Near Access-Freeness

Our definition is motivated by laws of the U.S. and many other countries to establish that copyright infringement has occurred. This requires:

Access: To prove that a copyright infringement took place, the plaintiff needs to prove that “the defendant had access to the plaintiff’s copyrighted work.”
Substantial similarity. The plaintiff also needs to prove there are “substantial similarities between the defendant’s work and original elements of the plaintiff’s work.” The Feist v. Rural U.S. Supreme Court Opinion states that this similarity must be the result of actual copying and not fortuitous similarity: In their words: “assume two poets, each ignorant of the other, compose identical poems … both are original and, hence, copyrightable.”

A natural candidate to capture the notion of access is to say that a generative model $p$ had access to some copyrighted piece of data $C$ if $C$ was included in $p$ ’s training set (our formalism permits other notions of access as well). Formally defining “substantial similarity” is arguably subtler. Simple measures such as Hamming distance or verbatim copying don’t cut it. For example, in Andy Warhol Foundations v. Goldsmith, a case currently before the supreme court, the question is whether Warhol’s transformations of Goldsmith’s photo of Prince constitute “fair use.”

*Images at the heart of the Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith lawsuit. Image from the collection of the supreme court of the United States.*

Some of these transformations result in significant Hamming distance, though they can all be captured in only a few bits of information. Rather than wade into these issues, we use the fact that generative models are inherently probabilistic. Hence we can use distance measures between distributions that are information-theoretic and agnostic to superficial issues such as pixel-based representations. Our formalization is the following:

Definition 1 (Near Access Freeness – NAF): Let $p$ be a conditional generative model, $x$ be a prompt. Suppose that for every copyrighted data $C$ in the training set, $\mathsf{safe}_C$ is a model that has not accessed $C$ . We say that $p$ is $k_x$ – near access-free with respect to $\Delta$ and a function $\mathsf{safe}$ , if $\Delta( p(\cdot | x) \| \mathsf{safe}_C(\cdot | x) ) \leq k_x$ where $\Delta$ is a divergence measure such as the KL divergence or the Renyi divergence of order infinity.

This definition reduces the task of determining a copyright infringement to (1) a quantitative question of the acceptable value of $k$ , and (2) a qualitative question of providing a $\mathsf{safe}$ function that appropriately satisfies a no access condition. Both can be application-dependent: the number of bits that constitute copyrightable content differs between, e.g., poems and images, and the $\mathsf{safe}$ function could also differ based on application.

Definition 1 is stringent in the sense that it bounds (by $k_x$ ) the number of bits that could be “leaked” from $C$ to the output of the generative model, no matter what transformation was used. Note that if a model was trained without access to $C$ then we expect the likelihood of outputting a work similar to $C$ should be extremely low, as this is a “monkeys on a typewriter” event. Furthermore, even if this event happened, then under copyright law, it would not be an infringement since (to quote Feist v. Rural) it would constitute “fortuitous similarity.”

An illustration of a candidate $latex \mathsf{safe}_C&bg=ffffff$ function, which was trained without access to a given copyrighted piece of data $latex C&bg=ffffff$. It is reasonable to expect the probability of outputs of the $latex \mathsf{safe}_C&bg=ffffff$ model would assign an exponentially small likelihood to any outputs that are substantially similar to $latex C&bg=ffffff$. Hence a probability distribution that has bounded divergence from the safe model would also be extremely unlikely to output those. — A cartoon of the output distribution induced by a “safe” model *$\mathsf{safe}_C$* , which was trained without access to a given copyrighted piece of data $C$ . It is reasonable to expect the probability of outputs of the model $\mathsf{safe}_C$ would assign an exponentially small likelihood to any outputs that are substantially similar to $C$ . Hence a probability distribution that has bounded divergence from the safe model would also be extremely unlikely to output those.

A cartoon of the output distribution induced by a “safe” model *$\mathsf{safe}_C$* , which was trained without access to a given copyrighted piece of data $C$ . It is reasonable to expect the probability of outputs of the model $\mathsf{safe}_C$ would assign an exponentially small likelihood to any outputs that are substantially similar to $C$ . Hence a probability distribution that has bounded divergence from the safe model would also be extremely unlikely to output those.

Algorithms

Given the restrictive nature of the definition, one may be concerned that trying to achieve it would result in losing much of the utility of the original generative model. Fortunately, as our work shows, this is not the case. We provide several algorithms that can transform, in a black-box manner, any training pipeline for a generative model into one that produces models that have strong copyright protections under our definition. We now illustrate two of these:

Algorithm $CP-\Delta$ :

Input: A dataset $D = \{ z_1 , \ldots, z_N \}$ , where some of the points $z_i$ contain some copyrighted work. For such a copyrighted point $z_i\in D$ , we also denote it by $C\in D$ .

Learning: First de-deduplicate $D$ (resulting in a dataset with $N'\leq N$ points), and then split it into two disjoint shards, $D_1 = \{ z_1 ,\ldots, z_{N'/2} \}$ and $D_2 = \{ z_{N'/2+1} ,\ldots, z_{N'} \}$ . Then train two models $q_1 , q_2$ on $D_1$ and $D_2$ , respectively.

The Output Generative Model: Return the generative model $p(y|x)$ as follows: On input a prompt $x$ , generate $y$ with probability proportional to $\sqrt{ q_1(y|x) q_2(y|x) }$ .

Note that for any copyrighted work $C\in D$ one of either $q_1$ and $q_2$ would have been trained without access to $C$ . The intuition of the algorithm is as follows: the output model $p$ has the property that it tends to have probability mass only in the region where both $q_1$ and $q_2$ have probability mass; therefore, for any copyrighted work $C\in D$ , if $p$ outputs $y$ with reasonable probability then this should not be a violation since $y$ tends to also be output by a model that was trained without access to the copyrighted work $C$ itself. To formalize this, let us make the following choice for the $\mathsf{safe}$ function: define $\mathsf{safe}_C = q_i$ , for $i$ s.t. $C\notin D_i$ , i.e. $q_i$ is the model trained without access to $C$ . The paper formally shows that as long as the two models $q_1$ and $q_2$ have some non-trivial overlap (specifically their squared Hellinger distance is bounded away from 1), then the model $p$ will satisfy our definition for some $k$ (based on this Hellinger distance). In particular, for every copyrighted work $C\in D$ , the distribution $p(\cdot|x)$ will have bounded KL divergence from the model $\mathsf{safe}_C$ .

The intuition is provided in the following animation

*Video: Curves of two “spiky” distributions $q_1$ and $q_2$* with a range of spike locations. We see how the distributions proportional to $\sqrt{q_1q_2}$ and $\min \{q_1, q_2\}$ significantly “flatten” these spikes.

*Video: Curves of two “spiky” distributions $q_1$ and $q_2$* with a range of spike locations. We see how the distributions proportional to $\sqrt{q_1q_2}$ and $\min \{q_1, q_2\}$ significantly “flatten” these spikes.

Imagine that both $q_1$ and $q_2$ are “faulty” in the sense that they have a significant chance of outputting a “memorized” sample from their training set (or an output substantially similar to it). The “faulty” regions are the “spikes” in their probability distribution, and, since the training sets are disjoint, these two “spikes” will be in different places. Hence when we switch to the probability distribution $p$ it will have the effect of “flattening” the spikes and shifting most weight to the other parts of the probability distribution. Another alternative is for $CP-\Delta$ to output the model $p(y|x) \propto \min \{ q_1(y|x),q_2(y|x) \}$ (this provides a guarantee in terms of the Max-KL divergence, and it replaces the assumption on overlap, defined with respect to the squared Hellinger distance, to be instead defined with respect to the total variation distance).

There a number of modifications to $CP-\Delta$ worth considering for more practical deployments. In some cases, directly computing the aforementioned probability distributions may be challenging. Furthermore, it may be desirable to utilize some arbitrary generative model $p$ (say $p$ was trained on the full dataset $D$ ) where we seek to modify $p$ into a model that has strong protections against copyright violations (and which preserves the quality of $p$ to the extent possible). Finally, it may be desirable to explicitly tune the acceptable value of $k_x$ . Our next algorithm addresses these concerns and makes use of a tunable parameter $k\geq 0$ . It is specified as follows:

Algorithm $CP-k$ : An Access-Free Reduction at Threshold $k$

Input: A model $p$ ; A dataset $D = \{ z_1 , \ldots, z_N \}$ .

Learning: First de-deduplicate $D$ and split it into two disjoint shards, $D_1 = \{ z_1 ,\ldots, z_{N'/2} \}$ and $D_2 = \{ z_{N'/2+1} ,\ldots, z_{N'} \}$ . Then train two models $q_1 , q_2$ on $D_1$ and $D_2$ , respectively.

The Output Generative Model: Return the generative model $p_k(y|x)$ defined as follows: On input a prompt $x$ , first sample $y \sim p(\cdot |x)$ and then accept $y$ if $\log \big( p(y|x) / q_i(y|x) \big) \leq k$ , for $i\in\{1,2\}$ . (Otherwise, resample.)

The intuition of $CP-k$ is as follows: we first sample the output from $p$ and only accept this output if the likelihood ratio to the $\mathsf{safe}$ function (on any $C$ ) satisfies a desired upper bound, the latter of which can be verified by checking the likelihood ratio with respect to both $q_1$ and $q_2$ . Since $p_k$ transforms the output of $p$ (i.e. it throws aways probability mass which could be potential copyright violations), one might be concerned that we will degrade the quality of the original model $p$ . Fortunately, we show when this is not the case. We give formal theoretical results on the effectiveness of the approach based on the information distances between $p$ and $q_1$ and $q_2$ ; in fact, we sometimes even improve on the quality of $p$ with this approach. We also specify the relationship between the desired $k_x$ and tunable parameter $k$ .

An Illustrative Experiment

**Left:** A model $p$ trained on the full modified CIFAR10 dataset; we injected multiple copies of two images (marked with red frames), so they are likely to be memorized by the model. **Middle two images:** Models $q_1, q_2$ trained on two shards of the dataset, split so that each injected image appears in only one of them. **Right:** A model obtained by combining $p, q_1, q_2$ using our algorithm. Despite being a black-box transformation of the three memorizing models, the combined model does not output either of the injected images.

We now present a qualitative experiment demonstrating how applying our algorithm to memorizing models produces a model that no longer memorizes. Specifically, we first augment CIFAR-10 with multiple copies of two images (images close to the augmented images are marked with red boundaries); hypothetically, suppose these two images are copyrighted works. For illustrative purposes, we do not deduplicate our dataset. Note our goal here is not to simply present a heuristic approach, such as deduplication, that “often works in practice,” but it is to show that an algorithm with rigorous guarantees can also be practical.

The leftmost image shows generations from a model $p$ that was trained on the full dataset, where we clearly see that $p$ generates the two copyrighted works. Our algorithm starts by splitting this dataset into two disjoint datasets, where the two copyrighted images are split into two different shards, and it trains two models $q_1,q_2$ on these disjoint shards. The result is two models such that each generates the CIFAR-10 distribution, but also has a significant chance to output the memorized example. Yet when we combine all three of models using the CP-k algorithm, we obtain a model that agrees with them on the shared part of the distribution but is highly unlikely to output either one of the memorized images.

Illustration of the algorithm to obtain a model satisfying the NAF definition by first splitting the data into two disjoint shards, ensuring that duplicated copies of an image are in the same shard. Then we obtain a model by combining the models trained on both shards.

See the paper ( https://arxiv.org/abs/2302.10870 ) for the full details of our definitions, theorems, and experiments. We believe that there is much room for follow-up work, including optimization of performance, as well as much larger-scale experiments.

	Interview about this… on Men in Computer Science
	Interview about this… on The Swiss Army Knife of C…
	Interview about this… on An alarming trend in K-12 Math…
	Interview about this… on The uneasy relationship betwee…
	Interview about this… on The different forms of quantum…

Provable Copyright Protection for Generative Models

The Technical Concept: Near Access-Freeness

An Illustrative Experiment

Published by Boaz Barak

Leave a Reply Cancel reply

The Technical Concept: Near Access-Freeness

An Illustrative Experiment

Share this:

Like this:

Related

Published by Boaz Barak

Leave a Reply Cancel reply