Original: Domain Adaptation meets Individual Fairness. And they get along.
Revised: Domain Adaptation meets Individual Fairness. And they get along.

Original: Abstract
Revised: Abstract

Original: Many instances of algorithmic bias are caused by distributional shifts.
Revised: Many instances of algorithmic bias are caused by distributional shifts.

Original: For example, machine learning (ML) models often perform worse on demographic groups that are underrepresented in the training data.
Revised: For example, machine learning (ML) models often perform worse on demographic groups that are underrepresented in the training data.

Original: In this paper, we leverage this connection between algorithmic fairness and distribution shifts to show that algorithmic fairness interventions can help ML models overcome distribution shifts, and that domain adaptation methods (for overcoming distribution shifts) can mitigate algorithmic biases.
Revised: In this paper, we leverage this connection between algorithmic fairness and distribution shifts to show that algorithmic fairness interventions can help ML models overcome distribution shifts, and that domain adaptation methods (for overcoming distribution shifts) can mitigate algorithmic biases.

Original: In particular, we show that (i) enforcing suitable notions of individual fairness (IF) can improve the out-of-distribution accuracy of ML models under the covariate shift assumption and that (ii) it is possible to adapt representation alignment methods for domain adaptation to enforce individual fairness.
Revised: In particular, we show that (i) enforcing suitable notions of individual fairness (IF) can improve the out-of-distribution accuracy of ML models under the covariate shift assumption and that (ii) it is possible to adapt representation alignment methods for domain adaptation to enforce individual fairness.

Original: The former is unexpected because IF interventions were not developed with distribution shifts in mind.
Revised: The former is unexpected because IF interventions were not developed with distribution shifts in mind.

Original: The latter is also unexpected because representation alignment is not a common approach in the individual fairness literature.
Revised: The latter is also unexpected because representation alignment is not a common approach in the individual fairness literature.

Original:  Introduction
Revised:  Introduction

Original: Although algorithmic bias and distribution shifts are often considered separate problems, there is a recent body of empirical work that shows many instances of algorithmic bias are caused by distribution shifts.
Revised: Although algorithmic bias and distribution shifts are often considered separate problems, there is a recent body of empirical work that shows many instances of algorithmic bias are caused by distribution shifts.

Original: Broadly speaking, there are two ways distribution shifts cause algorithmic biases [1]: (i)
Revised: Broadly speaking, there are two ways distribution shifts cause algorithmic biases [1]: (i)

Original: The model is trained to predict the wrong target; (ii) The model is trained to predict the correct target but its predictions are inaccurate for demographic groups that are underrepresented in the training data.
Revised: The model is trained to predict the wrong target; (ii) The model is trained to predict the correct target but its predictions are inaccurate for demographic groups that are underrepresented in the training data.

Original: From a statistical perspective the first type of algorithmic bias is caused by concept or posterior drift between the training data and the real-world.
Revised: From a statistical perspective the first type of algorithmic bias is caused by concept or posterior drift between the training data and the real-world.

Original: This leads to a mismatch between the model’s predictions and actual data.
Revised: This leads to a mismatch between the model’s predictions and actual data.

Original: This type of algorithmic bias is also known as label choice bias [2].
Revised: This type of algorithmic bias is also known as label choice bias [2].

Original: The second type of algorithmic biases arises when ML models are trained or evaluated with non-diverse data, causing the models to perform poorly on underserved groups.
Revised: The second type of algorithmic biases arises when ML models are trained or evaluated with non-diverse data, causing the models to perform poorly on underserved groups.

Original: This type of algorithmic bias is caused by a covariate shift between the training data and the real-world data.
Revised: This type of algorithmic bias is caused by a covariate shift between the training data and the real-world data.

Original: In this paper, we mostly focus on algorithmic biases caused by covariate shift.
Revised: In this paper, we mostly focus on algorithmic biases caused by covariate shift.

Original: The overlap between the problems of algorithmic bias and distribution shift suggests two questions:
Revised: The overlap between the problems of algorithmic bias and distribution shift suggests two questions:

Original: Is it possible to overcome distribution shifts with algorithmic fairness interventions?
Revised: Is it possible to overcome distribution shifts with algorithmic fairness interventions?

Original: Is it possible to mitigate biases caused by distribution shifts with domain adaptation methods?
Revised: Is it possible to mitigate biases caused by distribution shifts with domain adaptation methods?

Original: For a concrete example, consider building an ML model to predict a person’s occupation from their biography.
Revised: For a concrete example, consider building an ML model to predict a person’s occupation from their biography.

Original: For this task, Yurochkin et al.
Revised: For this task, Yurochkin et al.

Original: [3] showed that ML models trained on top of pre-trained language models without any algorithmic fairness intervention can be unfair: they can change prediction (e.g., from attorney to paralegal or vice versa), when the name and gender pronouns are changed in the input biography.
Revised: [3] showed that ML models trained on top of pre-trained language models without any algorithmic fairness intervention can be unfair: they can change prediction (e.g., from attorney to paralegal or vice versa), when the name and gender pronouns are changed in the input biography.

Original: This is a violation of individual fairness (IF), in part caused by underrepresentation of female attorneys in the train (source) data.
Revised: This is a violation of individual fairness (IF), in part caused by underrepresentation of female attorneys in the train (source) data.

Original: Consequently, this model underperforms on female attorneys, in particular when female attorneys are better represented in the target domain.
Revised: Consequently, this model underperforms on female attorneys, in particular when female attorneys are better represented in the target domain.

Original: This is a type of distribution shift known as subpopulation shift in the domain adaptation literature [4].
Revised: This is a type of distribution shift known as subpopulation shift in the domain adaptation literature [4].

Original: In this case, enforcing IF will not only result in a fairer model, but can also improve performance in the target domain, i.e., solve the domain adaptation problem.
Revised: In this case, enforcing IF will not only result in a fairer model, but can also improve performance in the target domain, i.e., solve the domain adaptation problem.

Original: Now, under the same source and target domains, consider applying a domain adaptation (DA) method that matches the distributions of representations on the domains (see Appendix G for a brief review of DA and algorithmic fairness under distribution shifts).
Revised: Now, under the same source and target domains, consider applying a domain adaptation (DA) method that matches the distributions of representations on the domains (see Appendix G for a brief review of DA and algorithmic fairness under distribution shifts).

Original: Assuming class marginals are the same 1 , i.e., source and target have the same fraction of attorneys, any differences between the source and the target distribution are due to different fractions of male to female attorneys.
Revised: Assuming class marginals are the same 1 , i.e., source and target have the same fraction of attorneys, any differences between the source and the target distribution are due to different fractions of male to female attorneys.

Original: Learning a feature (representation) extractor that is invariant to gender pronouns and names will align the two domains and result in a model that is individually fair.
Revised: Learning a feature (representation) extractor that is invariant to gender pronouns and names will align the two domains and result in a model that is individually fair.

Original: For group fairness, Schumann et al.
Revised: For group fairness, Schumann et al.

Original: [5] and Creager et al.
Revised: [5] and Creager et al.

Original: [6] show that it is possible to leverage DA algorithms to enforce group fairness.
Revised: [6] show that it is possible to leverage DA algorithms to enforce group fairness.

Original: The goal of this paper is to complement these results by precisely characterizing the cases in which enforcing IF achieves domain generalization and vice a versa.
Revised: The goal of this paper is to complement these results by precisely characterizing the cases in which enforcing IF achieves domain generalization and vice a versa.

Original: Our contributions can be summarized as:
Revised: Our contributions can be summarized as:

Original: We show that methods designed for IF can help ML models adapt/generalize to new domains, i.e., improve the accuracy of the trained ML model on out-of-distribution samples.
Revised: We show that methods designed for IF can help ML models adapt/generalize to new domains, i.e., improve the accuracy of the trained ML model on out-of-distribution samples.

Original: Conversely, we show that DA algorithms that align the feature distributions in the source and target domains can be used to improve IF under certain probabilistic conditions on the features.
Revised: Conversely, we show that DA algorithms that align the feature distributions in the source and target domains can be used to improve IF under certain probabilistic conditions on the features.

Original: We verify our theory on the Bios
Revised: We verify our theory on the Bios

Original: [7] and the Toxicity [8] datasets: enforcing IF via the methods of Yurochkin et al.
Revised: [7] and the Toxicity [8] datasets: enforcing IF via the methods of Yurochkin et al.

Original: [3] and Petersen et al.
Revised: [3] and Petersen et al.

Original: [9] improves accuracy on the target domain, and DA methods [10]–[12] trained with appropriate source and target domains improve IF.
Revised: [9] improves accuracy on the target domain, and DA methods [10]–[12] trained with appropriate source and target domains improve IF.

Original:  Overcoming Distribution Shift by Enforcing Individual Fairness
Revised:  Overcoming Distribution Shift by Enforcing Individual Fairness

Original: The goal of individual fairness is to ensure similar treatment of similar individuals.
Revised: The goal of individual fairness is to ensure similar treatment of similar individuals.

Original: Dwork et al.
Revised: Dwork et al.

Original: [13] formalize this notion using L -Lipschitz continuity of an ML model f : X → Y :
Revised: [13] formalize this notion using L -Lipschitz continuity of an ML model f : X → Y :

Original: d Y ( f ( x ) , f ( x ′ )) ≤ Ld X ( x, x ′ ) (2.1) for all x, x ′ ∈ X .
Revised: d Y ( f ( x ) , f ( x ′ )) ≤ Ld X ( x, x ′ ) (2.1) for all x, x ′ ∈ X .

Original: Here, d Y is the metric on the output space quantifying the similarity of treatment of individuals, and d X is the metric on the input space quantifying the similarity of individuals.
Revised: Here, d Y is the metric on the output space quantifying the similarity of treatment of individuals, and d X is the metric on the input space quantifying the similarity of individuals.

Original: Algorithms for enforcing IF are similar to algorithms for domain adaptation/generalization.
Revised: Algorithms for enforcing IF are similar to algorithms for domain adaptation/generalization.

Original: For example, adversarial training/distributionally robust optimization can not only enforce IF
Revised: For example, adversarial training/distributionally robust optimization can not only enforce IF

Original: [3], [14], but can also be used for training ML models that are robust to distribution shifts [11], [15].
Revised: [3], [14], but can also be used for training ML models that are robust to distribution shifts [11], [15].

Original: This similarity is more than a mere coincidence: the goal in both enforcing IF and domain adaptation/generalization is ignoring uninformative dissimilarity .
Revised: This similarity is more than a mere coincidence: the goal in both enforcing IF and domain adaptation/generalization is ignoring uninformative dissimilarity .

Original: In IF, we wish to ignore variation among inputs that are attributed to variation of the sensitive attribute.
Revised: In IF, we wish to ignore variation among inputs that are attributed to variation of the sensitive attribute.

Original: In domain adaptation/generalization, we wish to ignore variation among inputs that are attributed to the idiosyncracies of the domains.
Revised: In domain adaptation/generalization, we wish to ignore variation among inputs that are attributed to the idiosyncracies of the domains.

Original: Mathematically, ignoring uninformative dissimilarity is enforcing invariance/smoothness of the ML model among inputs that are dissimilar in uninformative ways.
Revised: Mathematically, ignoring uninformative dissimilarity is enforcing invariance/smoothness of the ML model among inputs that are dissimilar in uninformative ways.

Original: For example, (2.1) requires the model to be approximately constant on small d X -balls.
Revised: For example, (2.1) requires the model to be approximately constant on small d X -balls.

Original: In this section, we exploit this connection between IF and domain adaptation/generalization to show that enforcing IF can improve accuracy in target domain under covariate shift if the regression function is individually fair .
Revised: In this section, we exploit this connection between IF and domain adaptation/generalization to show that enforcing IF can improve accuracy in target domain under covariate shift if the regression function is individually fair .

Original: In order words, if the inductive bias from enforcing IF is correct, then enforcing
Revised: In order words, if the inductive bias from enforcing IF is correct, then enforcing

Original: IF improves accuracy in the target domain.
Revised: IF improves accuracy in the target domain.

Original: More concretely, we consider the task of adapting an
Revised: More concretely, we consider the task of adapting an

Original: ML model from a source domain to a target domain.
Revised: ML model from a source domain to a target domain.

Original: We have n s labeled samples from the source domain { ( x s,i , y s,i ) } n s i =1 and n t unlabeled samples from the target domain { x t,i } n t
Revised: We have n s labeled samples from the source domain { ( x s,i , y s,i ) } n s i =1 and n t unlabeled samples from the target domain { x t,i } n t

Original: i
Revised: i

Original: =1 .
Revised: =1 .

Original: Our goal is to obtain a model (cid:98) f ∈ F that has comparable accuracy on the source and target domains.
Revised: Our goal is to obtain a model (cid:98) f ∈ F that has comparable accuracy on the source and target domains.

Original: We assume the regression function f 0 ( x ) ≜ E (cid:2)
Revised: We assume the regression function f 0 ( x ) ≜ E (cid:2)

Original: y i | x i = x
Revised: y i | x i = x

Original: [Equation]
Revised: [Equation]

Original: in the source and target domains are identical.
Revised: in the source and target domains are identical.

Original: [Equation]
Revised: [Equation]

Original: where ϵ i ’s are exogenous error terms with mean zero and variance σ 2 e .
Revised: where ϵ i ’s are exogenous error terms with mean zero and variance σ 2 e .

Original: This is a special case of distribution shift called covariate shift [16].
Revised: This is a special case of distribution shift called covariate shift [16].

Original: The covariate shift problem is most challenging when the model class is mis-specified (i.e., f 0 / ∈ F ) and this is the primary focus of this paper.
Revised: The covariate shift problem is most challenging when the model class is mis-specified (i.e., f 0 / ∈ F ) and this is the primary focus of this paper.

Original: As an example, consider the Inclusive Images Challenge [17].
Revised: As an example, consider the Inclusive Images Challenge [17].

Original: Publicly available image datasets often lack geo-diversity.
Revised: Publicly available image datasets often lack geo-diversity.

Original: Thus, ML models trained on such datasets tend to make mistakes on images from underrepresented countries.
Revised: Thus, ML models trained on such datasets tend to make mistakes on images from underrepresented countries.

Original: As a concrete example, while brides in western countries typically wear white dresses at wedding ceremonies, brides in non-western countries may not.
Revised: As a concrete example, while brides in western countries typically wear white dresses at wedding ceremonies, brides in non-western countries may not.

Original: An ML model trained on images from mostly western countries may not recognize brides from other parts of the world that are not wearing white dresses.
Revised: An ML model trained on images from mostly western countries may not recognize brides from other parts of the world that are not wearing white dresses.

Original: Although there is a function (on images) that recognizes brides from non-western countries (e.g., the function humans implicitly use to recognize brides), the ML model does not learn this function because either the function is not in the model class and/or the inductive bias of the learning algorithm leads the algorithm to pick a different function (i.e., inductive bias of learning algorithm is mis-specified).
Revised: Although there is a function (on images) that recognizes brides from non-western countries (e.g., the function humans implicitly use to recognize brides), the ML model does not learn this function because either the function is not in the model class and/or the inductive bias of the learning algorithm leads the algorithm to pick a different function (i.e., inductive bias of learning algorithm is mis-specified).

Original: To warm up, we consider the transductive (learning) setting before moving on to the inductive setting.
Revised: To warm up, we consider the transductive (learning) setting before moving on to the inductive setting.

Original: Recall that, in the transductive setting, the learner is given a set of labeled samples and another set of unlabeled samples.
Revised: Recall that, in the transductive setting, the learner is given a set of labeled samples and another set of unlabeled samples.

Original: The goal is correctly predicting the labels of the given unlabeled samples; the learner is unconcerned with the accuracy of the model on new test samples.
Revised: The goal is correctly predicting the labels of the given unlabeled samples; the learner is unconcerned with the accuracy of the model on new test samples.

Original: This is different from the inductive setting, where the goal is correctly predicting the labels of new test samples.
Revised: This is different from the inductive setting, where the goal is correctly predicting the labels of new test samples.

Original: The features of the unlabeled samples (but not their labels) are used for training in both settings.
Revised: The features of the unlabeled samples (but not their labels) are used for training in both settings.

Original: We provide theoretical results for both settings.
Revised: We provide theoretical results for both settings.

Original: 2.1 Warm Up: The Transductive Setting
Revised: 2.1 Warm Up: The Transductive Setting

Original: In the transductive setting, we are only concerned with the accuracy of the predictions on the unlabeled samples from the target domain in the training data.
Revised: In the transductive setting, we are only concerned with the accuracy of the predictions on the unlabeled samples from the target domain in the training data.

Original: The distribution of unlabeled samples is different from the (marginal) distribution of features in the source domain due to covariate shift.
Revised: The distribution of unlabeled samples is different from the (marginal) distribution of features in the source domain due to covariate shift.

Original: Thus, the problem is similar to that of extrapolation/label propagation in which we wish to propagate the labels/signal from the labeled samples in the source domain to the unlabeled samples in the target domain.
Revised: Thus, the problem is similar to that of extrapolation/label propagation in which we wish to propagate the labels/signal from the labeled samples in the source domain to the unlabeled samples in the target domain.

Original: Towards this goal, we leverage the (labeled) source and (unlabeled) target samples and the inductive bias on the smoothness of the regression function.
Revised: Towards this goal, we leverage the (labeled) source and (unlabeled) target samples and the inductive bias on the smoothness of the regression function.

Original: We encode this inductive bias in a regularizer R and solve the following regularized risk minimization problem
Revised: We encode this inductive bias in a regularizer R and solve the following regularized risk minimization problem

Original: [Equation]
Revised: [Equation]

Original: where F is the model class, L is a loss function, and λ > 0 is a regularization parameter.
Revised: where F is the model class, L is a loss function, and λ > 0 is a regularization parameter.

Original: In the transductive setting, the regularizer R n is a function of the vector of model outputs on the source and target inputs: f ( X ) ≜ (cid:2) f
Revised: In the transductive setting, the regularizer R n is a function of the vector of model outputs on the source and target inputs: f ( X ) ≜ (cid:2) f

Original: ( X s ) ⊤ , f ( X t ) ⊤ (cid:3) ⊤ , where f ( X s ) ∈ R n s (resp.
Revised: ( X s ) ⊤ , f ( X t ) ⊤ (cid:3) ⊤ , where f ( X s ) ∈ R n s (resp.

Original: f
Revised: f

Original: ( X t ) ∈ R n t ) is the vector of outputs on the source (resp. target) inputs.
Revised: ( X t ) ∈ R n t ) is the vector of outputs on the source (resp. target) inputs.

Original: Intuitively, the regularizer enforces invariance/smoothness of the model outputs on the source and target inputs.
Revised: Intuitively, the regularizer enforces invariance/smoothness of the model outputs on the source and target inputs.

Original: A concrete example of a such a regularizer is the graph Laplacian regularizer .
Revised: A concrete example of a such a regularizer is the graph Laplacian regularizer .

Original: A graph Laplacian regularizer is based on a similarity symmetric kernel K on the input space X .
Revised: A graph Laplacian regularizer is based on a similarity symmetric kernel K on the input space X .

Original: For example, Petersen et al.
Revised: For example, Petersen et al.

Original: [9] take kernel K to be a decreasing function of a fair metric that is learned from data [18], e.g., a metric in which the distance between male and female biographies with similar relevant content is small.
Revised: [9] take kernel K to be a decreasing function of a fair metric that is learned from data [18], e.g., a metric in which the distance between male and female biographies with similar relevant content is small.

Original: In domain adaptation, a similar intuition can be applied.
Revised: In domain adaptation, a similar intuition can be applied.

Original: For example, suppose the source train data consists of Poodle dogs and Persian cats (the task is to distinguish cats and dogs), and the target data consists of Dalmatians and Siamese cats [19].
Revised: For example, suppose the source train data consists of Poodle dogs and Persian cats (the task is to distinguish cats and dogs), and the target data consists of Dalmatians and Siamese cats [19].

Original: Then, a meaningful metric for constructing kernel
Revised: Then, a meaningful metric for constructing kernel

Original: K assigns small distances to different breeds of the same species.
Revised: K assigns small distances to different breeds of the same species.

Original: Given the kernel, we construct the similarity matrix K =
Revised: Given the kernel, we construct the similarity matrix K =

Original: [ K ( X i , X j )] n i,j =1 .
Revised: [ K ( X i , X j )] n i,j =1 .

Original: Note that, here, we are considering all the source and target covariates together.
Revised: Note that, here, we are considering all the source and target covariates together.

Original: Based on the similarity matrix, the (unnormalized) Laplacian matrix is defined as L = D − K where D is a diagonal matrix with
Revised: Based on the similarity matrix, the (unnormalized) Laplacian matrix is defined as L = D − K where D is a diagonal matrix with

Original: D i,i = (cid:80) j K ( X i , X j ) , which is often denoted as the degree of the i th observation.
Revised: D i,i = (cid:80) j K ( X i , X j ) , which is often denoted as the degree of the i th observation.

Original: There are also other ways of defining L (e.g., L = D − 1 / 2 KD − 1 / 2 or L =
Revised: There are also other ways of defining L (e.g., L = D − 1 / 2 KD − 1 / 2 or L =

Original: I − D − 1 K ) which would also lead to the similar conclusion, but we stick to unnormalized Laplacian for the ease of exposition.
Revised: I − D − 1 K ) which would also lead to the similar conclusion, but we stick to unnormalized Laplacian for the ease of exposition.

Original: Based on the Laplacian matrix L , we define the graph Laplacian regularizer R as:
Revised: Based on the Laplacian matrix L , we define the graph Laplacian regularizer R as:

Original: [Equation]
Revised: [Equation]

Original: The above regularizer enforces that if K ( X i , X j ) is large for a pair ( X i , X j ) (i.e., they are similar), f ( X i ) must be close to f ( X j ) .
Revised: The above regularizer enforces that if K ( X i , X j ) is large for a pair ( X i , X j ) (i.e., they are similar), f ( X i ) must be close to f ( X j ) .

Original: As mentioned earlier, for individual fairness, K ( X i , X j ) is chosen to be a monotonically decreasing function of d fair ( X i , X j ) , which ensures that f ( X i ) and f ( X j ) are close to each other when X i is close to X j with respect to the fair metric (for more details, see
Revised: As mentioned earlier, for individual fairness, K ( X i , X j ) is chosen to be a monotonically decreasing function of d fair ( X i , X j ) , which ensures that f ( X i ) and f ( X j ) are close to each other when X i is close to X j with respect to the fair metric (for more details, see

Original: Petersen et al.
Revised: Petersen et al.

Original: Recently, Lahoti et al.
Revised: Recently, Lahoti et al.

Original: [20], Kang et al.
Revised: [20], Kang et al.

Original: [21], and Petersen et al.
Revised: [21], and Petersen et al.

Original: [9] used the graph Laplacian regularizer to post-process ML models so that they are individually fair.
Revised: [9] used the graph Laplacian regularizer to post-process ML models so that they are individually fair.

Original: This is also widely used in semi-supervised learning to leverage unlabeled samples [22].
Revised: This is also widely used in semi-supervised learning to leverage unlabeled samples [22].

Original: We focus on problems in which the model class F is mis-specified, i.e., f 0 / ∈ F .
Revised: We focus on problems in which the model class F is mis-specified, i.e., f 0 / ∈ F .

Original: If the model is well-specified (i.e., f 0 ∈ F )
Revised: If the model is well-specified (i.e., f 0 ∈ F )

Original: , the optimal prediction rule in the training and target domains are identical (both are f 0 ).
Revised: , the optimal prediction rule in the training and target domains are identical (both are f 0 ).

Original: It is possible to learn the optimal prediction rule for the target domain from the training domain (e.g., by empirical risk minimization (ERM)), and there is no need to adapt models trained in the source domain to the target.
Revised: It is possible to learn the optimal prediction rule for the target domain from the training domain (e.g., by empirical risk minimization (ERM)), and there is no need to adapt models trained in the source domain to the target.

Original: On the other hand, if the model is mis-specified, the transfer learning task is non-trivial because the optimal prediction rule model depends on the distribution of the inputs (which differ in training and target domains).
Revised: On the other hand, if the model is mis-specified, the transfer learning task is non-trivial because the optimal prediction rule model depends on the distribution of the inputs (which differ in training and target domains).

Original: Here, we focus on the non-trivial case.
Revised: Here, we focus on the non-trivial case.

Original: We show that, as long as f 0 satisfies the smoothness structure enforced by the regularizer, (cid:98) f from (2.3) remains accurate at the target inputs { x t,i } n t i =1 .
Revised: We show that, as long as f 0 satisfies the smoothness structure enforced by the regularizer, (cid:98) f from (2.3) remains accurate at the target inputs { x t,i } n t i =1 .

Original: First, we state our assumptions on the loss function L and the regularizer R n .
Revised: First, we state our assumptions on the loss function L and the regularizer R n .

Original: Assumption 2.1.
Revised: Assumption 2.1.

Original: We assume that the regression function is smooth with respect to the penalty R n , i.e., R n ( f 0 ( X ))
Revised: We assume that the regression function is smooth with respect to the penalty R n , i.e., R n ( f 0 ( X ))

Original: ≤ δ for some small δ > 0 .
Revised: ≤ δ for some small δ > 0 .

Original: This is an assumption on the effect of the smoothness structure enforced by the regularizer being in agreement with the regression function f 0 .
Revised: This is an assumption on the effect of the smoothness structure enforced by the regularizer being in agreement with the regression function f 0 .

Original: Assumption 2.2.
Revised: Assumption 2.2.

Original: We assume that R is µ R n n t -strongly convex with respect to the model outputs on the target inputs and L R n n -strongly smooth.
Revised: We assume that R is µ R n n t -strongly convex with respect to the model outputs on the target inputs and L R n n -strongly smooth.

Original: More specifically, for v 1 ∈ R n s , v 2 , v ∈ R n t , ˜ v, v 0 ∈ R n
Revised: More specifically, for v 1 ∈ R n s , v 2 , v ∈ R n t , ˜ v, v 0 ∈ R n

Original: [Equation]
Revised: [Equation]

Original: This is a regularity assumption on the regularizer to ensure the extrapolation map y t : R n s → R n t
Revised: This is a regularity assumption on the regularizer to ensure the extrapolation map y t : R n s → R n t

Original: [Equation]
Revised: [Equation]

Original: is well-behaved.
Revised: is well-behaved.

Original: Intuitively, the extrapolation map extrapolates (hence its name) model outputs on the source domain to the target domain in the smoothest possible way .
Revised: Intuitively, the extrapolation map extrapolates (hence its name) model outputs on the source domain to the target domain in the smoothest possible way .

Original: Next, we state our assumptions on the loss function:
Revised: Next, we state our assumptions on the loss function:

Original: Assumption 2.3.
Revised: Assumption 2.3.

Original: The loss function L : R × R → R + satisfies L ( a, b ) ≥ 0 and = 0 if and only if a = b .
Revised: The loss function L : R × R → R + satisfies L ( a, b ) ≥ 0 and = 0 if and only if a = b .

Original: Furthermore, it is µ L - strongly convex and L L - strongly smooth, i.e.,
Revised: Furthermore, it is µ L - strongly convex and L L - strongly smooth, i.e.,

Original: [Equation]
Revised: [Equation]

Original: [Equation]
Revised: [Equation]

Original: Assumption 2.3 is standard in learning theory, which provides us control over the curvature of the loss function.
Revised: Assumption 2.3 is standard in learning theory, which provides us control over the curvature of the loss function.

Original: Theorem 2.4.
Revised: Theorem 2.4.

Original: Suppose ˆ f is the estimated function obtained from (2.3) .
Revised: Suppose ˆ f is the estimated function obtained from (2.3) .

Original: Under Assumption 2.3 on the loss function and Assumptions 2.1 and 2.2 on the regularizer, we have the following bound on the risk in the target domain:
Revised: Under Assumption 2.3 on the loss function and Assumptions 2.1 and 2.2 on the regularizer, we have the following bound on the risk in the target domain:

Original: [Equation]
Revised: [Equation]

Original: where
Revised: where

Original: [Equation]
Revised: [Equation]

Original: with ρ n = n s /n t .
Revised: with ρ n = n s /n t .

Original: We note that the right side of (2.5) does not depend on the y i,s ’s in the target domain.
Revised: We note that the right side of (2.5) does not depend on the y i,s ’s in the target domain.

Original: Intuitively,
Revised: Intuitively,

Original: Theorem 2.4 guarantees the accuracy of (cid:98) f on the inputs from the target domain as long as the following conditions hold.
Revised: Theorem 2.4 guarantees the accuracy of (cid:98) f on the inputs from the target domain as long as the following conditions hold.

Original: The model class F is rich enough to include an f that is not only accurate on the training domain, but also satisfies the smoothness/invariance conditions enforced by the regularizer.
Revised: The model class F is rich enough to include an f that is not only accurate on the training domain, but also satisfies the smoothness/invariance conditions enforced by the regularizer.

Original: This implies the first term on the right side of (2.5) is small.
Revised: This implies the first term on the right side of (2.5) is small.

Original: The exact relation between inputs and outputs encoded in f 0 satisfies the smoothness structure enforced by the regularizer.
Revised: The exact relation between inputs and outputs encoded in f 0 satisfies the smoothness structure enforced by the regularizer.

Original: This implies the second term on the right side of (2.5) is small.
Revised: This implies the second term on the right side of (2.5) is small.

Original: If the model is correctly specified ( f 0 ∈ F ) and the regression function perfectly satisfies the smoothness conditions enforced by the regularizer ( R n ( f 0 ) = 0 ), then the bias term vanishes.
Revised: If the model is correctly specified ( f 0 ∈ F ) and the regression function perfectly satisfies the smoothness conditions enforced by the regularizer ( R n ( f 0 ) = 0 ), then the bias term vanishes.

Original: In other words, Theorem 2.4 is adaptive to correctly specified model classes.
Revised: In other words, Theorem 2.4 is adaptive to correctly specified model classes.

Original: Example: Laplacian regularizer We now show that the graph Laplacian regularizer satisfies
Revised: Example: Laplacian regularizer We now show that the graph Laplacian regularizer satisfies

Original: Assumption 2.2.
Revised: Assumption 2.2.

Original: As R n ( f ( X )) is a quadratic function of L , it is immediate that n ∇ 2 R n ( f ( X ))
Revised: As R n ( f ( X )) is a quadratic function of L , it is immediate that n ∇ 2 R n ( f ( X ))

Original: =
Revised: =

Original: L .
Revised: L .

Original: Therefore, the strong convexity and smoothness of R depend on the behavior of the maximum and minimum eigenvalues of L .
Revised: Therefore, the strong convexity and smoothness of R depend on the behavior of the maximum and minimum eigenvalues of L .

Original: The maximum eigenvalue of L is bounded above for the fixed design, which plays the role of L L / 2 in Assumption 2.2.
Revised: The maximum eigenvalue of L is bounded above for the fixed design, which plays the role of L L / 2 in Assumption 2.2.

Original: For the lower bound, we note that we only assume strong convexity with respect to the target samples fixing the source samples.
Revised: For the lower bound, we note that we only assume strong convexity with respect to the target samples fixing the source samples.

Original: If we divide the whole
Revised: If we divide the whole

Original: Laplacian matrix into four blocks, then the value of the regularizer in terms of these blocks will be:
Revised: Laplacian matrix into four blocks, then the value of the regularizer in terms of these blocks will be:

Original: [Equation]
Revised: [Equation]

Original: Therefore, the Hessian of R n with respect to the model outputs in the target domain is L TT whose minimum eigenvalue is bounded away from 0 as long as the graph is connected, i.e., source inputs have a degree of similarity with target inputs.
Revised: Therefore, the Hessian of R n with respect to the model outputs in the target domain is L TT whose minimum eigenvalue is bounded away from 0 as long as the graph is connected, i.e., source inputs have a degree of similarity with target inputs.

Original: Thus, R n satisfies Assumption 2.2.
Revised: Thus, R n satisfies Assumption 2.2.

Original: Graph Laplacian regularizer is often used to achieve individual fairness [9], [20], [21] and our Theorem 2.4 shows that it can also be used for domain adaptation.
Revised: Graph Laplacian regularizer is often used to achieve individual fairness [9], [20], [21] and our Theorem 2.4 shows that it can also be used for domain adaptation.

Original: We further verify this empirically in Section 2.4.
Revised: We further verify this empirically in Section 2.4.

Original: Proof Sketch of Theorem 2.4.
Revised: Proof Sketch of Theorem 2.4.

Original: To keep things simple, we focus on the case in which the loss function is quadratic ( L ( x, y )
Revised: To keep things simple, we focus on the case in which the loss function is quadratic ( L ( x, y )

Original: =
Revised: =

Original: 12 ( x − y ) 2 ).
Revised: 12 ( x − y ) 2 ).

Original: We have
Revised: We have

Original: [Equation]
Revised: [Equation]

Original: The first term depends on the smoothness of the model outputs across the source and target domain (cid:98) f
Revised: The first term depends on the smoothness of the model outputs across the source and target domain (cid:98) f

Original: ( X ) : it measures the discrepancy between the model outputs in the target domain f ( X t ) and the smoothest extrapolation of the model outputs in the source domain to the target domain y ∗ t ( f ( X s )) .
Revised: ( X ) : it measures the discrepancy between the model outputs in the target domain f ( X t ) and the smoothest extrapolation of the model outputs in the source domain to the target domain y ∗ t ( f ( X s )) .

Original: Similarly, the third term depends on the smoothness of the regression function (across the source and target domains).
Revised: Similarly, the third term depends on the smoothness of the regression function (across the source and target domains).

Original: In Appendix B.1, we bound the two terms with R ( (cid:98) f
Revised: In Appendix B.1, we bound the two terms with R ( (cid:98) f

Original: ( X )) and R ( f 0 ( X )) .
Revised: ( X )) and R ( f 0 ( X )) .

Original: It remains to bound the second term in (2.7).
Revised: It remains to bound the second term in (2.7).

Original: Intuitively, stability of the extrapolation map (2.4) implies the extrapolation operation is similar to a projection onto smooth functions, so the second term satisfies
Revised: Intuitively, stability of the extrapolation map (2.4) implies the extrapolation operation is similar to a projection onto smooth functions, so the second term satisfies

Original: [Equation]
Revised: [Equation]

Original: See Appendix B.1.
Revised: See Appendix B.1.

Original: 2.2 The Inductive Setting
Revised: 2.2 The Inductive Setting

Original: We now consider the inductive setting.
Revised: We now consider the inductive setting.

Original: Previously, in Section 2.1, we focused on the accuracy of the fitted model (cid:98) f on the inputs from the test domain { x t,i } n t i =1 .
Revised: Previously, in Section 2.1, we focused on the accuracy of the fitted model (cid:98) f on the inputs from the test domain { x t,i } n t i =1 .

Original: Here we instead consider the expected loss of (cid:98) f at a new (previously unseen) input point in the target domain.
Revised: Here we instead consider the expected loss of (cid:98) f at a new (previously unseen) input point in the target domain.

Original: We consider a problem setup similar to that in Section 2.1: the n s labeled samples from the source domain are independently drawn from the source distribution P , while the n t unlabeled samples from the target domain are independently drawn from (the marginal of) the target distribution Q .
Revised: We consider a problem setup similar to that in Section 2.1: the n s labeled samples from the source domain are independently drawn from the source distribution P , while the n t unlabeled samples from the target domain are independently drawn from (the marginal of) the target distribution Q .

Original: We also assume the covariate shift condition (2.2).
Revised: We also assume the covariate shift condition (2.2).

Original: The method remains the same as before: we learn (cid:98) f from (2.3).
Revised: The method remains the same as before: we learn (cid:98) f from (2.3).

Original: The main difference between the inductive and transductive settings is in the population version of the regularizer:
Revised: The main difference between the inductive and transductive settings is in the population version of the regularizer:

Original: In the transductive setting, we are only concerned with the output of the ML model for the inputs in the source and target domains; thereby, the population version of the regularizer remains a function of (the vector of) model outputs on the inputs in the source and target domains.
Revised: In the transductive setting, we are only concerned with the output of the ML model for the inputs in the source and target domains; thereby, the population version of the regularizer remains a function of (the vector of) model outputs on the inputs in the source and target domains.

Original: In the inductive setting, we are also concerned with the output of the ML model on previously unseen points; thus, we consider the regularizer as a functional (i.e., a higher order function):
Revised: In the inductive setting, we are also concerned with the output of the ML model on previously unseen points; thus, we consider the regularizer as a functional (i.e., a higher order function):

Original: R : F × F → R (the two arguments corresponds to f ( X s ) and f ( X t ) in the transductive case).
Revised: R : F × F → R (the two arguments corresponds to f ( X s ) and f ( X t ) in the transductive case).

Original: For example, the population version of the graph Laplacian regularizer (in the inductive setting) is
Revised: For example, the population version of the graph Laplacian regularizer (in the inductive setting) is

Original: [Equation]
Revised: [Equation]

Original: where X s ∼ P X and X t ∼ Q X .
Revised: where X s ∼ P X and X t ∼ Q X .

Original: The population version of (2.3) in the inductive setting is
Revised: The population version of (2.3) in the inductive setting is

Original: [Equation]
Revised: [Equation]

Original: Now we state the assumptions to extend Theorem 2.4 to the inductive setting.
Revised: Now we state the assumptions to extend Theorem 2.4 to the inductive setting.

Original: Assumption 2.5.
Revised: Assumption 2.5.

Original: The function f 0 satisfies R ( f 0 , f 0 )
Revised: The function f 0 satisfies R ( f 0 , f 0 )

Original: ≤ δ for some small δ > 0 .
Revised: ≤ δ for some small δ > 0 .

Original: Assumption 2.6.
Revised: Assumption 2.6.

Original: The (population) regularizer R satisfies the following strong convexity condition:
Revised: The (population) regularizer R satisfies the following strong convexity condition:

Original: [Equation]
Revised: [Equation]

Original: and the following Lipschitz condition on the partial derivative of R with respect to the second coordinate, i.e., for any two f 1 , f 2 :
Revised: and the following Lipschitz condition on the partial derivative of R with respect to the second coordinate, i.e., for any two f 1 , f 2 :

Original: [Equation]
Revised: [Equation]

Original: for some constants µ R , L R > 0 .
Revised: for some constants µ R , L R > 0 .

Original: Here, ∂ 2 R (( f, g ); h ) indicates the Gateaux derivative of R with respect to the second coordinate along the direction h .
Revised: Here, ∂ 2 R (( f, g ); h ) indicates the Gateaux derivative of R with respect to the second coordinate along the direction h .

Original: Assumptions 2.5 and 2.6 are analogues of Assumptions 2.1 and 2.2 in the inductive setting.
Revised: Assumptions 2.5 and 2.6 are analogues of Assumptions 2.1 and 2.2 in the inductive setting.

Original: In fact, it is possible to show that Assumptions 2.5 and 2.6 imply Assumptions 2.1 and 2.2 with high probability by appealing to (uniform) laws of large numbers (see Appendix D).
Revised: In fact, it is possible to show that Assumptions 2.5 and 2.6 imply Assumptions 2.1 and 2.2 with high probability by appealing to (uniform) laws of large numbers (see Appendix D).

Original: The following theorem provides a bound on the population estimation error of ˜ f
Revised: The following theorem provides a bound on the population estimation error of ˜ f

Original: on the target domain:
Revised: on the target domain:

Original: Theorem 2.7.
Revised: Theorem 2.7.

Original: Under Assumptions 2.3, 2.5, and 2.6, we have:
Revised: Under Assumptions 2.3, 2.5, and 2.6, we have:

Original: [Equation]
Revised: [Equation]

Original: for some constants C 1 , C 2 defined in the proof.
Revised: for some constants C 1 , C 2 defined in the proof.

Original: The bound obtained in Theorem 2.7 is comparable to (2.5): the right side does not depend on the distribution Y Q | X Q .
Revised: The bound obtained in Theorem 2.7 is comparable to (2.5): the right side does not depend on the distribution Y Q | X Q .

Original: The second term denotes the aptness of regularizer R , i.e., how well it captures the smoothness of f 0 over the domains.
Revised: The second term denotes the aptness of regularizer R , i.e., how well it captures the smoothness of f 0 over the domains.

Original: Similar to (2.5), we note that the bound in Theorem 2.7 is adaptive to correctly specified model classes.
Revised: Similar to (2.5), we note that the bound in Theorem 2.7 is adaptive to correctly specified model classes.

Original: To wrap up, we compare our theoretical results to other theoretical results on domain adaptation.
Revised: To wrap up, we compare our theoretical results to other theoretical results on domain adaptation.

Original: There is a long line of work started by Ben-David et al.
Revised: There is a long line of work started by Ben-David et al.

Original: [23] on out-of-distribution accuracy of ML models [10], [24]–[27].
Revised: [23] on out-of-distribution accuracy of ML models [10], [24]–[27].

Original: Such bounds are usually of the form
Revised: Such bounds are usually of the form

Original: [Equation]
Revised: [Equation]

Original: for any f ∈ F , where disc ( P, Q ) is a measure of discrepancy between the source and target domains.
Revised: for any f ∈ F , where disc ( P, Q ) is a measure of discrepancy between the source and target domains.

Original: For example, Zhang et al.
Revised: For example, Zhang et al.

Original: [26] show (2.9) with
Revised: [26] show (2.9) with

Original: [Equation]
Revised: [Equation]

Original: A key feature of these bounds is that it is possible to evaluate the right side of the bounds with unlabeled samples from the target domain (and labeled samples from the source domain).
Revised: A key feature of these bounds is that it is possible to evaluate the right side of the bounds with unlabeled samples from the target domain (and labeled samples from the source domain).

Original: Compared to our bounds, there are two main differences:
Revised: Compared to our bounds, there are two main differences:

Original: Equation 2.9 applies to any f ∈ F (while our bound only applies to a specific (cid:101)
Revised: Equation 2.9 applies to any f ∈ F (while our bound only applies to a specific (cid:101)

Original: f from (2.8)).
Revised: f from (2.8)).

Original: Although this uniform applicability is practically desirable (because it allows practitioners to evaluate the bound a posteriori to estimate the out-of-distribution accuracy of the trained model), it precludes the bounds from adapting to correct specification of the model class.
Revised: Although this uniform applicability is practically desirable (because it allows practitioners to evaluate the bound a posteriori to estimate the out-of-distribution accuracy of the trained model), it precludes the bounds from adapting to correct specification of the model class.

Original: The uniform applicability of the bound (to any f ∈ F ) also precludes (2.9) from capturing the effects of the regularizer.
Revised: The uniform applicability of the bound (to any f ∈ F ) also precludes (2.9) from capturing the effects of the regularizer.

Original: Remark 2.8.
Revised: Remark 2.8.

Original: Although our theoretical analysis in the main paper is under the assumption of covariate shift, our results can certainly be extended to the case when the conditional mean function E [ Y | X ] is different on different domains.
Revised: Although our theoretical analysis in the main paper is under the assumption of covariate shift, our results can certainly be extended to the case when the conditional mean function E [ Y | X ] is different on different domains.

Original: We present an extension of Theorem 2.7 to this effect in Appendix E.
Revised: We present an extension of Theorem 2.7 to this effect in Appendix E.

Original: Other theorems (e.g., Theorem 2.4) can also be extended using analogous arguments.
Revised: Other theorems (e.g., Theorem 2.4) can also be extended using analogous arguments.

Original: 2.3 Extension to Domain Generalization
Revised: 2.3 Extension to Domain Generalization

Original: In this subsection, we further extend our results to the domain generalization setup, i.e., when we have no observations from the target domain.
Revised: In this subsection, we further extend our results to the domain generalization setup, i.e., when we have no observations from the target domain.

Original: In the previous domain adaptation setup, when we had access to unlabeled data from the target domain, we used a suitable regularizer to extrapolate the prediction performance from the source domain to the target domain.
Revised: In the previous domain adaptation setup, when we had access to unlabeled data from the target domain, we used a suitable regularizer to extrapolate the prediction performance from the source domain to the target domain.

Original: However, when we do not have unlabeled data from the target domain, we need to alter the regularizer appropriately, so that we have some uniform guarantee over all domains in the vicinity of the source domain.
Revised: However, when we do not have unlabeled data from the target domain, we need to alter the regularizer appropriately, so that we have some uniform guarantee over all domains in the vicinity of the source domain.

Original: Here is an example of a regularizer that seeks to improve domain generalization:
Revised: Here is an example of a regularizer that seeks to improve domain generalization:

Original: [Equation]
Revised: [Equation]

Original: T here can be thought as an adversarial map that maps X to an adversarial example X ′ =
Revised: T here can be thought as an adversarial map that maps X to an adversarial example X ′ =

Original: T ( X ) that maximizes the difference f ( X ) − g ( X ′ ) .
Revised: T ( X ) that maximizes the difference f ( X ) − g ( X ′ ) .

Original: As we need some uniform guarantees across all domains in the vicinity of the source domain, T produces the adversarial test domain example.
Revised: As we need some uniform guarantees across all domains in the vicinity of the source domain, T produces the adversarial test domain example.

Original: This regularizer is similar to the SenSeI regularizer originally proposed and studied by Yurochkin et al.
Revised: This regularizer is similar to the SenSeI regularizer originally proposed and studied by Yurochkin et al.

Original: [3] for enforcing individual fairness.
Revised: [3] for enforcing individual fairness.

Original: In fact, R ( f, f ) is exactly the (Mongé form) of the SenSeI regularizer.
Revised: In fact, R ( f, f ) is exactly the (Mongé form) of the SenSeI regularizer.

Original: Note that we can further generalize this regularizer by incorporating a general loss function L in the first equation or a general metric d in the second equation.
Revised: Note that we can further generalize this regularizer by incorporating a general loss function L in the first equation or a general metric d in the second equation.

Original: However, as this does not add anything to the underlying intuition, we confine ourselves to the ℓ 2 metric here.
Revised: However, as this does not add anything to the underlying intuition, we confine ourselves to the ℓ 2 metric here.

Original: Next, we present our theoretical findings with respect to this regularizer.
Revised: Next, we present our theoretical findings with respect to this regularizer.

Original: To this end, we define the set of transformations T ϵ
Revised: To this end, we define the set of transformations T ϵ

Original: = { T : E x ∼ P [ ∥ x − T ( x ) ∥ ] ≤ ϵ } and the corresponding set of measures
Revised: = { T : E x ∼ P [ ∥ x − T ( x ) ∥ ] ≤ ϵ } and the corresponding set of measures

Original: Q ϵ =
Revised: Q ϵ =

Original: { Q : T # P = Q, T ∈ T ϵ } .
Revised: { Q : T # P = Q, T ∈ T ϵ } .

Original: We show that it is possible to generalize the performance of the estimator ˆ f obtained in (2.3) uniformly over the measures in Q ϵ .
Revised: We show that it is possible to generalize the performance of the estimator ˆ f obtained in (2.3) uniformly over the measures in Q ϵ .

Original: As mentioned previously, we only work with the quadratic loss function, but our result can be extended to the general loss function.
Revised: As mentioned previously, we only work with the quadratic loss function, but our result can be extended to the general loss function.

Original: The following theorem establishes a uniform bound on the estimation error of the population function ˜ f obtained from (2.3) with the regularizer as defined in (2.10):
Revised: The following theorem establishes a uniform bound on the estimation error of the population function ˜ f obtained from (2.3) with the regularizer as defined in (2.10):

Original: Theorem 2.9.
Revised: Theorem 2.9.

Original: The population estimator ˜ f satisfies the following bound on the estimation error:
Revised: The population estimator ˜ f satisfies the following bound on the estimation error:

Original: [Equation]
Revised: [Equation]

Original: The bound obtained in the above is the same as the one obtained in Theorem 2.7 (up to constants) and has analogous interpretation: it consists of the minimum training error achieved on F and the smoothness of f 0 quantified in terms of the regularizer.
Revised: The bound obtained in the above is the same as the one obtained in Theorem 2.7 (up to constants) and has analogous interpretation: it consists of the minimum training error achieved on F and the smoothness of f 0 quantified in terms of the regularizer.

Original: Moreover, the bound holds uniformly over all the domains Q ∈ Q ϵ , i.e., the performance of the estimator ˆ f can be extrapolated to all the domains in Q ϵ , provided that R ( f 0 , f 0 ) is small.
Revised: Moreover, the bound holds uniformly over all the domains Q ∈ Q ϵ , i.e., the performance of the estimator ˆ f can be extrapolated to all the domains in Q ϵ , provided that R ( f 0 , f 0 ) is small.

Original: 2.4 Empirical Results
Revised: 2.4 Empirical Results

Original: We verify our theoretical findings empirically.
Revised: We verify our theoretical findings empirically.

Original: Our goal is to improve performance under distribution shifts using individual fairness methods.
Revised: Our goal is to improve performance under distribution shifts using individual fairness methods.

Original: We consider SenSeI [3], Sensitive Subspace Robustness (SenSR) [14], Counterfactual Logit Pairing (CLP) [28], and GLIF [9].
Revised: We consider SenSeI [3], Sensitive Subspace Robustness (SenSR) [14], Counterfactual Logit Pairing (CLP) [28], and GLIF [9].

Original: GLIF, similar to domain adaptation methods, requires unlabeled samples from the target.
Revised: GLIF, similar to domain adaptation methods, requires unlabeled samples from the target.

Original: The other methods only utilize the source data as in the domain generalization scenario.
Revised: The other methods only utilize the source data as in the domain generalization scenario.

Original: Our theory establishes guarantees on the target domain performance for SenSeI (Section 2.3) and GLIF (Section 2.1).
Revised: Our theory establishes guarantees on the target domain performance for SenSeI (Section 2.3) and GLIF (Section 2.1).

Original: Datasets and Metrics We experiment with two textual datasets, Toxicity [8] and Bios [7].
Revised: Datasets and Metrics We experiment with two textual datasets, Toxicity [8] and Bios [7].

Original: In
Revised: In

Original: Toxicity, the goal is to identify toxic comments.
Revised: Toxicity, the goal is to identify toxic comments.

Original: This dataset has been considered by both the domain generalization community [4], [6], [29] (under the name Civil Comments) as well as the individual fairness community [3], [9], [28].
Revised: This dataset has been considered by both the domain generalization community [4], [6], [29] (under the name Civil Comments) as well as the individual fairness community [3], [9], [28].

Original: The key difference between the two communities are in the comparison metrics.
Revised: The key difference between the two communities are in the comparison metrics.

Original: In domain generalization, it is common to consider performance on underrepresented groups (or simply worst group performance).
Revised: In domain generalization, it is common to consider performance on underrepresented groups (or simply worst group performance).

Original: In individual fairness, a common metric is prediction consistency, i.e., a fraction of test samples where predictions remain unchanged under certain modifications to the inputs, which maintain a similarity from the fairness standpoint.
Revised: In individual fairness, a common metric is prediction consistency, i.e., a fraction of test samples where predictions remain unchanged under certain modifications to the inputs, which maintain a similarity from the fairness standpoint.

Original: In Toxicity, the group memberships can be defined either with respect to human annotations provided with the dataset, or with respect to the presence of certain identity tokens.
Revised: In Toxicity, the group memberships can be defined either with respect to human annotations provided with the dataset, or with respect to the presence of certain identity tokens.

Original: Both groupings aim at highlighting comments that refer to identities that are subject to online harassment.
Revised: Both groupings aim at highlighting comments that refer to identities that are subject to online harassment.

Original: To quantify domain generalization, we evaluate average per group true negative (non-toxic) rate, where each group is weighted equally.
Revised: To quantify domain generalization, we evaluate average per group true negative (non-toxic) rate, where each group is weighted equally.

Original: We choose true negative rate (TNR) because underrepresented groups tend to have a larger fraction of toxic comments in the train data, thus being spuriously associated with toxicity by the model yielding poor TNR.
Revised: We choose true negative rate (TNR) because underrepresented groups tend to have a larger fraction of toxic comments in the train data, thus being spuriously associated with toxicity by the model yielding poor TNR.

Original: This is similar to how the background is spurious in the popular domain generalization Waterbirds benchmark [15].
Revised: This is similar to how the background is spurious in the popular domain generalization Waterbirds benchmark [15].

Original: We weigh each group equally to ensure that performance on underrepresented groups is factored in (a more robust alternative to worst group performance).
Revised: We weigh each group equally to ensure that performance on underrepresented groups is factored in (a more robust alternative to worst group performance).

Original: We consider both groupings, i.e., TNR (Annotations) and TNR (Identity tokens).
Revised: We consider both groupings, i.e., TNR (Annotations) and TNR (Identity tokens).

Original: In Bios, the task is to predict the occupation of a person from their biography.
Revised: In Bios, the task is to predict the occupation of a person from their biography.

Original: This dataset has been mostly studied in the fairness literature [3], [7], [30], [31], but it can also be considered from the domain generalization perspective.
Revised: This dataset has been mostly studied in the fairness literature [3], [7], [30], [31], but it can also be considered from the domain generalization perspective.

Original: Many of the occupations in the dataset exhibit large gender imbalance associated with historical biases, e.g., most nurses are female and most attorneys are male.
Revised: Many of the occupations in the dataset exhibit large gender imbalance associated with historical biases, e.g., most nurses are female and most attorneys are male.

Original: Thus, gender pronouns and names can introduce spurious relations with the occupation prediction.
Revised: Thus, gender pronouns and names can introduce spurious relations with the occupation prediction.

Original: To quantify this effect from the domain generalization perspective, we report the average of the worst accuracies with respect to the gender for each occupation (Worst per gender).
Revised: To quantify this effect from the domain generalization perspective, we report the average of the worst accuracies with respect to the gender for each occupation (Worst per gender).

Original: Since both datasets are class-imbalanced, we also report balanced (by class) test accuracy (BA) on source to ensure that in-distribution performance remains reasonable.
Revised: Since both datasets are class-imbalanced, we also report balanced (by class) test accuracy (BA) on source to ensure that in-distribution performance remains reasonable.

Original: Results In Table 1, we compare methods for enforcing individual fairness with an ERM baseline.
Revised: Results In Table 1, we compare methods for enforcing individual fairness with an ERM baseline.

Original: IF methods require a fair metric that encodes that changes in identity tokens result in similar comments in Toxicity, and changes in gender pronouns and names result in similar biographies in Bios (except for CLP which instead uses this intuition for data augmentation).
Revised: IF methods require a fair metric that encodes that changes in identity tokens result in similar comments in Toxicity, and changes in gender pronouns and names result in similar biographies in Bios (except for CLP which instead uses this intuition for data augmentation).

Original: We obtained the fair metric as in the original studies of the corresponding methods.
Revised: We obtained the fair metric as in the original studies of the corresponding methods.

Original: We can observe that IF methods consistently improve domain generalization metrics supporting our theoretical findings.
Revised: We can observe that IF methods consistently improve domain generalization metrics supporting our theoretical findings.

Original: They also tend to maintain reasonable in-distribution performance, supporting their overall applicability in practical use-cases where both in- and out-of-distribution performance is important.
Revised: They also tend to maintain reasonable in-distribution performance, supporting their overall applicability in practical use-cases where both in- and out-of-distribution performance is important.

Original: Among the IF methods, SenSeI performs slightly better overall.
Revised: Among the IF methods, SenSeI performs slightly better overall.

Original: We refer to Appendix F for additional results verifying that the considered methods also achieve IF.
Revised: We refer to Appendix F for additional results verifying that the considered methods also achieve IF.

Original: [Table]
Revised: [Table]

Original:  Individual Fairness via Domain Adaptation
Revised:  Individual Fairness via Domain Adaptation

Original: In the previous section
Revised: In the previous section

Original: [Table]
Revised: [Table]

Original: we established that it is possible to use IF regularizers for domain adaptation problems provided that the true underlying signal satisfies some smoothness conditions.
Revised: we established that it is possible to use IF regularizers for domain adaptation problems provided that the true underlying signal satisfies some smoothness conditions.

Original: In this section
Revised: In this section

Original: [Table]
Revised: [Table]

Original: we investigate the opposite direction,
Revised: we investigate the opposite direction,

Original: i
Revised: i

Original: [Table]
Revised: [Table]

Original: e., whether the techniques employed for DA can be leveraged to enforce IF.
Revised: e., whether the techniques employed for DA can be leveraged to enforce IF.

Original: Many DA methods aim at finding a representation Φ( X ) of the input sample
Revised: Many DA methods aim at finding a representation Φ( X ) of the input sample

Original: X , such that the source and the target distributions of Φ( X ) are aligned.
Revised: X , such that the source and the target distributions of Φ( X ) are aligned.

Original: In other words, the goal is to make it hard to distinguish Φ( X S i ) ′
Revised: In other words, the goal is to make it hard to distinguish Φ( X S i ) ′

Original: s from Φ( X T i ) ′
Revised: s from Φ( X T i ) ′

Original: s .
Revised: s .

Original: For example, Ganin et al.
Revised: For example, Ganin et al.

Original: [10] proposed the
Revised: [10] proposed the

Original: Domain Adversarial Neural Network (DANN) for learning Φ( X ) , such that the discriminator fails to discriminate between Φ( X S ) and Φ( X T ) .
Revised: Domain Adversarial Neural Network (DANN) for learning Φ( X ) , such that the discriminator fails to discriminate between Φ( X S ) and Φ( X T ) .

Original: Shu et al.
Revised: Shu et al.

Original: [11] assume that the target distribution is clustered with respect to the classes and consequently the optimal classifier should pass through the low density region.
Revised: [11] assume that the target distribution is clustered with respect to the classes and consequently the optimal classifier should pass through the low density region.

Original: To promote this condition, they modify the previous objective [10] with additional regularizers to ensure that the final classifier (which is built on top of Φ( X ) ) has low entropy on the target and is also locally Lipschitz.
Revised: To promote this condition, they modify the previous objective [10] with additional regularizers to ensure that the final classifier (which is built on top of Φ( X ) ) has low entropy on the target and is also locally Lipschitz.

Original: Sun et al.
Revised: Sun et al.

Original: [32] learn a linear transformation of the source distribution (which was later extended to learn non-linear transformations [33]), such that the first two moments of the transformed representations are the same in source and target distributions.
Revised: [32] learn a linear transformation of the source distribution (which was later extended to learn non-linear transformations [33]), such that the first two moments of the transformed representations are the same in source and target distributions.

Original: Shen et al.
Revised: Shen et al.

Original: [12] learn domain invariant representations by minimizing the Wasserstein distance between the distributions of source and target representations induced by Φ( X ) .
Revised: [12] learn domain invariant representations by minimizing the Wasserstein distance between the distributions of source and target representations induced by Φ( X ) .

Original: A common underlying theme of all of the above methods is to find Φ( X ) which has a similar distribution on both the source and the target.
Revised: A common underlying theme of all of the above methods is to find Φ( X ) which has a similar distribution on both the source and the target.

Original: In this section, we show that learning this domain invariant map indeed enforces individual fairness under suitable choice of domains.
Revised: In this section, we show that learning this domain invariant map indeed enforces individual fairness under suitable choice of domains.

Original: We demonstrate this by the following factor model: suppose we want to achieve individual fairness against a binary protected attribute Z (say sex).
Revised: We demonstrate this by the following factor model: suppose we want to achieve individual fairness against a binary protected attribute Z (say sex).

Original: We define two domains as two groups corresponding the protected attribute, e.g., the source domain may consist of all the observations corresponding to the males and the target domain may consist of all the observations corresponding to the females.
Revised: We define two domains as two groups corresponding the protected attribute, e.g., the source domain may consist of all the observations corresponding to the males and the target domain may consist of all the observations corresponding to the females.

Original: We assume that the covariates follow a factor model structure X =
Revised: We assume that the covariates follow a factor model structure X =

Original: AU
Revised: AU

Original: + bZ + ϵ for three independent random variables ( U, Z, ϵ ) where U denotes the relevant attribute, Z denotes the protected attributes and ϵ is the noise.
Revised: + bZ + ϵ for three independent random variables ( U, Z, ϵ ) where U denotes the relevant attribute, Z denotes the protected attributes and ϵ is the noise.

Original: Therefore, according to our design:
Revised: Therefore, according to our design:

Original: [Equation]
Revised: [Equation]

Original: In the following theorem, we establish that if we estimate some linear transformation Φ ∈ R q × p (with q < p, p being the ambient dimension of X ) of X such that Φ X S and Φ X T has same distribution, then Φ b = 0 .
Revised: In the following theorem, we establish that if we estimate some linear transformation Φ ∈ R q × p (with q < p, p being the ambient dimension of X ) of X such that Φ X S and Φ X T has same distribution, then Φ b = 0 .

Original: Therefore, Φ X ignores the direction corresponding to the protected attribute and consequently is an individually fair representation.
Revised: Therefore, Φ X ignores the direction corresponding to the protected attribute and consequently is an individually fair representation.

Original: Theorem 3.1.
Revised: Theorem 3.1.

Original: Suppose the source and target distributions satisfy (3.1) and (3.2) .
Revised: Suppose the source and target distributions satisfy (3.1) and (3.2) .

Original: If some linear transformation Φ X satisfies Φ X S L = Φ X T , then Φ b = 0 .
Revised: If some linear transformation Φ X satisfies Φ X S L = Φ X T , then Φ b = 0 .

Original: This theorem implies any classifier built on top of the linear representation Φ x will be individually fair because Φ x = Φ x ′ for any x, x ′ that share relevant attributes U .
Revised: This theorem implies any classifier built on top of the linear representation Φ x will be individually fair because Φ x = Φ x ′ for any x, x ′ that share relevant attributes U .

Original: The proof of the theorem can be found in the appendix.
Revised: The proof of the theorem can be found in the appendix.

Original: The above theorem constitutes an example of how domain adaptation methods can be adapted to enforce individual fairness when the covariates follow a factor structure.
Revised: The above theorem constitutes an example of how domain adaptation methods can be adapted to enforce individual fairness when the covariates follow a factor structure.

Original: 3.1 Empirical Results
Revised: 3.1 Empirical Results

Original: In this section, our goal is to train individually fair models using methods popularized in the domain adaptation (DA) literature.
Revised: In this section, our goal is to train individually fair models using methods popularized in the domain adaptation (DA) literature.

Original: We experiment with DANN [10], VADA [11], and a variation of the
Revised: We experiment with DANN [10], VADA [11], and a variation of the

Original: Wasserstein-based DA (WDA) [12] discussed in Section 3.
Revised: Wasserstein-based DA (WDA) [12] discussed in Section 3.

Original: We present experimental details in Apx.
Revised: We present experimental details in Apx.

Original: F.
Revised: F.

Original: Datasets and Metrics We consider the same two datasets as in our domain generalization experiments in Section 2.4.
Revised: Datasets and Metrics We consider the same two datasets as in our domain generalization experiments in Section 2.4.

Original: We use prediction consistency (PC) to quantify individual fairness following prior works studying these datasets [3], [9].
Revised: We use prediction consistency (PC) to quantify individual fairness following prior works studying these datasets [3], [9].

Original: For the Toxicity dataset, we modify identity tokens in the test comments and compute prediction consistency with respect to all 50 identity tokens [8].
Revised: For the Toxicity dataset, we modify identity tokens in the test comments and compute prediction consistency with respect to all 50 identity tokens [8].

Original: A pair of comments that only differ in an identity token, e.g., “gay” vs “straight”, are intuitively similar and should be assigned the same prediction to satisfy individual fairness.
Revised: A pair of comments that only differ in an identity token, e.g., “gay” vs “straight”, are intuitively similar and should be assigned the same prediction to satisfy individual fairness.

Original: For the Bios dataset, we consider prediction consistency with respect to changes in gender pronouns and names.
Revised: For the Bios dataset, we consider prediction consistency with respect to changes in gender pronouns and names.

Original: Such changes result in biographies that should be treated similarly.
Revised: Such changes result in biographies that should be treated similarly.

Original: In these experiments, we have one labeled training dataset, rather than labeled source and unlabeled target datasets typical for DA setting.
Revised: In these experiments, we have one labeled training dataset, rather than labeled source and unlabeled target datasets typical for DA setting.

Original: As shown in Section 3, the key idea behind achieving individual fairness using DA techniques is to split the available train data into source and target domains such that aligning their representations pertains to the fairness goals.
Revised: As shown in Section 3, the key idea behind achieving individual fairness using DA techniques is to split the available train data into source and target domains such that aligning their representations pertains to the fairness goals.

Original: To this end, in the Bios dataset we split the train data into all-male and all-female biographies, and the Toxicity dataset we split into a domain with comments containing any of the aforementioned 50 identity tokens and a domain with comments without any identity tokens.
Revised: To this end, in the Bios dataset we split the train data into all-male and all-female biographies, and the Toxicity dataset we split into a domain with comments containing any of the aforementioned 50 identity tokens and a domain with comments without any identity tokens.

Original: The ERM baseline is trained on the complete training dataset.
Revised: The ERM baseline is trained on the complete training dataset.

Original: [Table]
Revised: [Table]

Original: Results We summarize the results in Table 2.
Revised: Results We summarize the results in Table 2.

Original: Among the considered DA methods,
Revised: Among the considered DA methods,

Original: WDA achieves best individual fairness improvements in terms of prediction consistency, while maintaining good balanced accuracy (BA).
Revised: WDA achieves best individual fairness improvements in terms of prediction consistency, while maintaining good balanced accuracy (BA).

Original: Comparing to a method de- signed for training individually fair models, SenSeI, prediction consistency of DA methods is worse; however, the subject understanding required to apply them is milder.
Revised: Comparing to a method de- signed for training individually fair models, SenSeI, prediction consistency of DA methods is worse; however, the subject understanding required to apply them is milder.

Original: Individual fairness methods require a problem-specific fair metric, which can be learned from the data, but even then requires user to define, e.g., groups of comparable samples [18].
Revised: Individual fairness methods require a problem-specific fair metric, which can be learned from the data, but even then requires user to define, e.g., groups of comparable samples [18].

Original: The domain adaptation approach requires a fairness-related splitting of the train data.
Revised: The domain adaptation approach requires a fairness-related splitting of the train data.

Original: In our experiments, we adopted straightforward data splitting strategies and demonstrated improvements over the baseline.
Revised: In our experiments, we adopted straightforward data splitting strategies and demonstrated improvements over the baseline.

Original: More sophisticated data splitting approaches can help to achieve further individual fairness improvements.
Revised: More sophisticated data splitting approaches can help to achieve further individual fairness improvements.

Original: We present additional experimental details in Appendix F.
Revised: We present additional experimental details in Appendix F.

Original:  Conclusion
Revised:  Conclusion

Original: We showed that algorithms for enforcing individual fairness (IF) can help ML models generalize to new domains and vice versa.
Revised: We showed that algorithms for enforcing individual fairness (IF) can help ML models generalize to new domains and vice versa.

Original: From the lens of algorithmic fairness, the results in Section 2 show that enforcing IF can mitigate algorithmic biases caused by covariate shift as long as the regression function satisfies IF .
Revised: From the lens of algorithmic fairness, the results in Section 2 show that enforcing IF can mitigate algorithmic biases caused by covariate shift as long as the regression function satisfies IF .

Original: This complements the recent results on mitigating algorithmic biases caused by subpopulation shift with group fairness [34].
Revised: This complements the recent results on mitigating algorithmic biases caused by subpopulation shift with group fairness [34].

Original: On the other hand, compared to existing results on out-of-distribution accuracy of ML models, the results in Section 2 demonstrate the importance of inductive biases in helping models adapt to new domains.
Revised: On the other hand, compared to existing results on out-of-distribution accuracy of ML models, the results in Section 2 demonstrate the importance of inductive biases in helping models adapt to new domains.

Original: One limitation of our analysis is the assumption of covariate shift.
Revised: One limitation of our analysis is the assumption of covariate shift.

Original: We have relaxed this assumption in Appendix E (see Theorem E.1), where we establish results for more general distribution shifts (e.g. label shift, posterior drift etc.).
Revised: We have relaxed this assumption in Appendix E (see Theorem E.1), where we establish results for more general distribution shifts (e.g. label shift, posterior drift etc.).

Original: In Section 3, we showed a probabilistic connection between domain adaptation (DA) and IF.
Revised: In Section 3, we showed a probabilistic connection between domain adaptation (DA) and IF.

Original: As we saw, it is possible to enforce IF by aligning the distributions of the features under a factor model.
Revised: As we saw, it is possible to enforce IF by aligning the distributions of the features under a factor model.

Original: This factor model is implicit in some prior works on algorithmic fairness [18], [35], but we are not aware of any results that show it is possible to enforce IF using DA techniques.
Revised: This factor model is implicit in some prior works on algorithmic fairness [18], [35], but we are not aware of any results that show it is possible to enforce IF using DA techniques.

Original: Recent DA methods typically leverage many inductive biases through data augmentations and regularizers, and our results suggest that IF can also be leveraged.
Revised: Recent DA methods typically leverage many inductive biases through data augmentations and regularizers, and our results suggest that IF can also be leveraged.

Original: For example, utilizing annotations to identify similar images [36] can be used to learn a “fair” metric for an IF-based regularizer.
Revised: For example, utilizing annotations to identify similar images [36] can be used to learn a “fair” metric for an IF-based regularizer.

Original: We also note that our approach is similar to that of consistency regularization for DA (e.g. see [37], [38], [39], [40]) where the key idea is to ensure that similar samples should yield similar labels .
Revised: We also note that our approach is similar to that of consistency regularization for DA (e.g. see [37], [38], [39], [40]) where the key idea is to ensure that similar samples should yield similar labels .

Original: We show that regularizer for enforcing IF can also be used as a consistency regularizer for extrapolation on the test domain.
Revised: We show that regularizer for enforcing IF can also be used as a consistency regularizer for extrapolation on the test domain.

Original: Finally, from the perspective of achieving IF, a study of different strategies for data partitioning in combination with modern DA best practices is an interesting direction for future work.
Revised: Finally, from the perspective of achieving IF, a study of different strategies for data partitioning in combination with modern DA best practices is an interesting direction for future work.

Original: Acknowledgments and Disclosure of Funding
Revised: Acknowledgments and Disclosure of Funding

Original: This paper is based upon work supported by the National Science Foundation (NSF) under grants no.
Revised: This paper is based upon work supported by the National Science Foundation (NSF) under grants no.

Original: and 2113373 as well as the DFG in the Cluster of Excellence EXC 2117 “Centre for the Advanced Study of Collective Behaviour” (Project-ID 390829875).
Revised: and 2113373 as well as the DFG in the Cluster of Excellence EXC 2117 “Centre for the Advanced Study of Collective Behaviour” (Project-ID 390829875).

Original: A Appendix A.1 Proof of Theorem 2. 
Revised: A Appendix A.1 Proof of Theorem 2.

Original: For the proof of this theorem, we need few auxiliary lemmas, which we state below:
Revised: For the proof of this theorem, we need few auxiliary lemmas, which we state below:

Original: Lemma A.1.
Revised: Lemma A.1.

Original: Define the extrapolation map y ∗ t : R n s (cid:55)→ R n t as:
Revised: Define the extrapolation map y ∗ t : R n s (cid:55)→ R n t as:

Original: [Equation]
Revised: [Equation]

Original: Then under our assumptions on R n :
Revised: Then under our assumptions on R n :

Original: • y ∗ t is Lipschitz with Lipschitz constant L R µ R .
Revised: • y ∗ t is Lipschitz with Lipschitz constant L R µ R .

Original: • For any vector ( v s , v t ) we have: ∥ v t − y ∗ t ( v s ) ∥ 2 ≤ 2 n µ R R
Revised: • For any vector ( v s , v t ) we have: ∥ v t − y ∗ t ( v s ) ∥ 2 ≤ 2 n µ R R

Original: v s , v t ) .
Revised: v s , v t ) .

Original: Lemma A.2.
Revised: Lemma A.2.

Original: Under Assumption 2.3 we have:
Revised: Under Assumption 2.3 we have:

Original: [Equation]
Revised: [Equation]

Original: for any function f .
Revised: for any function f .

Original: Furthermore, if ∂ 1 L and ∂ 2 L denotes the first and second partial derivative of L respectively, then we have:
Revised: Furthermore, if ∂ 1 L and ∂ 2 L denotes the first and second partial derivative of L respectively, then we have:

Original: [Equation]
Revised: [Equation]

Original: The proof of Lemma A.1 can be found in Section B.1 and the proof of Lemma A.2 can be found in
Revised: The proof of Lemma A.1 can be found in Section B.1 and the proof of Lemma A.2 can be found in

Original: Section B.2.
Revised: Section B.2.

Original: For the rest of the proof, we introduce some notations for the ease of presentation: for any two vector v 1 , v 2 of the same dimension we use L ( v 1 , v 2 ) or its partial derivatives to denote the coordinate wise sum, i.e., (cid:80) j L ( v 1 ,j , v 2 ,j ) .
Revised: For the rest of the proof, we introduce some notations for the ease of presentation: for any two vector v 1 , v 2 of the same dimension we use L ( v 1 , v 2 ) or its partial derivatives to denote the coordinate wise sum, i.e., (cid:80) j L ( v 1 ,j , v 2 ,j ) .

Original: From the strong smoothness condition on L we have:
Revised: From the strong smoothness condition on L we have:

Original: [Equation]
Revised: [Equation]

Original: We can further bound the first term on the RHS of the above equation as follows:
Revised: We can further bound the first term on the RHS of the above equation as follows:

Original: [Equation]
Revised: [Equation]

Original: Combining the bounds on Equations (A.1) and (A.2) we obtain:
Revised: Combining the bounds on Equations (A.1) and (A.2) we obtain:

Original: [Equation]
Revised: [Equation]

Original: The term T 4 , T 5 can be bounded directly by Lemma A.1 as:
Revised: The term T 4 , T 5 can be bounded directly by Lemma A.1 as:

Original: [Equation]
Revised: [Equation]

Original: (cid:16)
Revised: (cid:16)

Original: [Equation]
Revised: [Equation]

Original: X
Revised: X

Original: [Equation]
Revised: [Equation]

Original: (A.5)
Revised: (A.5)

Original: To bound T 2 , using ab ≤ ( a 2 + b 2 ) / 2 we have:
Revised: To bound T 2 , using ab ≤ ( a 2 + b 2 ) / 2 we have:

Original: [Equation]
Revised: [Equation]

Original: [ Lemma A. 2]
Revised: [ Lemma A. 2]

Original: [Equation]
Revised: [Equation]

Original: [ Lemma A. 1]
Revised: [ Lemma A. 1]

Original: [Equation]
Revised: [Equation]

Original: [ Lemma A. 2]
Revised: [ Lemma A. 2]

Original: The bound on T 3 follows from a similar line of argument:
Revised: The bound on T 3 follows from a similar line of argument:

Original: [Equation]
Revised: [Equation]

Original: Lemma A.
Revised: Lemma A.

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: (cid:16)
Revised: (cid:16)

Original: [Equation]
Revised: [Equation]

Original: [ Lemma A. 2]
Revised: [ Lemma A. 2]

Original: Finally to bound T 1 we use again Assumption 2.3, i.e., strong convexity and strong smoothness of L as follows:
Revised: Finally to bound T 1 we use again Assumption 2.3, i.e., strong convexity and strong smoothness of L as follows:

Original: [Equation]
Revised: [Equation]

Original: Suppose ρ n = n s /n t .
Revised: Suppose ρ n = n s /n t .

Original: Then we have n/n t = 1 + ρ n .
Revised: Then we have n/n t = 1 + ρ n .

Original: Using this notation and combining the bound on all { T i } 5 i =1 , we obtain:
Revised: Using this notation and combining the bound on all { T i } 5 i =1 , we obtain:

Original: [Equation]
Revised: [Equation]

Original: with the values of α n and β n being:
Revised: with the values of α n and β n being:

Original: [Equation]
Revised: [Equation]

Original: n = max (cid:26) L
Revised: n = max (cid:26) L

Original: [Equation]
Revised: [Equation]

Original: L 2 R ( µ L
Revised: L 2 R ( µ L

Original: [Equation]
Revised: [Equation]

Original: 3 L L ) 2 µ
Revised: 3 L L ) 2 µ

Original: [Equation]
Revised: [Equation]

Original: µ L ρ n ,
Revised: µ L ρ n ,

Original: [Equation]
Revised: [Equation]

Original: λµ
Revised: λµ

Original: R (1 + ρ n ) (cid:27) , (A.7) β n = 2 + L L + L 2 L µ R (1 + ρ n ) .
Revised: R (1 + ρ n ) (cid:27) , (A.7) β n = 2 + L L + L 2 L µ R (1 + ρ n ) .

Original: (A.8)
Revised: (A.8)

Original: This completes the proof.
Revised: This completes the proof.

Original: A.2 Proof of Theorem 2. 
Revised: A.2 Proof of Theorem 2.

Original: First, note that, from Assumption 2.3 we have:
Revised: First, note that, from Assumption 2.3 we have:

Original: E Q (cid:104) L ( ˜ f ( x ) , f 0 ( x ))
Revised: E Q (cid:104) L ( ˜ f ( x ) , f 0 ( x ))

Original: (cid:105) ≤ (cid:24)(cid:24) (cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:58)
Revised: (cid:105) ≤ (cid:24)(cid:24) (cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:58)

Original: E Q [ L ( f 0 ( x )) , f 0 ( x ))]
Revised: E Q [ L ( f 0 ( x )) , f 0 ( x ))]

Original: + (cid:24)(cid:24) (cid:24)(cid:24) (cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:58)
Revised: + (cid:24)(cid:24) (cid:24)(cid:24) (cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:58)

Original: E (cid:104) ( ˜ f ( x ) − f 0 ( x )))
Revised: E (cid:104) ( ˜ f ( x ) − f 0 ( x )))

Original: ∂ 1 L ( f 0 ( x ) , f 0 ( x ))
Revised: ∂ 1 L ( f 0 ( x ) , f 0 ( x ))

Original: (cid:105)
Revised: (cid:105)

Original: + L L 2 (cid:13)(cid:13) (cid:13)
Revised: + L L 2 (cid:13)(cid:13) (cid:13)

Original: ˜ f
Revised: ˜ f

Original: ( x ) − f 0 ( x ) (cid:13)(cid:13) (cid:13) 2 Q =
Revised: ( x ) − f 0 ( x ) (cid:13)(cid:13) (cid:13) 2 Q =

Original: L L 2 (cid:13)(cid:13)(cid:13)
Revised: L L 2 (cid:13)(cid:13)(cid:13)

Original: ˆ f ( x ) − f 0 ( x ) (cid:13)(cid:13)(cid:13) 2 Q .
Revised: ˆ f ( x ) − f 0 ( x ) (cid:13)(cid:13)(cid:13) 2 Q .

Original: (A.9) and
Revised: (A.9) and

Original: E P (cid:104) L ( ˜ f ( x ) , f 0 ( x ))
Revised: E P (cid:104) L ( ˜ f ( x ) , f 0 ( x ))

Original: (cid:105) ≥ (cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:58)
Revised: (cid:105) ≥ (cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:24)(cid:58)

Original: [Equation]
Revised: [Equation]

Original: [Equation] [Equation]
Revised: [Equation] [Equation]

Original: (A.10)
Revised: (A.10)

Original: Therefore, it is enough to bound ∥ ˆ f ( x ) − f 0 ( x ) ∥ 2 Q .
Revised: Therefore, it is enough to bound ∥ ˆ f ( x ) − f 0 ( x ) ∥ 2 Q .

Original: As per Assumption 2.6, R is strongly convex with respect to its second coordinate, i.e.,
Revised: As per Assumption 2.6, R is strongly convex with respect to its second coordinate, i.e.,

Original: [Equation]
Revised: [Equation]

Original: We now define an operator M along the line of y ∗ t as M ( f ) =
Revised: We now define an operator M along the line of y ∗ t as M ( f ) =

Original: arg min g R ( f, g ) .
Revised: arg min g R ( f, g ) .

Original: As M ( f ) is the minimizer over of the second coordinate, we have ∂ 2 R ( f, M ( f ))
Revised: As M ( f ) is the minimizer over of the second coordinate, we have ∂ 2 R ( f, M ( f ))

Original: = 

Revised: =

Original: and consequently from the strong convexity of R we have:
Revised: and consequently from the strong convexity of R we have:

Original: [Equation]
Revised: [Equation]

Original: The above inequality implies:
Revised: The above inequality implies:

Original: [Equation]
Revised: [Equation]

Original: which will be used later in our proof.
Revised: which will be used later in our proof.

Original: M is Lipschitz: By definition of M we have ∂ 2 R ( f, M ( f ))
Revised: M is Lipschitz: By definition of M we have ∂ 2 R ( f, M ( f ))

Original: = 0 , which further implies for any two functions f 1 , f 2 :
Revised: = 0 , which further implies for any two functions f 1 , f 2 :

Original: [Equation]
Revised: [Equation]

Original: Changing side we obtain:
Revised: Changing side we obtain:

Original: [Equation]
Revised: [Equation]

Original: where the last inequality follows from the strong convexity of R (Assumption 2.6).
Revised: where the last inequality follows from the strong convexity of R (Assumption 2.6).

Original: Furthermore, we have:
Revised: Furthermore, we have:

Original: [Equation]
Revised: [Equation]

Original: This follows from the second part of Assumption 2.6.
Revised: This follows from the second part of Assumption 2.6.

Original: Combining Equation (A.11) and (A.12), we conclude:
Revised: Combining Equation (A.11) and (A.12), we conclude:

Original: [Equation]
Revised: [Equation]

Original: We now return to the main proof:
Revised: We now return to the main proof:

Original: [Equation]
Revised: [Equation]

Original: where the first term on the right hand side is the minimum training error (population version, i.e., in presence of infinite sample) and the second term quantifies the smoothness of f 0 in terms of the regularizer R .
Revised: where the first term on the right hand side is the minimum training error (population version, i.e., in presence of infinite sample) and the second term quantifies the smoothness of f 0 in terms of the regularizer R .

Original: The last inequality follows from the strong convexity of the loss function ((A.10)).
Revised: The last inequality follows from the strong convexity of the loss function ((A.10)).

Original: A.3 Proof of Theorem 2. 
Revised: A.3 Proof of Theorem 2.

Original: In this section, we prove Theorem 2.9.
Revised: In this section, we prove Theorem 2.9.

Original: Fix Q ∈ Q ϵ .
Revised: Fix Q ∈ Q ϵ .

Original: Then there exists some T ≡ T ( Q ) ∈ T ϵ such that T # P = Q .
Revised: Then there exists some T ≡ T ( Q ) ∈ T ϵ such that T # P = Q .

Original: Define an operator M T as:
Revised: Define an operator M T as:

Original: [Equation]
Revised: [Equation]

Original: where R T ( f, g ) =
Revised: where R T ( f, g ) =

Original: E x ∼ P (cid:104) ( f ( x ) − g ( T ( x ))) 2 (cid:105) .
Revised: E x ∼ P (cid:104) ( f ( x ) − g ( T ( x ))) 2 (cid:105) .

Original: The proof of the strong convexity of R T with respect to its second coordinate is straightforward as we have the following double Gateaux derivative:
Revised: The proof of the strong convexity of R T with respect to its second coordinate is straightforward as we have the following double Gateaux derivative:

Original: [Equation]
Revised: [Equation]

Original: Fix f ∈ F and define ∆ = f ◦ T − M T ( f ) ◦ T .
Revised: Fix f ∈ F and define ∆ = f ◦ T − M T ( f ) ◦ T .

Original: A two step Taylor expansion yields:
Revised: A two step Taylor expansion yields:

Original: [Equation]
Revised: [Equation]

Original: where the derivative is canceled because M T ( f ) is the minimizer.
Revised: where the derivative is canceled because M T ( f ) is the minimizer.

Original: Therefore, we have:
Revised: Therefore, we have:

Original: [Equation]
Revised: [Equation]

Original: We use the above bound in our subsequent calculation:
Revised: We use the above bound in our subsequent calculation:

Original: [Equation]
Revised: [Equation]

Original: A.14)
Revised: A.14)

Original: We now bound the second term of the RHS of the above equation.
Revised: We now bound the second term of the RHS of the above equation.

Original: Following the similar calculation as in (A.11) and (A.12) we have for any function f 1 , f 2 :
Revised: Following the similar calculation as in (A.11) and (A.12) we have for any function f 1 , f 2 :

Original: [Equation]
Revised: [Equation]

Original: In particular for f 1 = ˜ f and f 2 = f 0 we have:
Revised: In particular for f 1 = ˜ f and f 2 = f 0 we have:

Original: [Equation]
Revised: [Equation]

Original: Combining the bound in (A.14) and (A.15) we conclude that for any Q ∈ Q ϵ :
Revised: Combining the bound in (A.14) and (A.15) we conclude that for any Q ∈ Q ϵ :

Original: [Equation]
Revised: [Equation]

Original: Taking the supremum with respect to Q on both sides
Revised: Taking the supremum with respect to Q on both sides

Original: [Equation]
Revised: [Equation]

Original: we conclude the proof of the theorem
Revised: we conclude the proof of the theorem

Original: [Equation]
Revised: [Equation]

Original: A.4 Proof of Theorem 3. 
Revised: A.4 Proof of Theorem 3.

Original: The proof follows from analyzing the characteristic function of X s and X t .
Revised: The proof follows from analyzing the characteristic function of X s and X t .

Original: Note that by definition:
Revised: Note that by definition:

Original: [Equation]
Revised: [Equation]

Original: Similarly, for X t we have:
Revised: Similarly, for X t we have:

Original: [Equation]
Revised: [Equation]

Original: Therefore, if Φ X s L = Φ X t , ϕ Ψ
Revised: Therefore, if Φ X s L = Φ X t , ϕ Ψ

Original: X t ( t ) = ϕ
Revised: X t ( t ) = ϕ

Original: Φ X s ( t ) for all t , which further implies e it ⊤ Φ b = 1 for all t , which implies Φ b = 0 .
Revised: Φ X s ( t ) for all t , which further implies e it ⊤ Φ b = 1 for all t , which implies Φ b = 0 .

Original: This completes the proof.
Revised: This completes the proof.

Original: B Proof of Auxiliary Lemmas B.1 Proof of Lemma A. 
Revised: B Proof of Auxiliary Lemmas B.1 Proof of Lemma A.

Original: The proof of the second part of the above lemma follows directly from the strong convexity of R n with respect to the second coordinate, as the strong convexity assumption yields:
Revised: The proof of the second part of the above lemma follows directly from the strong convexity of R n with respect to the second coordinate, as the strong convexity assumption yields:

Original: [Equation]
Revised: [Equation]

Original: The second term of the RHS of the above equation is 0 as ∂ t R ( v s , y ∗ t ( v s ))
Revised: The second term of the RHS of the above equation is 0 as ∂ t R ( v s , y ∗ t ( v s ))

Original: = 

Revised: =

Original: (as the derivative of a smooth function is 0 at minima).
Revised: (as the derivative of a smooth function is 0 at minima).

Original: Therefore, changing sides of the terms, we conclude:
Revised: Therefore, changing sides of the terms, we conclude:

Original: [Equation]
Revised: [Equation]

Original: where the last inequality follows from the non-negativity of R n .
Revised: where the last inequality follows from the non-negativity of R n .

Original: This completes the proof of the second part of the lemma.
Revised: This completes the proof of the second part of the lemma.

Original: For the first part of the lemma, first note that we have :
Revised: For the first part of the lemma, first note that we have :

Original: [Equation]
Revised: [Equation]

Original: as ∂ t R n ( v 1 , y ∗ t ( v 1 )) =
Revised: as ∂ t R n ( v 1 , y ∗ t ( v 1 )) =

Original: ∂ t R n ( v 2 , y ∗ t ( v 2 )) = 0 (derivative is 0 at minima).
Revised: ∂ t R n ( v 2 , y ∗ t ( v 2 )) = 0 (derivative is 0 at minima).

Original: Adding and subtracting ∂ t R n ( v 1 , y ∗ t ( v 2 )) from the above equation yields:
Revised: Adding and subtracting ∂ t R n ( v 1 , y ∗ t ( v 2 )) from the above equation yields:

Original: [Equation]
Revised: [Equation]

Original: Changing sides, we have:
Revised: Changing sides, we have:

Original: [Equation]
Revised: [Equation]

Original: On the other hand
Revised: On the other hand

Original: [Equation]
Revised: [Equation]

Original: a simple application of the Cauchy-Schwarz inequality yields:
Revised: a simple application of the Cauchy-Schwarz inequality yields:

Original: [Equation]
Revised: [Equation]

Original: Combining the bounds of Equation (B.1) and (B.2)
Revised: Combining the bounds of Equation (B.1) and (B.2)

Original: [Equation]
Revised: [Equation]

Original: we have:
Revised: we have:

Original: [Equation]
Revised: [Equation]

Original: which completes the proof
Revised: which completes the proof

Original: [Equation]
Revised: [Equation]

Original: B.2 Proof of Lemma A. 
Revised: B.2 Proof of Lemma A.

Original: The proof follows directly from the following properties of the L :
Revised: The proof follows directly from the following properties of the L :

Original: L ( f 0 ( X s ) , f 0 ( X s ))
Revised: L ( f 0 ( X s ) , f 0 ( X s ))

Original: = 0 .
Revised: = 0 .

Original: ∂ 1 L ( f 0 ( X s ) , f 0 ( X s ))
Revised: ∂ 1 L ( f 0 ( X s ) , f 0 ( X s ))

Original: =
Revised: =

Original: ∂ 2 L ( f 0 ( X s ) , f 0 ( X s )) =3.
Revised: ∂ 2 L ( f 0 ( X s ) , f 0 ( X s )) =3.

Original: L is strongly convex.
Revised: L is strongly convex.

Original: From strong convexity of L we have:
Revised: From strong convexity of L we have:

Original: [Equation]
Revised: [Equation]

Original: The first and second term on the RHS will be 0 by the first and second properties of L mentioned above.
Revised: The first and second term on the RHS will be 0 by the first and second properties of L mentioned above.

Original: Therefore, we have:
Revised: Therefore, we have:

Original: [Equation]
Revised: [Equation]

Original: [Table]
Revised: [Table]

Original: which completes the proof
Revised: which completes the proof

Original: [Table]
Revised: [Table]

Original: C Similarity Kernel-based Regularizer
Revised: C Similarity Kernel-based Regularizer

Original: A similarity kernel-based regularizer R is defined as:
Revised: A similarity kernel-based regularizer R is defined as:

Original: [Equation]
Revised: [Equation]

Original: where K is the kernel of similarity.
Revised: where K is the kernel of similarity.

Original: In particular, if an x from the source domain is similar to an x ′ in the target domain in the sense that f 0 ( x ) ≈ f 0 ( x ′ ) , then we expect the value of K ( x, x ′ ) to be large.
Revised: In particular, if an x from the source domain is similar to an x ′ in the target domain in the sense that f 0 ( x ) ≈ f 0 ( x ′ ) , then we expect the value of K ( x, x ′ ) to be large.

Original: In this section, we show that under some mild regularity condition on K , this regularizer satisfies
Revised: In this section, we show that under some mild regularity condition on K , this regularizer satisfies

Original: Assumption 2.2.
Revised: Assumption 2.2.

Original: Assumption C.

Revised: Assumption C.

Original: (Assumption on kernel) .
Revised: (Assumption on kernel) .

Original: Define K Q ( x ′ ) =
Revised: Define K Q ( x ′ ) =

Original: E x ∼ P [ K ( x, x ′ )] and K max = max x,x ′ K ( x, x ′ ) .
Revised: E x ∼ P [ K ( x, x ′ )] and K max = max x,x ′ K ( x, x ′ ) .

Original: Assume that K max < ∞ and
Revised: Assume that K max < ∞ and

Original: [Equation]
Revised: [Equation]

Original: Gateaux derivatives of R ( f, g ) :
Revised: Gateaux derivatives of R ( f, g ) :

Original: The first order Gateaux derivative of R in the direction of a function h is defined as:
Revised: The first order Gateaux derivative of R in the direction of a function h is defined as:

Original: [Equation]
Revised: [Equation]

Original: Similarly, the second order Gateaux derivative at direction ( h 1 , h 2 ) is defined as:
Revised: Similarly, the second order Gateaux derivative at direction ( h 1 , h 2 ) is defined as:

Original: [Equation]
Revised: [Equation]

Original: where K Q ( X ′ )
Revised: where K Q ( X ′ )

Original: =
Revised: =

Original: E X ∼ P [ K ( X, X ′ )] .
Revised: E X ∼ P [ K ( X, X ′ )] .

Original: Therefore, the strong convexity follows from Assumption C.1.
Revised: Therefore, the strong convexity follows from Assumption C.1.

Original: We next show that R also satisfies the second condition of Assumption 2.6.
Revised: We next show that R also satisfies the second condition of Assumption 2.6.

Original: Towards that direction:
Revised: Towards that direction:

Original: [Equation]
Revised: [Equation]

Original: This concludes that the similarity kernel-based population regularizer R satisfies Assumption 2.
Revised: This concludes that the similarity kernel-based population regularizer R satisfies Assumption 2.

Original: under Assumption C.1 on the kernel function.
Revised: under Assumption C.1 on the kernel function.

Original: D Population and Sample Version of the Regularizer
Revised: D Population and Sample Version of the Regularizer

Original: In this section, we show that under a fairly general condition, if R n (the sample version of the regularization) satisfies Assumptions 2.1 and 2.2 and R is the asymptotic limit of R n , i.e.,
Revised: In this section, we show that under a fairly general condition, if R n (the sample version of the regularization) satisfies Assumptions 2.1 and 2.2 and R is the asymptotic limit of R n , i.e.,

Original: R n a.s.
Revised: R n a.s.

Original: → R as n s , n t → ∞ , then R will satisfy Assumption 2.5 and 2.6.
Revised: → R as n s , n t → ∞ , then R will satisfy Assumption 2.5 and 2.6.

Original: Towards that if R n satisfies
Revised: Towards that if R n satisfies

Original: Assumption 2.1 for all n , then taking the limit n → ∞ , it is immediate that R satisfies Assumption 2.5.
Revised: Assumption 2.1 for all n , then taking the limit n → ∞ , it is immediate that R satisfies Assumption 2.5.

Original: For the other assumption, suppose R n satisfies the first part of Assumption 2.2, i.e., it is strongly convex with respect to its second coordinates (the coordinates corresponding to the target samples), then again, simply taking the limit n → ∞ , we conclude that R is also strongly convex with µ R = lim inf n →∞ µ R n (as long as µ R > 0 ).
Revised: For the other assumption, suppose R n satisfies the first part of Assumption 2.2, i.e., it is strongly convex with respect to its second coordinates (the coordinates corresponding to the target samples), then again, simply taking the limit n → ∞ , we conclude that R is also strongly convex with µ R = lim inf n →∞ µ R n (as long as µ R > 0 ).

Original: By similar argument, the second part of
Revised: By similar argument, the second part of

Original: Assumption 2.6 is also satisfied if R n satisfies the strong smoothness assumption and L R n does not diverge to infinity.
Revised: Assumption 2.6 is also satisfied if R n satisfies the strong smoothness assumption and L R n does not diverge to infinity.

Original: E Bound for Non-Covariate Shift
Revised: E Bound for Non-Covariate Shift

Original: In this section
Revised: In this section

Original: [Equation]
Revised: [Equation]

Original: we extend the result of Theorem 2.7 to the setup when the mean function f 0 is different on source and target domain.
Revised: we extend the result of Theorem 2.7 to the setup when the mean function f 0 is different on source and target domain.

Original: More precisely, we assume the following data generative process:
Revised: More precisely, we assume the following data generative process:

Original: [Equation]
Revised: [Equation]

Original: The following theorem extends the bounds obtained in Theorem 2.7 for the estimator obtained via (2.3):
Revised: The following theorem extends the bounds obtained in Theorem 2.7 for the estimator obtained via (2.3):

Original: Theorem E.1.
Revised: Theorem E.1.

Original: Suppose we observe ( Y 1 , X 1 ) , . . .
Revised: Suppose we observe ( Y 1 , X 1 ) , . . .

Original: , ( X n , Y n ) from the source domain and ˜ X 1 , . . .
Revised: , ( X n , Y n ) from the source domain and ˜ X 1 , . . .

Original: , ˜ X n from the target domain.
Revised: , ˜ X n from the target domain.

Original: The estimator ˜ f obtained via Equation (2.3) satisfied the following generalization error bound on the target domain:
Revised: The estimator ˜ f obtained via Equation (2.3) satisfied the following generalization error bound on the target domain:

Original: [Equation]
Revised: [Equation]

Original: for some constants C 1 , C 2 mentioned explicitly in the proof.
Revised: for some constants C 1 , C 2 mentioned explicitly in the proof.

Original: Proof.
Revised: Proof.

Original: The proof is quite similar to the proof of Theorem
Revised: The proof is quite similar to the proof of Theorem

Original: [Equation]
Revised: [Equation]

Original: 7, hence we will only highlight here the key difference for the sake of brevity.
Revised: 7, hence we will only highlight here the key difference for the sake of brevity.

Original: From the proof of Theorem 2.7 we have:
Revised: From the proof of Theorem 2.7 we have:

Original: [Equation]
Revised: [Equation]

Original: An application of triangle inequality yields:
Revised: An application of triangle inequality yields:

Original: [Equation]
Revised: [Equation]

Original: where the first term on the right hand side is the minimum training error (population version, i.e., in presence of infinite sample) and the second term quantifies the smoothness of f 0 in terms of the regularizer R .
Revised: where the first term on the right hand side is the minimum training error (population version, i.e., in presence of infinite sample) and the second term quantifies the smoothness of f 0 in terms of the regularizer R .

Original: The last inequality follows from the strong convexity of the loss function (A.10).
Revised: The last inequality follows from the strong convexity of the loss function (A.10).

Original: Another version of telescoping sum yields:
Revised: Another version of telescoping sum yields:

Original: [Equation]
Revised: [Equation]

Original: Therefore, combining Equations (E.6) and (E.7) yields the result of the theorem.
Revised: Therefore, combining Equations (E.6) and (E.7) yields the result of the theorem.

Original: F Experimental Details
Revised: F Experimental Details

Original: In Table 3 we compare prediction consistency [3], [14] of the methods compared in Table 1 of the main text to verify that they also achieve individual fairness as intended.
Revised: In Table 3 we compare prediction consistency [3], [14] of the methods compared in Table 1 of the main text to verify that they also achieve individual fairness as intended.

Original: [Table]
Revised: [Table]

Original: We summarize some additional details regarding the implementation of domain adaptation methods in the experiments in Section 3.1.
Revised: We summarize some additional details regarding the implementation of domain adaptation methods in the experiments in Section 3.1.

Original: • Since the target domains are labeled (they consist of labeled samples from the train data), we also add a loss term to the objective corresponding to the target domain performance when training the domain adaptation methods.
Revised: • Since the target domains are labeled (they consist of labeled samples from the train data), we also add a loss term to the objective corresponding to the target domain performance when training the domain adaptation methods.

Original: Recall that the main mechanisms for achieving individual fairness are the representation alignment regularizers, thus adding loss in the target domain is simply a way to utilize the available labels to improve performance.
Revised: Recall that the main mechanisms for achieving individual fairness are the representation alignment regularizers, thus adding loss in the target domain is simply a way to utilize the available labels to improve performance.

Original: • For DANN, we use a ReLU-activated two-layer base model with 2000 hidden neurons andoutput neurons.
Revised: • For DANN, we use a ReLU-activated two-layer base model with 2000 hidden neurons andoutput neurons.

Original: Further, we use a ReLU-activated two-layer base model with 100 hidden neurons and one logistically activated neuron as the discriminator.
Revised: Further, we use a ReLU-activated two-layer base model with 100 hidden neurons and one logistically activated neuron as the discriminator.

Original: As the prediction head, we use a ReLU-activated two-layer model with 2000 hidden neurons.
Revised: As the prediction head, we use a ReLU-activated two-layer model with 2000 hidden neurons.

Original: • For VADA, we use the same models as for DANN, and the primary difference is the additional virtual adversarial training (VAT) loss.
Revised: • For VADA, we use the same models as for DANN, and the primary difference is the additional virtual adversarial training (VAT) loss.

Original: • For WDA, we replaced the Wasserstein distance utilized by Shen et al.
Revised: • For WDA, we replaced the Wasserstein distance utilized by Shen et al.

Original: [12] with the Sinkhorn divergence [41].
Revised: [12] with the Sinkhorn divergence [41].

Original: The Sinkhorn divergence is a computationally more efficient analogue of the Wasserstein distance regularizer.
Revised: The Sinkhorn divergence is a computationally more efficient analogue of the Wasserstein distance regularizer.

Original: We used the Geomloss package [42] in our code.
Revised: We used the Geomloss package [42] in our code.

Original: G Background on Domain Adaptation and Algorithmic Fairness
Revised: G Background on Domain Adaptation and Algorithmic Fairness

Original: Domain adaptation generally refers to the problem of semi-supervised learning under distribution shift.
Revised: Domain adaptation generally refers to the problem of semi-supervised learning under distribution shift.

Original: More precisely, in the semi-supervised setting the learner is given a labeled dataset { ( X i , Y i ) }
Revised: More precisely, in the semi-supervised setting the learner is given a labeled dataset { ( X i , Y i ) }

Original: ni = and an unlabeled dataset { X i } mi = n +1 .
Revised: ni = and an unlabeled dataset { X i } mi = n +1 .

Original: In domain adaptation, we typically assume the labeled samples and unlabeled samples are drawn from a source P and target distribution Q that are similar but nonidentical.
Revised: In domain adaptation, we typically assume the labeled samples and unlabeled samples are drawn from a source P and target distribution Q that are similar but nonidentical.

Original: The goal of the learner is to find a prediction rule f : X → Y such that E Q (cid:2) ℓ ( f ( X ) , Y ) (cid:3) is minimized.
Revised: The goal of the learner is to find a prediction rule f : X → Y such that E Q (cid:2) ℓ ( f ( X ) , Y ) (cid:3) is small.

Original: This goal is impossible without additional assumptions restricting the differences between P and Q .
Revised: This goal is impossible without additional assumptions restricting the differences between P and Q .

Original: In light of the available data, a natural assumption is covariate shift:
Revised: In light of the available data, a natural assumption is covariate shift:

Original: E P (cid:2) Y | X = x (cid:3) =
Revised: E P (cid:2) Y | X = x (cid:3) =

Original: E Q (cid:2) Y | X = x (cid:3) .
Revised: E Q (cid:2) Y | X = x (cid:3) .

Original: The standard approach to this problem is importance weighing [43].
Revised: The standard approach to this problem is importance weighing [43].

Original: It is based on the observation that
Revised: It is based on the observation that

Original: [Equation]
Revised: [Equation]

Original: where w ( x ) ≜ dQ X dP X ( x ) is the likelihood ratio between the marginal distribution of inputs in the target and that in the source domains.
Revised: where w ( x ) ≜ dQ X dP X ( x ) is the likelihood ratio between the marginal distribution of inputs in the target and that in the source domains.

Original: It is possible to estimate w from the inputs in the labeled and unlabeled datasets [44], which allows the learner to estimate the right side of (G.1).
Revised: It is possible to estimate w from the inputs in the labeled and unlabeled datasets [44], which allows the learner to estimate the right side of (G.1).

Original: It is known that many instances of algorithmic bias are caused by distribution shift between the training data and real-world data encountered by the model during deployment.
Revised: It is known that many instances of algorithmic bias are caused by distribution shift between the training data and real-world data encountered by the model during deployment.

Original: Broadly speaking, research has identified two types of algorithmic bias caused by distributional shifts [1]:
Revised: Broadly speaking, research has identified two types of algorithmic bias caused by distributional shifts [1]:

Original: the model is trained to predict the wrong target; 2.
Revised: the model is trained to predict the wrong target; 2.

Original: the model is trained to predict the correct target, but its predictions are inaccurate for demographic groups that are underrepresented in the training data.
Revised: the model is trained to predict the correct target, but its predictions are inaccurate for demographic groups that are underrepresented in the training data.

Original: In statistical terms, the first type of algorithmic bias is caused by posterior drift between the training and real-world data.
Revised: In statistical terms, the first type of algorithmic bias is caused by posterior drift between the training and real-world data.

Original: This leads to a mismatch between the model’s predictions and the correct values of the target in the real world.
Revised: This leads to a mismatch between the model’s predictions and the correct values of the target in the real world.

Original: The second type of algorithmic biases arises when ML models are trained or evaluated in non-diverse training data, so the models perform poorly on underserved groups.
Revised: The second type of algorithmic biases arises when ML models are trained or evaluated in non-diverse training data, so the models perform poorly on underserved groups.

Original: In statistical terms, this type of algorithmic bias is caused by covariate shift between the training and real-world data.
Revised: In statistical terms, this type of algorithmic bias is caused by covariate shift between the training and real-world data.

Original: Several prior works study the effects of enforcing algorithmic fairness under distribution shift.
Revised: Several prior works study the effects of enforcing algorithmic fairness under distribution shift.

Original: Blum et al.
Revised: Blum et al.

Original: [45] consider the effects of enforcing demographic parity and equalized odds under two forms of distribution shift they call under-representation bias and labeling bias.
Revised: [45] consider the effects of enforcing demographic parity and equalized odds under two forms of distribution shift they call under-representation bias and labeling bias.

Original: Maity et al.
Revised: Maity et al.

Original: [34] consider the effects of enforcing group fairness in a domain generalization setting when there is subpopulation shift between the source and target domains.
Revised: [34] consider the effects of enforcing group fairness in a domain generalization setting when there is subpopulation shift between the source and target domains.

Original: Another line of work considers how fairness guarantees (instead of performance guarantees) transfer under distribution shift [5], [46], [47].
Revised: Another line of work considers how fairness guarantees (instead of performance guarantees) transfer under distribution shift [5], [46], [47].

Original: Singh et al.
Revised: Singh et al.

Original: [48] and Rezaei et al.
Revised: [48] and Rezaei et al.

Original: [49] consider both transferability of performance and fairness guarantees under covariate shift.
Revised: [49] consider both transferability of performance and fairness guarantees under covariate shift.