Home An optimal transport approach to estimating causal effects via nonlinear difference-in-differences
Article Open Access

An optimal transport approach to estimating causal effects via nonlinear difference-in-differences

  • William Torous EMAIL logo , Florian Gunsilius and Philippe Rigollet
Published/Copyright: August 5, 2024
Become an author with De Gruyter Brill

Abstract

We propose a nonlinear difference-in-differences (DiD) method to estimate multivariate counterfactual distributions in classical treatment and control study designs with observational data. Our approach sheds a new light on existing approaches like the changes-in-changes estimator and the classical semiparametric DiD estimator, and it also generalizes them to settings with multivariate heterogeneity in the outcomes. The main benefit of this extension is that it allows for arbitrary dependence between the coordinates of vector potential outcomes and includes higher-dimensional unobservables, something that existing methods cannot provide in general. We demonstrate its utility on both synthetic and real data. In particular, we revisit the classical Card & Krueger dataset, which reports fast food restaurant employment before and after a minimum wage increase. A reanalysis with our methodology suggests that these restaurants substitute full-time labor with part-time labor on aggregate in response to a minimum wage increase. This treatment effect requires estimation of the multivariate counterfactual distribution, an object beyond the scope of classical causal estimators previously applied to this data.

MSC 2010: 49Q22; 62D20; 62G05

1 Introduction

Difference-in-differences (DiD) estimators are among the most widely used approaches to estimate causal effects of discrete treatment interventions in observational data [14]. The classical setting we considered in this article is one in which the researcher observes the outcomes of interest in a group of treated units and a corresponding control group of untreated units over time, i.e., a binary treatment setting.[1] At one fixed point in time, the treatment group undergoes an intervention and stays treated thereafter. The fundamental problem consists of isolating the causal effect of this intervention from the existing natural trend that the treatment group undergoes irrespectively. The method of DiD achieves this under the assumption that the units in the control group have the same fundamental trend as the treated units would have without intervention. Under this assumption, the difference of the average outcome of the treated group between preintervention and postintervention periods net the difference of the control groups average outcomes preintervention and postintervention manages to isolate the true average causal effect of the intervention.

The arguably two most fundamental methods for estimating causal effects in this setting are the classical method of DiD [1,2,5] as described earlier and its generalization beyond average and aggregate effects, the changes-in-changes (CiC) estimator [6].

DiD is a linear approach designed to estimate average (or aggregate) causal effects [1,7] over all units within a group. This method can be proved to correctly identify counterfactuals under the “parallel trends” assumption [1,8,9] under which the average natural trend is assumed to be the same across both the control and treatment groups. This idea has been used in many areas of science where capturing the average treatment effect is sufficient to formulate informative causal conclusions. Recent applications include quantifying the effect of public health measures in response to COVID-19 [10] and estimating how irrigation farmers adapt their watering to fixed usage limits [11].

The classical linear DiD estimator only provides estimates of average and aggregate treatment effects. This can be limiting in many settings where treatment heterogeneity is important, i.e., where different units can react differently to the same level of intervention. The CiC estimator [6] addresses this issue for univariate outcomes. It extends the fundamental idea of the DiD estimator by estimating changes in the entire probability distribution of the respective units within a group. This permits the estimation of the entire counterfactual law of the treated units had they not received the treatment, hence allowing for a general form of heterogeneity in their response to treatment. The cost is a slightly stricter assumption on the evolution of the unobservable distribution as we specify below.

In its current form, the CiC estimator is only applicable in settings with univariate outcomes, as it relies heavily on the definition of quantile functions. This can be restrictive for modern applications where the outcomes of interest are often multivariate. Examples range from A/B testing in digital marketing campaigns where outcomes are a combination of features such as click-through rate, time-per-page, and so on, to measuring intervention effects such as gene knock down on a population of cells measured in high-dimensional gene space. In principle, the CiC estimator may be extended to higher dimensions through tensorization, which estimates treatment effects independently for each coordinate, but this solution fails to capture correlations that are often important in causal discovery. We demonstrate a simple linear setting with synthetic data where this is the case in Section 4.1.

Our contribution. We recast the CiC estimator using tools from the theory of optimal transportation. This perspective allows us to extend this methodology to handle multivariate observables after introducing novel structural assumptions on the natural trend underlying both treatment and control groups. In particular, we note that the causal model proposed in Athey and Imbens [6] readily implies that both populations, treatment and control, evolve between pretreatment and posttreatment periods via optimal transport maps (Theorem 2); our methodology relies on a natural higher-dimensional extension of this via optimal transport theory. In fact, we show that if the corresponding functions mapping the unobservables to the potential outcomes are cyclically comonotone, then the counterfactual distributions and causal effects can be estimated from data. In particular, this allows for the unobservable variables to be of the same dimension as the dimension of the outcome variables and not just univariate.

The counterfactual distributions can be estimated consistently from data using recent results from statistical optimal transport and implemented efficiently using recent advances in computational optimal transport [12]. We demonstrate the benefits of this extension by comparing it to the simple multivariate extension of the CiC estimator on both artificial and real data. As illustrated in Section 4.1, a tensorized version of CiC can be inconsistent and even estimate opposite correlation structures in the multivariate distribution of counterfactual outcomes. We also revisit the classical dataset of Card and Krueger [13], which has sparked an intense debate about the effects of raising the minimum wage on employment. Our ability to jointly handle the number of part-time and full-time workers as a bivariate outcome reveals an interesting substitution effect from the perspective of labor economics: When the minimum wage is raised, restaurants increase full-time labor and decrease part-time labor, suggesting a substitution effect.

2 The causal model behind the CiC estimator

2.1 The CiC model

We recall in this section the general causal model on which the classical DiD and CiC estimators are built, and which our model extends. See Figure 1 for illustration.

Figure 1 
                  Illustration of various maps in the space of measures. An arrow indicates a pushforward map between two measures; for example 
                        
                           
                           
                              
                                 
                                    P
                                 
                                 
                                    
                                       
                                          Y
                                       
                                       
                                          C
                                          ,
                                          1
                                       
                                    
                                 
                              
                              =
                              
                                 
                                    p
                                 
                                 
                                    #
                                 
                              
                              
                                 
                                    P
                                 
                                 
                                    
                                       
                                          Y
                                       
                                       
                                          C
                                          ,
                                          0
                                       
                                    
                                 
                              
                           
                           {{\mathbb{P}}}_{{Y}_{C,1}}={{\mathsf{p}}}_{\#}{{\mathbb{P}}}_{{Y}_{C,0}}
                        
                     . The maps 
                        
                           
                           
                              
                                 
                                    h
                                 
                                 
                                    j
                                 
                              
                           
                           {h}_{j}
                        
                      are the “production functions” linking the unobservables 
                        
                           
                           
                              ν
                           
                           \nu 
                        
                      and 
                        
                           
                           
                              
                                 
                                    ν
                                 
                                 
                                    *
                                 
                              
                           
                           {\nu }^{* }
                        
                      to the potential outcomes. A dashed arrow indicates a map from a measure to itself. 
                        
                           
                           
                              
                                 
                                    P
                                 
                                 
                                    
                                       
                                          Y
                                       
                                       
                                          T
                                          ,
                                          1
                                       
                                       
                                          †
                                       
                                    
                                 
                              
                           
                           {{\mathbb{P}}}_{{Y}_{T,1}^{\dagger }}
                        
                      is the counterfactual outcome measure of the treated units had they not received treatment. 
                        
                           
                           
                              p
                           
                           {\mathsf{p}}
                        
                      is the natural trend map and 
                        
                           
                           
                              T
                           
                           {\mathsf{T}}
                        
                      is map from an observed outcome to its counterfactual. The observable data is drawn from the four boxed measures.
Figure 1

Illustration of various maps in the space of measures. An arrow indicates a pushforward map between two measures; for example P Y C , 1 = p # P Y C , 0 . The maps h j are the “production functions” linking the unobservables ν and ν * to the potential outcomes. A dashed arrow indicates a map from a measure to itself. P Y T , 1 is the counterfactual outcome measure of the treated units had they not received treatment. p is the natural trend map and T is map from an observed outcome to its counterfactual. The observable data is drawn from the four boxed measures.

We first formalize a stochastic model for an experimental design in which two groups are measured before and after some intervention. Sampled from a larger population, each unit i in a realized experiment is characterized by four vector potential outcomes, their level of treatment received, and a set of time points at which potential outcomes were observed. This model includes randomized control trials with noncompliance and general observational studies. Adapting the notation of Athey and Imbens [6], we define an indicator random variable G i for a unit’s adopted treatment arm as well as random vectors Y i ; C , 0 and Y i ; C , 1 to model unit i ’s potential control group preintervention and postintervention outcomes observable when G i = 0 ; likewise Y i ; T , 0 and Y i ; T , 1 are the unit’s observable potential outcomes when G i = 1 . These potential outcomes are assumed to lie in a subspace of R d , and each unit has indicator random variables T i , 0 and T i , 1 denoting whether an outcome was observed in each study period.

We assume that each potential outcome vector is generated by a deterministic function of a latent random vector also in R d . While any given unit’s latent vector may change over time, the population distribution of continuous latent variables is time invariant. Furthermore, these latent distributions can differ arbitrarily between control and treatment arms. We denote this latent distribution ν for controls and ν for treated. Therefore, we write for control units the latent random vectors U i , t d ν , t = 0 , 1 and treated U i , t d ν . We can think of U i , t as capturing all of the intrinsic and unobservable characteristics of unit i , such as an employee’s skills and motivation, which influence the outcome of interest at time t , for instance, their salary. This assumption may be less appropriate in settings where external shocks could change the latent distributions over time. For instance, in a study measuring individuals’ opinion of the economy, a latent distribution of intrinsic perception reasonably shifts over time. Our model can accommodate exogenous noise through the assumption that latent U i , t is the additive perturbation of a unit’s time invariant baseline latent state μ i by a stationary noise process ε i , t . Correlation between these two terms is allowed as long as the distribution of realized latent variables is time invariant within each treatment arm. These latent variable assumptions are general enough to include many forms of mechanistic structure researchers may know about their population.

As Figure 1 illustrates, three global production functions h 0 , h 1 , and h 1 characterize the evolution of both treatment arms over time. At t = 0 , the treatment arms are assumed to have identical factors influencing the translation of a latent variable to observed potential outcome and thus share h 0 . For controls, h 1 describes any changes due the natural trend over evolving time. For treated units, h 1 captures both drift over time and the causal effect of interest. If h 1 ( h 0 1 ) exists, it describes exactly how any given control group unit evolves over time with a fixed latent state. We can therefore obtain a counterfactual outcome distribution with this function under an assumption that the treatment arm units would have evolved in the absence of treatment just as controls do. It is notable that this proposed model does not rely on additional information from observed covariates. As such, it does not require classical unconfoundedness assumptions. However, the question about the assignment mechanism in these DiD setups is a delicate one, see, for instance, studies by Ghanem et al. [14] and Marx et al. [15].

As units in the same treatment arm share a latent variable distribution, we define random vectors with the population distribution such that Y i ; C , 0 d Y C , 0 for all units such that G i = 0 . The random vectors Y C , 1 , Y T , 0 , and Y T , 1 are defined similarly for observations adopting the appropriate treatment arms. Each population-distributed random variable of potential outcomes induces a measure or law, which we will utilize in application of results from optimal transport theory. We adopt the notation P Y G , T for this measure. The action of each production function can be described as a pushforward of measure. For example, we write P Y C , 0 = h 0 # ν and P Y T , 1 = h 1 # ν . We make an assumption that both P Y C , 0 and P Y T , 0 are absolutely continuous with respect to Lebesgue measure. In Section 3.1, we discuss possible changes to our assumptions, which would allow our methodology to handle discrete outcomes at the cost of point identification of the counterfactual distribution. We note that the discrete case in general does not allow for point identification, which is already evident in the univariate setting, where Athey and Imbens [6] provide bounds on discrete counterfactuals. Our optimal transport framework illuminates this issue even further.

In addition, assuming that h 0 is invertible, we have ν = ( h 0 1 ) # Y C , 0 so that

(1) P Y C , 1 = ( h 1 h 0 1 ) # P Y C , 0 p # P Y C , 0 .

In the sequel, we will propose a class of production functions such that the multivariate counterfactual distribution for the treated, distributed as a random variable Y T , 1 , can be identified as follows:

(2) p # P Y T , 0 P Y T , 1 .

A consistent estimator for p and hence this counterfactual pushforward is presented utilizing optimal transport. Figure 1 shows that the production function h 1 , which generates postintervention outcomes for the treated, does not need to be specified to recover the map p and its counterfactual pushforward Y T , 1 . As discussed in Section 3.2, further assumptions on h 1 enable the treatment effect map T to be consistently estimated and allow for the estimation of nonlinear treatment effects.

2.2 Modeling the control group time trend

Given two measures P Y C , 0 and P Y C , 1 which can be estimated from control group data preintervention and postintervention, there exist infinitely many maps p such that P Y C , 1 = p # P Y C , 0 (1) holds. To identify a unique such map p , one must make additional assumptions on the causal model.

Recall that the source of randomness in the proposed causal model are latent random vectors U i , t , which can be thought of as summarizing a unit’s intrinsic characteristics. If we not only assume that the distribution ν of control group latent vectors is time invariant but further that the latent variables are constant over time (i.e., U i , 0 = U i , 1 for all control units i ), then we have Y i ; C , 1 = p ( Y i ; C , 0 ) ; this map can be estimated via multivariate regression from independent copies of the pair ( Y C , 0 , Y C , 1 ) . In many practical applications, pairs of potential outcomes ( Y i ; C , 0 , Y i ; C , 1 ) are observed, but in general, the assumption that U i , 0 = U i , 1 for all control units is more tenuous. Moreover, this setup leaves out an important class of problems where the units in the control group can differ between t = 0 and t = 1 . A canonical example arises in genomics where in single-cell RNA-Seq data each unit corresponds to a cell. Measuring the gene expression levels of a cell is a destructive process, and as a result, a given cell may be only measured once. Therefore, coupled potential outcomes of the form ( Y i ; C , 0 , Y i ; T , 1 ) are not available. Instead, one observes independent copies of Y C , 0 as well as independent copies of Y C , 1 . While difficult, this problem can be solved at the cost of additional assumptions on the natural trend p . This problem is sometimes referred to as uncoupled regression, and it arises in various applications, far beyond the genomics example described earlier [see, e.g., 1618].

In a setting with uncoupled scalar data, the map p is unique when it is monotone with known monotonicity (either increasing or decreasing). The CiC estimator enforces this by assuming both production functions, and therefore, h 1 h 0 1 are monotone increasing. In fact, the unique monotone increasing function p such that P Y C , 1 = p # P Y C , 0 is given by F 1 1 F 0 , where F t denotes the cumulative distribution function (CDF) of Y C , t for t = 0 , 1 . Estimation of p from data and plugging that estimator into equation (2) to yield an estimated counterfactual measure is the key idea of the CiC estimator. As previously noted, this estimator can be extended to multivariate outcomes through tensorization, which applies it independently to each coordinate. Joint structure between the coordinates is incompatible with the scalar distribution and quantile functions used in the estimator, as well as with the assumption of scalar production functions.

Recently, in the univariate setting, other approaches for modeling the control group time trend have been proposed, which generalize the “parallel trends” assumption to allow for general heterogeneity. These models in general make stronger or less interpretable assumptions than the monotone production functions of Athey and Imbens [6]. Callaway and Li [19] directly assume that the copulas between P Y C , 0 and P Y T , 0 as well as P Y T , 0 and P Y T , 1 are the same; Roth and Sant’Anna [8] assume that the pointwise differences between the corresponding cumulative distribution functions are equal, i.e., that F 1 ( x ) F 0 ( x ) = F 1 ( x ) F 0 ( x ) for all x R ; Bonhomme and Sauder [20] restrict the heterogeneity of the model to be additively separable and assume that the pointwise differences between the corresponding logarithms of the characteristic functions are equal. In the next section, we introduce cyclical comonotonicity, a natural extension of the monotonicity requirement in the study by Athey and Imbens [6] to multivariate settings, and hence, the multivariate notion of parallel trends closest to the framework of that work.

In the following section, we show that under the CiC model, the univariate natural trend map p is unique, and therefore identifiable as an optimal transport map between P Y C , 0 and P Y C , 1 . We leverage this insight to identify unique natural trend maps in higher dimensions under the same model. In particular, we propose an assumption of cyclically comonotonicity, a multivariate notion of monotonicity between the production functions, which extends the CiC estimator’s assumption of monotone increasing production functions.

3 Higher dimensional CiC

3.1 An optimal transport extension of the CiC estimator

Identifiability of the causal model presented in the previous section hinges on the uniqueness of the monotone increasing map p such that p # P Y C , 0 = P Y C , 1 . This uniqueness follows from a fundamental result in the theory of optimal transportation known as Brenier’s theorem.

Theorem 1

[Brenier, 21] Let P and Q be two probability measures defined over R d such that P is absolutely continuous with respect to the Lebesgue measure. Then, among all maps T : R d R d such that Q = T # P , there is a unique one, called the Brenier map denoted T ¯ , which is the gradient of a convex function. Furthermore, T ¯ is an optimal transport map in the following sense.

Let Γ denote the set of joint probability distributions of ( X , Y ) R d × R d such that X P and Y Q , then the optimal transport problem

(3) inf γ Γ x y 2 d γ ( x , y )

admits a unique solution γ ¯ such that ( X , Y ) γ ¯ if and only if X P and Y = T ¯ ( X ) , P -almost surely.

For d = 1 , a map T is the gradient of a convex function if and only if it is nondecreasing. The quantile map F Y C , 1 1 F Y C , 0 has the appropriate domain and range measures and is nondecreasing by the properties of CDFs; therefore, it is the unique optimal transport solution.

Theorem 1 demonstrates that the structural properties of the univariate CiC model can be extended to higher dimensions by leveraging the theory of optimal transportation. In particular, the Brenier map is unique and hence identifiable between pairs of sufficiently regular measures in R d . We therefore introduce regularity assumptions on the production functions h , in the model, which imply that the optimal drift is the Brenier map between P Y C , 0 and P Y C , 1 . The counterfactual distribution P Y T , 1 in Figure 1 can be identified by first estimating the unique natural trend p between the observable measures P Y C , 0 and P Y C , 1 in the control group and then applying that transformation to the treatment group preintervention potential outcome measure P Y T , 0 .

For our main result, we assume that all four the potential outcome measures P Y , and the counterfactual measure P Y T , 1 are absolutely continuous with respect to the Lebesgue measure. This assumption for preintervention measures is needed to apply Theorem 1, and for the postintervention measures, it helps enable identification. To satisfy technical assumptions on the regularity of the optimal transport problem that often arise in classical results [22], we enforce through Assumption 1 that measures are supported on convex sets. Furthermore, if the support K 0 of P Y T , 0 is not contained in the support K 0 of P Y C , 0 , one cannot infer the counterfactual distribution P Y T , 1 at the parts of K 0 that fall outside K 0 without extrapolation via structural assumptions. This restriction on the supports is a standard assumption that prevents the need for extrapolation [6]. We summarize our structural assumptions as follows:

Assumption 1

The observable measures P Y C , t , P Y T , t , t = 0 , 1 , and the counterfactual measure P Y T , 1 are supported on proper convex subsets K t , K t , and K 1 of R d and are absolutely continuous with respect to Lebesgue measure. Moreover, K 0 K 0 .

When p is an optimal transport map, Theorem 1 implies that p is the gradient of a convex function. Recall that in higher dimensions, gradients of convex functions from R d R are cyclically monotone [23, Theorem 24.8]. A map T : R d R d is cyclically monotone if for any positive integer m and any cycle u 1 , , u m , u m + 1 u 1 in its domain, it holds

(4) i = 1 m u i , T ( u i ) T ( u i + 1 ) 0 .

Therefore, the natural trend map is identifiable when it is cyclically monotone. For m = 2 , equation (4) reduces to the simple notion of multivariate monotonicity defined as follows:

(5) u 1 u 2 , T ( u 1 ) T ( u 2 ) 0 .

Furthermore, in the univariate case, these two definitions are equivalent; in the CiC model, this implies that the monotone map h 1 h 0 1 is also cyclically monotone, which explains why the assumption of monotonicity of the functions h in the unobservable is sufficient.

In the context of our latent model, the monotonicity assumption on the production functions for the CiC estimator implies that larger values of the unobservable latent variable correspond to strictly larger potential outcomes. This is a common assumption in economic models [2426], but can be restrictive in some settings. For instance, consider a classroom experiment where the treatment variable is class size and the outcomes of interest are standardized test scores before the intervention and 5 years after. Monotone production functions imply that individuals with higher unobserved ability U will receive strictly higher test scores. Specifically, the assumption of being able to rank individuals in terms of one univariate unobservable U is a strong restriction.

A careful inspection of the data generating process reveals that monotone assumptions on the production functions allow the latent variable to be entirely abstracted away. This actually follows from the weaker notion of comonotonicity such that h 0 , h 1 : R d R d are comonotone if h 0 ( x ) h 0 ( y ) , h 1 ( x ) h 1 ( y ) 0 for all x , y R d . Note that with an identity production function, comonotonicity reduces to classical monotonicity. To get a sense of the strength of this relaxation, consider univariate differentiable functions. In this case, comonotonicity implies locally that their derivatives h 0 h 1 0 have the same sign and furthermore imposes additional global constraints. As a concrete example, if h 0 is a polynomial production function and h 1 its pointwise scaling by some γ > 0 , then this pair of functions is comonotone because they have the same sign between all zeros, and hence, the same signed difference between any pair of points. This example emphasizes that h 0 and h 1 need not be individually monotone themselves.

We have now seen that that the monotone production functions assumption in Athey and Imbens [6] implies that the natural trend is cyclically monotone, which enables identification of the counterfactual. Furthermore, the production functions are comonotone, which allows the model to include general latent space distributions. However, these two functional assumptions only collapse to monotonicity in the scalar case. To extend their model to higher dimensions, we propose an assumption of cyclically comonotone production functions, which achieves both these desired properties.

Definition 1

Two production functions h 0 and h 1 are cyclically comonotone if for any positive integer m and any cycle u 1 , , u m , u m + 1 = u 1 in their common domain, it holds

(6) i = 1 m h 0 ( u i ) , h 1 ( u i ) h 1 ( u i + 1 ) 0 .

Just as cyclical monotonicity collapses to monotonicity when m = 2 , cyclical comonotonicity collapses to comonotonicity in that case. Whenever h 0 has an inverse h 0 1 , condition (6) implies the map p = h 1 h 0 1 is also cyclically monotone. This result is shown in the proof of Theorem 2, which we will state shortly. By Theorem 1, p is the unique Brenier map such that P Y C , 1 = p # P Y C , 0 .

Cyclical comonotonicity is one of the several concepts to extend comonotonicity to higher dimensions. One set of extensions imposes a total ordering on the outcome space; however, these imply that the copula of outcomes preintervention and postintervention are identical, a strong assumption on the causal model. Note that the tensorized CiC assumes this shared copula structure. More recently, optimal transportation theory has been used to propose other multivariate notions of comonotonicity. A particular contribution is μ -comonotonicity from Ekeland et al. [27]. Similar to our model, the authors assume a latent variable and production functions mapping it to potential outcomes. Both production functions h 0 and h 1 are assumed to have optimal transport structure, as they lie in the graph of a gradient of a convex function. In general, the composition of optimal transport maps, such as h 1 h 0 1 , is not an optimal transport map, except in special circumstances [28]. Puccetti and Scarsini [29] provide an overview of these ideas.

Cyclical monotonicity is a natural extension of monotonicity to multivariate settings with many uses in economic theory and mechanism design [30,31], econometrics [32,33], and statistics [34]. Cyclical comonotonicity is even weaker than this, as it does not imply that each production function itself is cyclically monotone, which makes it a natural and weak extension of the monotonicity assumption in the univariate setting. In particular, it is weaker than the assumption that individuals can be ranked in terms of a univariate unobservable variable (ability in the classroom example) and that this ranking persists in the observed outcome distribution. We argue that this makes it a more natural assumption than the monotonicity assumption of the CiC estimator in practical settings. Examples of cyclic monotonicity in causal inference have been highlighted by Chernozhukov et al. [33], Shi et al. [32], and Gunsilius [35], among many others. More fundamentally, Rochet [31] shows that the maximizer of quasi-linear utility functions is cyclically monotone. For a concise survey, we refer to the study by Galichon [36].

From a practical perspective, cyclical comonotonicity is an important weakening of cyclic monotonicity in that it allows for unobservables of general dimension in practice. Allowing for multivariate unobserved heterogeneity in general causal models has been a long-standing challenge: in most models, the unobservable U i , t is required to be univariate [6,24,26]. By relying on the concept of cyclical comonotonicity, we can relax this assumption by only requiring that the unobservable is of the same dimension as the observable variable. Note that even this can be relaxed by using recent advances in optimal transport theory [37]. The cost of this relaxation is a more complicated model and definitions from geometric measure theory like the area and coarea formula, which is why we focus on the simpler setting of unobservables of the same dimension in this article.

3.1.1 Discrete outcome distributions

Mirroring the univariate setting [6], our methodology does not guarantee a point identified-counterfactual distribution when outcomes are discrete valued. Theorem 1 guarantees a unique control group natural trend with optimal transport structure when the measure of preintervention outcomes is absolutely continuous with respect to the Lebesgue measure. Indeed, unique optimal transport maps between discrete measures need not exist. For illustration, consider transporting a measure distributed on vertices of the unit square with equiprobability at each main diagonal vertex to a one with equiprobability at the antidiagonal vertices. With respect to squared distance, it is equivalent to transport the mass between vertical and horizontal pairs of vertices. Furthermore, it is admissible to split mass and transport 0.25 probability mass from each main diagonal vertex to each antidiagonal vertex. This solution with fractional structure is an example of a nondeterministic optimal transport plan (cf. deterministic optimal transport maps), which can be interpreted as a probabilistic assignment rule. Discrete-valued optimal transport problems often have a minimum cost achieved by multiple probabilistic plans but no deterministic maps. This reality implies that point-identification in the discrete case need not be possible in general without restrictive further assumptions.

This optimal transport view hence also explains the lack of point-identification in the univariate setting, matching the conclusions of Athey and Imbens [6]. The extension of CiC to discrete outcomes in that setting provides bounds on the counterfactual outcome distribution due to the same challenges described earlier. Their estimator for that case is heavily dependent on notions of quantile functions without a direct multivariate extension. Identification only becomes possible with additional assumptions about conditional independence and exogenous covariates, which the authors admit are restrictive. In the discrete multivariate setting, similar partial identification results are possible through carefully application of recent developments in optimal transport theory. For example, Auricchio and Veneroni [38] bound the supremum cost of moving any single point mass in p -cost transport problems. With one possible counterfactual distribution identified by a solution to the minimization, uniform bounds can then be found by applying the aforementioned bound on the possible pointwise deviation. Pointidentification can also be reestablished in a similar manner to the univariate setting by introducing additional information from covariates under strong assumptions. The focus of this article is to introduce an optimal transport framework for pointidentification, which is why we focus on the case of absolutely continuous measures throughout.

3.2 Identification of causal effects in the multivariate setting

On the basis of the extensions of the causal model introduced in the previous sections, we can formally state the identification result for the counterfactual distribution of the treated units had they not received treatment.

Theorem 2

Consider the causal model depicted in Figure 1. Let Assumption 1hold. Moreover, assume that the production function h 0 has a well-defined inverse and that h 0 and h 1 are cyclically comonotone in the sense of (6). Then there exists a unique map p : K 0 K 1 . It is the Brenier map from P Y C , 0 to P Y C , 1 . The counterfactual distribution P Y T , 1 of the treated unit had it not received treatment is then identified via P Y T , 1 = p # P Y T , 0 .

The proof of Theorem 2 is presented in Appendix A.1. Another potential quantity of interest is the actual counterfactual random variable Y T , 1 . Identifying this quantity requires more structure in the model. Indeed, in the setup of the causal model represented in Figure 1, we only have that P Y C , 1 = p # P Y C , 0 but not necessarily that Y C , 1 = p ( Y C , 0 ) because we do not assume[2] that U i , 0 = U i , 1 for all units. However, assuming that both h 1 and h 1 are cyclically comonotone allows to identify Y T , 1 , which follows from the fact that T : K 1 K 1 will be identified for the fixed unobservable U i , 1 for treated units.

Corollary 1

Consider the setting and assumptions from Theorem 2. If the production function h 1 has a well-defined inverse and h 1 and h 1 are cyclically comonotone, then there exists a unique map T : K 1 K 1 such that P Y T , 1 = T # P Y T , 1 . T is the Brenier map from P Y T , 1 to P Y T , 1 . Y T , 1 is then identified via Y T , 1 = T ( Y T , 1 ) .

The assumption that h 1 and h 1 are cyclically comonotone can be hard to satisfy in practice, which is why the main parameter of interest is the counterfactual law P Y T , 1 and not the random variable Y T , 1 . It is worth noting that having cyclically comonotone pairs h 1 and h 1 as well as h 0 and h 1 does not necessarily imply h 1 and h 0 are cyclically comonotone.

In general, the assumptions of our model match those in Athey and Imbens [6] when outcomes are scalar and extend their structure in higher dimensional cases. Our production function setup illustrated in Figure 1 exactly matches that of CiC. In the scalar case, our assumption of comonotone production functions reduces to monotone production functions; although this is weaker than CiC’s requirement that h 0 and h 1 are strictly monotone, the requirement of Theorem 2 that h 0 has a well-defined inverse restricts that preintervention production function to be strictly monotone as well. In one dimension, a strictly monotone and a weakly monotone production function pair remains cyclically comonotone, so our model does provides a relaxation of the control group outcome generation process. Here, it is the assumption that h 0 has an inverse, which forces the production functions to be themselves monotone, as contrasted by our previous example of two positively proportional polynomials being comonotone. In higher dimensions, however, the invertibility of h 0 does not imply that both h 0 and h 1 are themselves cyclically monotone. If this were the case, then both production functions would be optimal transport maps, which can be seen by considering cyclical monotonicity as the special case of cyclical comonotonicity when h 0 is the identity. This is precisely the notion μ -comonotonicity introduced by Ekeland et al. [27].

For the latent distributions, our extension retains the time invariance within groups assumption of CiC. While we do not make the same assumption of nested latent supports ν ν as Athey and Imbens [6], our assumption that K 0 K 0 is equivalent. To see why note that both treatment arm share the same preintervention production function h 0 . Our assumption that the support sets are convex is an additional requirement not needed for CiC but necessary to apply theoretical results about multivariate optimal transport. Athey and Imbens [6] allow for an additional case with discrete latent distributions, but our assumption that h 0 is invertible with a continuous co-domain implies that the latent variable measures must be continuous.

3.2.1 Examples of functionals that can be analyzed with the proposed method

One of the advantages of the method is to deal with multivariate outcome distributions. Many functionals of interest in different areas of the (social) sciences are based on the information of the joint distribution of several outcomes of interest, from social inequality [3941] to risk management [42,43] to decision theory [44], to name a few.

More generally, the proposed estimator provides consistent estimates of functionals that fundamentally rely on the copula structure of the outcome distributions. Examples of this are multivariate stochastic dominance [45], multivariate risk [46], and functionals that encompass interrelation between random variables such as mutual information or correlation. We say that a distribution F dominates another distribution G in the α -th order, written as F G if D α F ( x ) D α G ( x ) , where

D 1 F ( x ) F ( x ) and D α = S ( x ) D α 1 ( t ) d t ,

with S ( x ) { y R + d : y x } , see the study by García-Gómez et al. [45] for details. An example of a multivariate risk measure is the multivariate lower-orthant value-at-risk at level α [ 0 , 1 ] of a multivariate increasing function G , which is defined as follows [46]:

VaR ̲ α ( G ) = { x R d : G ( x ) α } ,

where A denotes the boundary of the set A . An analogous definition holds for the upper-orthant counterpart. The mutual information I ( X , Y ) of two random variables X and Y is defined as follows [47]:

I ( X , Y ) = KL ( P X , Y P X P Y ) ,

where KL is the Kullback–Leibler divergence and P X P Y is the independence coupling.

The aforementioned examples are only a short list of potentially interesting functionals one can analyze using the proposed method. All of these functionals rely on the information of the corresponding copula structure, which cannot be identified with a tensorized version of the CiC estimator unless in the limited setting of completely independent coordinates described previously.

3.3 Estimation from observed data

In practice, we only observe observations from each of the four distributions P Y C , 0 , P Y C , 1 , P Y T , 0 , and P Y T , 1 . To distinguish between population measures and empirical measures, we define the corresponding empirical measures of P Y C , 0 as μ ˆ 0 , n , of P Y C , 1 as μ ˆ 1 , l , and of P Y T , 0 as μ ˆ 0 , m with corresponding sample sizes n , l , m . We denote the estimator of the counterfactual P Y T , 1 by μ ˆ 1 , m . Estimating Brenier maps from data is a subject of intense activity both from theoretical and practical angles [4857]. Further details about estimating Brenier maps from data can be found in Appendix B. In this section, we state propositions about the consistency of the estimated counterfactual distribution and its rate of convergence in expected Wasserstein distance to the population distribution. The 2-Wasserstein distance between measures μ and ν , which we denote as W 2 ( μ , ν ) , is the square root of the infimum transportation cost (3) between the two measures. Proofs of these propositions are deferred to Appendix A.

The observations form empirical measures μ ˆ 0 , n , μ ˆ 0 , m , and μ ˆ 1 , l with n , m , and l denoting the respective sample sizes. These samples are assumed to be mutually independent. An estimator for the natural trend, p ˆ is a minimizer of W 2 ( μ ˆ 0 , n , μ ˆ 1 , l ) . A plug-in estimator for the counterfactual distribution is given by p ˆ # μ ˆ 0 , m . However, p ˆ is nontrivially defined only on the support of μ ˆ 0 , n . Therefore, in practice, we project μ ˆ 0 , m onto the support of μ ˆ 0 , n through one-nearest neighbor Euclidean matching, itself a 2-Wasserstein optimal transport problem. The “rounded” measure of treatment outcomes preintervention is denoted μ ˜ 0 , m . This leads to our proposed estimator for the counterfactual distribution: p ˆ # μ ˜ 0 , m μ ˆ 1 , m .

Under the assumptions on population measures stated in Assumption 1, the Wasserstein distance between the estimated and population counterfactual distribution converges uniformly to zero. This enables a consistency statement about that distance converging to probability to zero, as well as a stronger statement about the Wasserstein distance of the estimated and population natural trend maps.

Proposition 1

Under the conditions of Assumption 1,

limsup min ( m , n ) K 0 p ˆ ( x ˜ ) p ( x ) P Y T , 0 ( d x ) = 0 .

Furthermore, the squared 2-Wasserstein distance of the empirical natural trend map, W 2 2 ( μ ˆ 0 , m , μ ˆ 1 , m ) , converges in probability to the distance from preintervention samples to their population counterfactual, W 2 2 ( μ ˆ 0 , m , P Y T , 1 ) .

Under mild further assumptions, we show that the expected 2-Wasserstein distance between the population and estimated counterfactual measures converges to 0 at a O ( min ( m , n ) 1 d ) rate.

Assumption 2

The convex support K 0 is compact, and in addition, the Radon–Nikodym derivative f d P Y T , 0 d P Y C , 0 of μ 0 with respect to μ 0 is bounded.

Combining these assumptions with those previously stated for consistency under Assumption 1 yields the following claim.

Proposition 2

The expected 2-Wasserstein distance between μ ˆ 1 , m and P Y T , 1 converges to 0 at a O ( min ( m , n ) 1 d ) , that is,

E P Y C , 0 , P Y T , 0 , P Y C , 1 W 2 ( μ ˆ 1 , m , P Y T , 1 ) = O ( min ( m , n ) 1 d ) .

Obtaining the large sample distribution of optimal transport maps is largely an open problem. However, rates of convergence are known [50,57], which enables inference on these functionals through subsampling methods. Under mild assumptions (e.g., those in [5860]), subsampling theory provides confidence regions and hypothesis tests with strong asymptotic guarantees. Even if the rate of convergence for the functional is unknown, that rate may still be estimated.

4 Numerical experiment and application to the Card and Krueger dataset

In this section, we demonstrate the performance of the optimal transport-based estimator with two numerical experiments and apply it to a classical causal inference dataset.

4.1 A stylized example

We first present a simple simulation experiment, which demonstrates that improper modeling of dependency between coordinates of multivariate outcomes can lead to highly biased estimates. In particular, our proposed method manages to estimate the correct bivariate counterfactual distributions, while the multivariate extension of the CiC estimator through tensorization does not. Consider the following set of linear production functions in which map latent vectors in R 2 to outcomes without intervention in R 2 :

h 0 ( u ) = 1 α α 1 u and h 1 ( u ) = 1 α α 1 u .

These production functions are a cyclically comonotone but not element-wise monotone as required for the CiC estimator. Choosing beta distributions as the laws of the latent variables, we generate n = 3,000 independent outcomes from the control population before and after the intervention, as well as from the treatment group before the intervention and its unobserved counterfactual. Further details about the implementation can be found in Appendix C.1.

The recovered marginals in Figure 2 and the kernel density estimator (KDE) of the counterfactual joint distribution in Figure 3 demonstrate that our methodology estimates the true counterfactual distribution almost exactly, while the CiC estimator cannot. Notably, the CiC estimator recovers a joint distribution with a mirrored dependence structure.

Figure 2 
                  Recovery of counterfactual marginals by OT and CiC. (a) First marginal and (b) second marginal.
Figure 2

Recovery of counterfactual marginals by OT and CiC. (a) First marginal and (b) second marginal.

Figure 3 
                  KDE plots of the distribution of counterfactual outcomes for the treatment group. The first covariate increases along the horizontal axis and the second along the vertical. KDE bandwidth = 0.5. (a) True CF, (b) OT estimate, and (c) CiC estimate.
Figure 3

KDE plots of the distribution of counterfactual outcomes for the treatment group. The first covariate increases along the horizontal axis and the second along the vertical. KDE bandwidth = 0.5. (a) True CF, (b) OT estimate, and (c) CiC estimate.

As previously noted, the tensorized CiC estimates counterfactuals under the strong assumption that the copula of outcomes preintervention and postintervention are identical. Each coordinate of the potential outcomes vectors is assumed to be a monotone increasing function of the latent random vector’s corresponding coordinate. When there are interactions between latent coordinates during potential outcome generation, the multivariate CiC will not identify counterfactual distributions. We believe that proper accounting for correlation structures contributes to our seemingly novel substitution result when reanalyzing the classical minimum wage data from Card and Krueger [13] in Section 4.3.

4.2 Numerical experiment in higher dimensions

In the following numerical experiment, we consider the performance of our estimator against the multivariate tensorized CiC estimator as the dimensionality of the observations grows. Optimal transport’s strong recovery of higher-dimensional joint distributions, illustrated by Figure 4, distinguishes it.

Figure 4 
                  True and estimated eCDF quantiles for counterfactual treatment individuals, 
                        
                           
                           
                              D
                              =
                              50
                           
                           D=50
                        
                     .
Figure 4

True and estimated eCDF quantiles for counterfactual treatment individuals, D = 50 .

Recall from Theorem 1 that optimal transport maps can be characterized as the gradients of convex functions. Consider the function f ( x , y ) = x 2 y 1 , which is convex when y > 0 . As the sum of convex functions is convex, summing f evaluated at multiple pairs of coordinates in a random vector constructs a convex function from R d to R . Formally, we consider a class convex functions g ( x ; θ ) = i = 1 p x ( i 1 ) 2 x ( i 2 ) 1 , where x R + + d , x ( i ) represents the i th coordinate of x , and i j [ [ d ] ] for j { 1 , 2 } ; the parameter θ contains the p pairs of indices to be compared. The gradient of g is straightforward to compute. In this simulation, we specify h 0 to be the identity and h 1 to be g . There are d coordinate pairs randomly selected each run. Both treatment arms have n = 3 , 000 units drawn from beta latent distributions. Further implementation details can be found in Appendix C.2.

Our experiment is designed to quantify how well the two methods estimate a joint counterfactual distribution. For computational reasons, we focus on randomly selected pair-wise coordinate interactions. To this end, we construct the eCDF of the true counterfactual, its optimal transport estimate, and its CiC estimate over a uniform mesh of 10,000 points. We compute the mean absolute difference between the true and estimated eCDFs over each point in the mesh and have 20 runs per trial. As demonstrated in Figure 4, our proposed method better estimates the quantiles of a plane in the outcome space. Table 1 shows that optimal transport has a mean absolute difference consistently smaller than CiC with a smaller standard deviation as well. Our method’s monotone increasing loss likely occurs due to the curse of dimensionality and the difficulty of matching vectors in very high dimensions with only 3,000 samples. Regardless, optimal transport still has substantially smaller MAD and standard deviation than CiC when d = 100 .

Table 1

Mean absolute deviation of the estimated counterfactual CDF to the true one. eCDFs are evaluated over one randomly selected plane per run

Dimension 2 10 20 50 100
OT MAD 0.0006 0.0017 0.0019 0.0033 0.0037
st. dev. 0.0003 0.0011 0.0016 0.0027 0.0055
CiC MAD 0.0083 0.0104 0.0092 0.0088 0.0090
st. dev. 0.0055 0.0078 0.0074 0.0073 0.0125

4.3 Revisiting the Card and Krueger dataset

On April 1, 1992, New Jersey raised its minimum wage from the Federal level of $4.25 per hour to $5.05 per hour. Card and Krueger [13] (CK henceforth) investigated the effect this increase had on employment in fast food restaurants with a case–control experimental design, taking the bordering region of eastern Pennsylvania, where the minimum wage remained at $4.25, as a control group. The original study employs the standard DiD estimator to conclude that the higher minimum wage led to increased employment in New Jersey restaurants. This result spawned much debate within the economics community about the effect of minimum wage policies on employment (e.g., Neumark and Wascher [61], Dube et al. [62], Meer and West [63], Neumark et al. [64], and the references therein).

The treatment effect of interest in CK and many subsequent reevaluations is the change in full-time equivalent employees (FTE), which is defined via FTE = FT + 0.5 PT , where FT (PT) is the number of full-time (part-time) employees [61,65]. We use the proposed multivariate extension of the CiC estimator to estimate a bivariate treatment effect in terms of full- and part-time employees, hence fully dissecting the causal effect of raising the minimum wage on these subgroups.

We analyze the number of full- and part-time employees as drawn from an underlying continuous distribution. In the original CK data, “there are 28 records that report fractional full-time employees (the fraction is always one-half), 29 records that report fractional numbers of part-time employees, and one record that reports a fractional number of managers” [66]. These partial observations could represent ambiguity in the classification of a worker as full- or part-time (Alan Krueger via interview reported in by Ehrenberg et al. [66]). As the restaurant employee responding to the phone interview was not necessarily the same at both measurements, Neumark and Wascher [61] argue, “there is no reason to believe that the responses in the first and second waves are based on the same ‘definition’ of employment.” Therefore, these fractional observations can also be considered a degree of belief statement. As discussed earlier, deterministic optimal transport maps are the unique solution in the continuous case while the discrete case also admits probabilistic optimal transport plans as solutions. In practice, we use a linear program implemented in the Python package POT which finds a deterministic plan, matching the structure of our theoretical results.

The original CK study finds a positive average treatment effect of 2.76 FTE jobs added in the treatment group compared to the control group, a result reproduced by Neumark and Wascher [61] using different methodology. Neumark and Wascher [61] also compute an average treatment effect in full- and part-time jobs with separate regressions and find treatment effects of 3.16 gained full-time jobs and 0.60 lost part-time jobs. These classical contributions only focus on aggregate outcomes over all restaurants, irrespective of the size of the respective restaurant. An exception is Ropponen [67] who reanalyzes the data with the CiC estimator, taking into account the heterogeneity in the size of the fast-food restaurants. He finds the average treatment effect bounded in [0.90, 1.70]. Ropponen also notes in New Jersey that large restaurants preintervention (measured in FTE employees) have a negative treatment effect, while small restaurants preintervention have a positive treatment effect. Our analysis recovers this trend for both FT and PT employees in New Jersey. As we also generate counterfactual controls, we find an opposite trend for Pennsylvania restaurants. This opposite trend is intriguing and worth exploring further as it does not seem to be explained by substitution effects of employees moving across the state line to find jobs (Table 2).

Table 2

Estimated average treatment effect on full- and part-time employment by method with subsampled 95% confidence intervals

OT CiC DiD
ATE FT 3.07 (2.00, 4.67) 2.61 (0.40,3.45) 3.45 (3.05,5.46)
ATE PT 1.79 ( 3.43 , 0.33 ) 1.52 ( 3.46 , 0.51 ) 1.00 ( 2.07 , 1.15 )

The previously discussed subsampling approach to inference was applied to generate symmetric 95 % confidence intervals around each point estimate. The only interval to contain zero is for the DiD treatment effect on part-time employment. Furthermore, we run subsampled hypothesis tests to check whether the point estimates are significantly different across estimators. Of the four tests between optimal transport to an alternative, only the difference in treatment effect on part-time employment estimated with CiC was not significantly different from zero at the p = 0.05 level. For both the confidence intervals and hypothesis tests, we use a block size of 300 and 10,000 replications.

The average treatment effects estimated using the OT and CiC counterfactual distributions depend only on the marginals, not the full joint structure. However, as illustrated in Figure A3 in Appendix, the strong copula assumptions between preintervention and postintervention periods for CiC can lead to markedly different estimated marginals. That structure implies restaurants with the largest preintervention full/part-time employment will also have the largest counterfactual full/part-time employment. The wider tails of the CiC treatment effect marginals compared to OT suggest that additional joint structure in this setting leads to counterfactuals with less variance from the observed potential outcome.

The proposed multivariate extension of the CiC estimator allows us to jointly estimate the effects on full- and part-time employment while accounting for the heterogeneity in restaurant size. For the results in this section, restaurants are represented in R 2 by our outcomes of interest, the number of full- and part-time employees. In Appendix, we provide an additional experiment with restaurants represented as higher dimensional vectors including additional measurements about wages, prices, and operations. We discard 19 units with missing outcomes, leaving 76 control and 315 treatment restaurants. The transport plans for both groups are solved with a linear program, and we apply nearest neighbor matching between treatment and control preintervention samples to calculate counterfactual outcomes.

Our optimal transport analysis suggests that fast food restaurants responded to an increased minimum wage by substituting full-time employees for part-time ones with a net gain of FTEs. Our results seem to indicate that the negative effect on part-time employees is more pronounced than previously estimated. The quantile plot in Figure 5 suggests this effect applies throughout the distribution of restaurants, not just the mean: fixing the number of full-time employees, counterfactual quantiles tend to have more part-time employees than treatment group quantiles at the same level; likewise fixing the number of part-time employees, treatment group quantiles tend to have more full-time employees. In their original paper, CK suggest that restaurants may respond to higher labor costs with more full-time employees because they tend to be older, more skilled, and more productive, thus a better investment of capital. Furthermore, the univariate methods may underestimate the number of part-time employees lost, a conclusion supported by the higher dimensional analysis in Table A3 in Appendix.

Figure 5 
                  Postintervention quantile curves for observed treatment group units and their counterfactuals.
Figure 5

Postintervention quantile curves for observed treatment group units and their counterfactuals.

5 Discussion

We have introduced a general method based on optimal transport theory for causal inference in observational treatment and control study designs. It combines two desirable properties: it is designed for multivariate settings while at the same time capturing the heterogeneity in treatment response of individuals. In particular, it complements both the classical DiD estimator, which is applicable in multivariate settings but only captures average effects, and the CiC estimator [6], which allows for general treatment heterogeneity but is only applicable in univariate settings.

Showcasing the utility of the proposed method, we revisit the classical Card and Krueger dataset by decomposing the treatment effects for full-and part-time employees. We find that fast-food restaurants responded to an increased minimum wage by substituting full-time employees for part-time employees, even when accounting for restaurant size. This provides a novel insight by dissecting the relationship between full- and part-time employees while accounting for the heterogeneity in restaurant size. More generally, since our proposed method is able to consider multivariate outcomes, it can help uncover interesting causal effects and nonlinear relations in a wide array of applications.


# A previous version was titled “An optimal transport approach to causal inference.”


  1. Funding information: William Torous was supported as an undergraduate through MIT’s UROP program with funding from the Lord Foundation and the Paul E. Gray UROP Fund. Florian Gunsilius was supported by a MITRE faculty research award. Philippe Rigollet was supported by NSF grants IIS-1838071, DMS-2022448, and CCF-2106377.

  2. Author contributions: All authors have accepted responsibility for the entire content of this manuscript and approved its submission.

  3. Conflict of interest: The authors state no conflict of interest.

  4. Data availability statement: The datasets analyzed during the current study are available at David Card’s public website, https://davidcard.berkeley.edu/data_sets.html.

  5. Code availability statement: Code to reproduce the results of this paper and software implementations of our methodology in Python, R, and STATA are available at otcic.com.

Appendix A Proofs of stated results

For compactness and clarity, we use a different notation for measures in these proofs than in the main text. For control group outcomes, P Y C , 0 is equivalent here to μ 0 and P Y C , 1 is equivalent to μ 1 . For the treated, P Y T , 0 is equivalent to μ 0 and P Y T , 1 is equivalent to μ 1 . The counterfactual measure P Y T , 1 has μ 1 as its counterpart.

A.1 Proof of Theorem 2

Proof

The cyclically comonotonicity assumption reads as follows:

i = 1 m h 0 ( u i ) , h 1 ( u i + 1 ) h 1 ( u i ) 0

for all m N . Define y i = h 0 ( u i ) and y i + 1 = h 0 ( u i + 1 ) so that

i = 1 m y i , h 1 h 0 1 ( y i + 1 ) h 1 h 0 1 ( y i ) 0

for all x 0 , y 0 in the image of h 0 . This means that the function p = h 1 h 0 1 is cyclically monotone in the sense of (4). By [23, Theorem 24.8], and this is equivalent to p being the gradient of a convex function and hence the unique Brenier map from μ 0 to μ 1 . Moreover, by Assumption 1 K 0 * K 0 , so that we can apply the map p to μ 0 to identify μ 1 .□

A.2 Proof of Proposition 1

Proof

The main result to enable a consistency statement for μ ˆ 1 , m will be the uniform convergence for optimal maps presented in Theorem 1.1 of the study by Segers [68]. This states that with the Euclidean norm

lim n sup x 0 K 0 sup y p ˆ # { x 0 } y p # { x 0 } 0 .

In other words, the pushforward of singletons under p ˆ converges uniformly to their population pushforward under p . The aforementioned statement holds by case (b) of that theorem, and its assumptions are justified as follows. Both the empirical source measure μ ˆ 0 , n and target measure μ ˆ 1 , l converge weakly in probability to their population distributions [69]. The Brenier map p is the unique coupling with cyclically monotone support between μ 0 and μ 1 . Finally, both p ˆ and p are maximally cyclically monotone functions on the nonempty supports of their respective coupling measures by results in Rockafellar [70].

For finite n , the preimage of p ˆ will not contain all possible singletons in K 0 K 0 . Instead, we generate counterfactuals by rounding treatment samples x 0 to their nearest neighbor in the control pre-image, x ˜ 0 , and using p ˆ # { x ˜ 0 } as the counterfactual estimator. We wish to show

lim n sup x 0 K 0 sup y p ˆ # { x ˜ 0 } y p # { x 0 } 0 .

The exchange of x 0 for x 0 in the aforementioned statement follows because the set C of all closed balls on R d is a Vapnik-Chervonenkis class with VC dimension d + 2 [71,72, p. 833]. Therefore, with σ ( ) indicating the Borel σ -algebra and C denoting the supremum of the Euclidean distance evaluated over the set of closed balls,

sup μ 0 P ( K 0 , σ ( K 0 ) ) E μ ˆ 0 , n μ 0 C 0 , n .

This implies for sufficiently large n the empirical μ ˆ 0 , n will contain a sample from all closed balls. It follows that for any ε > 0 , x ˜ 0 , the nearest neighbor of x 0 must be an element of B ε ( x 0 ) .

We now consider

limsup min ( m , n ) K 0 p ˆ ( x ˜ ) p ( x ) μ 0 ( d x ) limsup min ( m , n ) K 0 p ˆ ( x ˜ ) p ( x ˜ ) μ 0 ( d x ) + K 0 p ( x ˜ ) p ( x ) μ 0 ( d x ) .

The first integral must converge to 0 in the limit supremum because of the uniform convergence for optimal maps stated earlier. The second integral involves a Brenier map p from μ 0 to μ 1 , which is μ 0 -Lipschitz almost everywhere. This implies K 0 p ( x ˜ ) p ( x ) μ 0 ( d x ) C K 0 x ˜ x μ 0 ( d x ) C sup K 0 x ˜ x for some Lipschitz constant C < + . We have already shown that in a sufficiently large sample, all nearest neighbor matches x ˜ will be arbitrarily close to x . Therefore, the limit supremum of this integral is bounded by C ε for any ε > 0 . It follows that

limsup min ( m , n ) K 0 p ˆ ( x ˜ ) p ( x ) μ 0 ( d x ) = 0 .

This integral also upper bounds K 0 p ˆ ( x ˜ ) x μ 0 ( d x ) K 0 p ( x ) x μ 0 ( d x ) by the reverse triangle inequality, so this absolute difference must also converge to zero in the limsup . The sequence of empirical μ ˆ 0 , m converge weakly in probability to μ 0 . Segers’ theorem implies uniform convergence, so

K 0 p ˆ ( x ˜ ) x μ ˆ 0 , m ( d x ) C sup p ˆ ( x ˜ ) x μ ˆ 0 , m ( K 0 ) 0 .

Hölder’s inequality and the triangle inequality gives

K 0 p ˆ ( x ˜ ) x μ ˆ 0 , m ( d x ) K 0 p ˆ ( x ˜ ) x μ 0 ( d x ) K 0 p ˆ ( x ˜ ) x [ μ ˆ 0 , m μ 0 ] ( d x ) + K 0 p ˆ ( x ˜ ) x μ 0 ( d x ) K 0 p ˆ ( x ˜ ) x μ 0 ( d x ) sup p ˆ ( x ˜ ) x [ μ ˆ 0 , m μ 0 ] ( K 0 ) + sup p ˆ ( x ˜ ) x μ 0 ( K 0 ) 0 ,

so we have convergence in probability of K 0 p ˆ ( x ˜ ) x μ ˆ 0 , m ( d x ) to K 0 p ˆ ( x ˜ ) x μ 0 ( d x ) . By combining these results, we can state that for all ε > 0 ,

lim min ( m , n ) P K 0 p ˆ ( x ˜ ) x μ ˆ 0 , m ( d x ) K 0 p ( x ) x μ 0 ( d x ) > ε 0 .

A.3 Proof of Proposition 2

Proof

We wish to bound the risk between the true and estimated counterfactual outcome distributions with respect to the 2-Wasserstein metric: E W 2 ( p # μ 0 , p ˆ # μ ˜ 0 , m ) . We will show this quantity is O ( n 1 d ) . Note that this expectation is jointly over μ 0 , control measure μ 0 onto whose sampled support we project, and μ 1 through estimating p ˆ . The assumed mutual independence between all samples will sometimes allow us to marginalize out distributions from an expectation; the distributions that we jointly take expectations over will be noted in that operator’s subscript.

By applying the triangle inequality, we have

(A1) E μ 0 , μ 1 , μ 0 W 2 ( p # μ 0 , p ˆ # μ ˜ 0 , m ) E μ 0 , μ 0 W 2 ( p # μ 0 , p # μ ˜ 0 , m ) + E μ 0 , μ 0 , μ 1 W 2 ( p # μ ˜ 0 , m , p ˆ # μ ˜ 0 , m ) .

Consider first E μ 0 , μ 0 W 2 ( p # μ 0 , p # μ ˜ 0 , m ) . We will bound the expected Wasserstein distance from μ 0 to its projection on the controls’ support μ ˜ 0 , m . Then we will show this convergence rate does not change under pushforward of both measures by p .

We have E μ 0 , μ 0 W 2 ( μ 0 , μ ˜ 0 , m ) E μ 0 W 2 ( μ 0 , μ ˆ 0 , m ) + E μ 0 , μ 0 W 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) again by the triangle inequality. The first term E μ 0 W 2 ( μ 0 , μ ˆ 0 , m ) is the expected distance between the true distribution and its i.i.d sample; we have an O ( m 1 d ) upper-bound e.g. from Fournier and Guillin [73]. The second term is the expected Wasserstein distance between sample μ ˆ 0 , m and its nearest neighbor match in the support of μ ˆ 0 , n .

The distributions of these empirical measures for a fixed sample size are denoted σ 0 , n , σ 0 , m , and σ 1 , l , respectively. We can express the joint expectation E μ 0 , μ 0 W 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) as the marginalized integral over the treatment group’s sampling distribution μ ˆ 0 , m E μ 0 W 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) σ 0 , m ( μ ˆ 0 , m ) . We wish to show that for fixed μ ˆ 0 , m , E μ 0 W 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) = O ( n 1 d ) , which will allow us to conclude E μ 0 , μ 0 W 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) = O ( n 1 d ) .

Lemma 3.1 from Canas and Rosasco [74] states W 2 2 ( μ , π S μ ) = E μ x S 2 , where π S is the nearest neighbor projection onto set S . In words, squared Euclidean nearest neighbor matching solves an optimal transport problem. Let S = supp μ ˆ 0 , n . This formulation allows us to express μ ˆ 0 , m E μ 0 W 2 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) σ 0 , m ( μ ˆ 0 , m ) as μ ˆ 0 , m E μ 0 E μ ˆ 0 , m x S 2 σ 0 , m ( μ ˆ 0 , m ) . Replacing E μ ˆ 0 , m with a summation yields μ ˆ 0 , m 1 m i = 1 m E μ 0 x i S 2 σ 0 , m ( μ ˆ 0 , m ) . Lemma 1 given by Abadie and Imbens [75] provides bounds on the matching discrepancy between fixed point z and potential matches drawn i.i.d from a distribution with compact, convex, and bounded support. By denoting the discrepancy vector to the nearest neighbor U 1 , they find E μ 0 U 1 3 = O ( n 3 d ) . Applying the Lyapunov’s inequality yields E μ 0 U 1 2 = O ( n 2 d ) . Thus, have E μ 0 W 2 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) = O ( n 2 d ) . From Jensen’s ( E μ 0 W 2 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) ) 1 2 E μ 0 W 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) = O ( n 1 d ) . Integrating this bound over the sampling distribution does not change it. Therefore, we can conclude by summing the two triangle inequality rates to yield E μ 0 , μ 0 W 2 ( μ ˆ 0 , m , μ ˜ 0 , m ) = O ( min ( m , n ) 1 d ) . Results to shortly follow will show this rate holds for the pushforward E μ 0 , μ 0 W 2 ( p # μ 0 , p # μ ˜ 0 , m ) as well.

Now we turn our attention to the rate of convergence for E μ 0 , μ 0 , μ 1 W 2 ( p # μ ˜ 0 , m , p ˆ # μ ˜ 0 , m ) . We once again appeal to the triangle inequality to upper bound this expectation. Note that

(A2) E μ 0 , μ 0 , μ 1 W 2 ( p # μ ˜ 0 , m , p ˆ # μ ˜ 0 , m ) E μ 0 , μ 0 W 2 ( p # μ ˜ 0 , m , p # μ 0 ) + E μ 0 , μ 0 , μ 1 W 2 ( p # μ 0 , p ˆ # μ 0 ) + E W 2 ( p ˆ # μ 0 , p ˆ # μ ˜ 0 , m ) .

To show the first and third terms are O ( min ( m , n ) 1 d ) , it is sufficient to show the rate of converge between two measures does not change under pushforward via an optimal transport map. Recall that optimal transport maps are twice differentiable almost everywhere, which implies they are also Lipschitz almost everywhere.

Let r denote the rounding optimal transport map from μ 0 to μ ˜ 0 , m . For all x in the support μ 0 , we have p r ( x ) p ( x ) K r ( x ) x for some Lipschitz constant K . Integrating both sides over μ 0 preserves this inequality and yields W 2 ( p # μ ˜ 0 , m , p # μ 0 ) K W 2 ( μ ˜ 0 , m , μ 0 ) . It follows E μ 0 , μ 0 W 2 ( p # μ ˜ 0 , m , p # μ 0 ) = O ( min ( m , n ) 1 d ) . Adapting this argument with p ˆ instead of p shows that E μ 0 , μ 0 , μ 1 W 2 ( p ˆ # μ ˜ 0 , p ˆ # μ ˜ 0 , m ) = O ( min ( m , n ) 1 d ) as well.

It remains to show E μ 0 , μ 0 , μ 1 W 2 ( p # μ 0 , p ˆ # μ 0 ) = O ( n 1 d ) . The Radon–Nikodym derivative f for μ 0 with respect to μ 0 exists and is bounded by assumption. From the definition of a push forward, we see that W 2 ( p # μ 0 , p ˆ # μ 0 ) can be expressed as K 0 p ( x ) p ˆ ( x ) f ( x ) μ 0 ( d x ) . It is well known that K 0 p ( x ) p ˆ ( x ) μ 0 ( d x ) = O ( n 1 d ) ; see e.g. Manole and Niles-Weed [53]. Let C equal the upper bound of f . Clearly K 0 p ( x ) p ˆ ( x ) f ( x ) μ 0 ( d x ) C K 0 p ( x ) p ˆ ( x ) μ 0 ( d x ) = O ( n 1 d ) .

We have shown each term of equation (A2) converges at a rate of O ( min ( m , n ) 1 d ) . Therefore, E μ 0 , μ 0 , μ 1 W 2 ( p # μ ˜ 0 , m , p ˆ # μ ˜ 0 , m ) = O ( min ( m , n ) 1 d ) . Both terms on the right-hand side of equation (A1) converges at a rate of O ( min ( m , n ) 1 d ) , so E μ 0 , μ 0 , μ 1 W 2 ( μ 1 , μ ˆ 1 , m ) = O ( min ( m , n ) 1 d ) as desired.□

B Calculating optimal transport couplings from data

This section outlines how to estimate optimal transport couplings from sampled data and provides references to supporting theory. Given n samples from measure μ and m samples from measure ν , both supported on R d , the objective is to estimate the Brenier map T ¯ such that ν = T ¯ # μ . The Brenier map’s definition is given by (3).

In practice, the measures μ and ν are replaced by their empirical analogues, denoted μ ˆ 1 n i = 1 n δ X i and ν ˆ 1 m j = 1 m δ Y j , which are discrete uniform distributions over their samples.[3] The transport cost between observations can be summarized by the matrix C R 0 n × m , where C i , j = c ( μ ˆ [ i ] , ν ˆ [ j ] ) , which is defined with respect to a cost function c ( x , y ) : R d × R d [ 0 , ) . Theorem 1 holds under the squared Euclidean distance: c ( x , y ) = x y 2 , which corresponds to the 2-Wasserstein distance between measures. A nonnegative transport matrix T , which moves the atoms of μ ˆ to ν ˆ is the object to optimize over. We enforce the recovery of marginals in the following discrete analog of equation (3)’s optimization:

(A3) min T R 0 n × m i , j T i , j C i , j s.t. n T 1 m = 1 n and m T 1 n = 1 m .

Here, 1 n denotes the length n vector with all entries equal to 1. Noting that (A3) can be reformulated as a linear program, it is common to apply algorithms from that domain, which yield bijective maps when n = m and sparse plans otherwise. Another approach is to add an entropic penalty term to (A3), which relaxes the problem and enables computation through Sinkhorn’s algorithm [12,76]. Sinkhorn-based approaches add the penalty term λ H ( T ) to (A3), where H ( T ) is the matrix entropy of T and positive tuning parameter λ controls the sparsity of T . For large choices of λ , the optimal solution will be driven toward the naive coupling given by the outer-product of marginals; for small λ , sparse solutions more akin to the unregularized problem are found. Without loss of generality assuming n m , the runtime of linear programming approaches is generally O ( n 3 log ( n ) ) , while Sinkhorn can achieve O ( n 2 ε 3 ) if we wish to bound the error of our discretized Wasserstein distance by ε [77].

Our methodology involves first estimating p ˆ from control group observations and then using that estimate to pushforward μ 0 . Representing p ˆ as a matrix, we can recover its pushforward of μ ˆ 0 through n T μ ˆ 1 . As it is unlikely that the supports of the empirical measures μ ˆ 0 and μ ˆ 0 have a large intersection, we must extrapolate p ˆ ’s behavior on μ ˆ 0 . A common approach is using nearest neighbors [78]. Counterfactual treatment outcomes are generated by matching each treatment unit preintervention to the nearest control and then pushing forward along the transport plan between observed control distributions. Neural network-based approaches to learn maps have also been proposed [79,80], and representation results help support this direction of active research [81].

To compute optimal transport maps in this article, we use a linear programming method ot.lp.emd from the Python package Python Optimal Transport[82]. These maps are then extrapolated into optimal transport plans with Euclidean nearest neighbor matching. In our simulations, the control and treatment groups preintervention have almost complete overlap of sampled support, justifying this technique. All numerical experiments in this article are written and run in Python 3. Replication code is available in Appendix of this article.

C Numerical experiments

In this section, we provide implementation details for results computed in Sections 4.1 and 4.2.

C.1 Implementation details for numerical experiment in Section 4.1

We consider n = 3,000 units in R 2 for each treatment arm. Samples of latent variables are drawn from the distribution ν at t = 0 and t = 1 , mirroring the setup discussed in Section 2.2. Draws from ν are fixed across time for counterfactual validation purposes. For controls, ν ’s first coordinate is distributed according to Beta ( 3 , 2 ) and second to Beta ( 2 , 3 ) ; for treatments, ν ’s first coordinate is distributed according to Beta ( 2 , 3 ) and second to Beta ( 3 , 2 ) .

Recall that we consider the following set of production functions that are cyclically comonotone:

h 0 ( u ) = 1 α α 1 u and h 1 ( u ) = 1 α α 1 u .

In our simulations, the α parameter of the production functions is fixed at 0.5. The proof of their cyclically comonotone relationship when α ( 0 , 1 ) follows.

Proof

We begin by simplifying the inner product terms contained in the definition of cyclical comonotonicity (6). We have

h 0 ( u i ) , h 1 ( u i ) h 1 ( u i + 1 ) = 1 α α 1 u i , 1 α α 1 ( u i u i + 1 ) .

After expansion and simplification, this reduces to ( 1 α ) 2 u i , u i u i + 1 . Substituting this into the definition of (6), we now wish to show ( 1 α ) 2 i = 1 m u i , u i u i + 1 ) 0 for all m . Our restriction of α ( 0 , 1 ) ensures ( 1 α ) 2 is always positive, and this summation is equivalent to the identity map being cyclically monotone in the sense of (4). The identity map is the gradient of a convex function, 0.5 u 2 2 , completing our proof.□

By using these production functions, we generate n independent samples from each of the distributions μ 0 , μ 1 and μ 0 , as well as samples from the true counterfactual distribution μ 1 for validation purposes.

To estimate the transport map p , we first compute an optimal plan using observed data and round it to an optimal transport map. This map is only defined on the data from μ 0 . To predict counterfactuals treatment on data from μ 0 , we employ nearest neighbor interpolation. Since the Beta distribution is supported on [ 0 , 1 ] for all parameter choices, μ 0 and μ 0 have identical support in this example, and this naive extrapolation technique performs sufficiently well. In particular, it shows that the OT-based estimator remains close to the true counterfactual distribution while naive tensorization of CiC may depart significantly.

We also compute the eCDF for our 3,000 true counterfactual observations and the counterfactuals generated by the two methods over a uniform mesh of 10,000 points. Figure A1 visually demonstrates that OT almost perfectly recovers the eCDF, and Table A1 quantifies this result. The mean absolute difference over each mesh point is an order of magnitude smaller for OT and has a smaller standard deviation.

Figure A1 
                     Quantiles of the eCDF for the bivaraite experiment over a uniform mesh with 10,000 points.
Figure A1

Quantiles of the eCDF for the bivaraite experiment over a uniform mesh with 10,000 points.

Table A1

Recovery of eCDF by method over 20 runs

MAD OT MAD CiC
Mean 0.008 0.089
st. dev. 0.002 0.003

C.2 Implementation details for numerical experiment in Section 4.2

Recall that we consider a class convex functions indexed by θ , where g ( x ; θ ) = i = 1 p x ( i 1 ) 2 x ( i 2 ) 1 . Here, x R + + d , x ( i ) represents the i th coordinate of x , i j [ [ d ] ] for j { 1 , 2 } , and the parameter θ contains the p pairs of indices to be compared.

It is well known the that function f = x 2 y is convex when y > 0 . Furthermore, the sum of convex functions remains convex. Therefore, the functions g ( x ; θ ) are convex. In our numerical experiment, we sample θ randomly in each run to contain d coordinate–pair interactions, matching the dimension of the latent vectors.

In our experiment, we define h 0 as the identity and h 1 = g . Therefore, cyclical comonotonicity (6) is equivalent to the cyclical monotonicity (4) of g . As g is convex, g is an optimal transport map and therefore cyclically monotone.

The d coordinate pairs randomly selected from a uniform distribution on [ 1 , d ] . As these results only hold for strictly positive latent vectors, we sample both latent distributions from Beta ( 2 , 3 ) . Both treatment arms have n = 3 , 000 units.

The implementation of our experiment is otherwise identical to that described in Appendix C.1; we generate data for the four relevant distributions and compute transport plans with nearest neighbor extrapolation. The eCDF and MAD computation is also the same.

D Additional CK experiment

We begin by presenting an additional figure from our bivariate CK analysis in Section 4.3. Figure A2 demonstrates a negative correlation between the change in full-time employees after the intervention and the change in part-time employees. This suggests that fast food restaurants substituted full-time employees for part-time ones.

Figure A2 
                  Distribution of unit-level treatment effect estimates, demonstrating a negative correlation between change in full-time and part-time employees.
Figure A2

Distribution of unit-level treatment effect estimates, demonstrating a negative correlation between change in full-time and part-time employees.

Figure A3 
                  Recovery of counterfactual marginals by OT and CiC. (a) Full-time employment and (b) part-time employment.
Figure A3

Recovery of counterfactual marginals by OT and CiC. (a) Full-time employment and (b) part-time employment.

For our reanalysis of the CK data on the minimum wage and fast food employment, we use the original dataset provided by David Card on his website. It contains survey information, collected via telephone, for 410 fast food restaurants across four fast-food chains. We remove 19 restaurants with missing outcome observations. Of the remaining, 76 are in the control region of northeastern Pennsylvania and 315 are in New Jersey. In addition to the two employment outcomes of interest, a number of other observations about a restaurant’s wages, prices, and operations were collected. Our optimal transport methodology allows us to estimate treatment effects more richly with potential outcomes including nonemployment time varying restaurant characteristics. We emphasize that this experiment is presented to illustrate the applicability of our method in higher dimensions. Our variable selection is not data driven and the ratio of covariate to units is low.

We select a representative subset of 10 numerical covariates, listed in Table A2, and remove any restaurant with a missing entry for any of these covariates. This leaves a final sample of 52 controls and 200 treatments. The full dataset has 15 numerical covariates but including all 15 leads to a small sample size due to missing data. The covariates we do not include add little additional information, such as the price of fries (we include the price of entrees and sodas), have high rates of missingness, or have a different distribution in the subsample with complete data than the entire survey population. Unlike the outcome-only analysis presented in Section 4.3, the included covariates have different scales. Thus, we standardize each to zero mean and unit standard deviation. The dataset also includes categorical data such as the fast-food chain, which we do not include because the Euclidean distance between restaurants would depend on how these are encoded.

Table A2

Outcomes and covariates included in our analysis

Covariate name Description
EMPFT Number of full-time employees
EMPPT Number of part-time employees
PCTAFF Percent of employees affected by new minimum wage
NMGRS Number of managers
INCTIME Months until usual first raise
PENTREE Price of an entrÃľe with tax
PSODA Price of a soda with tax
NREGS Number of cash registers in the restaurant
OPEN Hour of opening
HRSOPEN Number of hours open per day

Instead of presenting results conditional on some set of covariates, we present aggregate results over subsets of all subsets of potential outcome vectors including both employment outcomes and 2, 3, or 4 other covariates. The positive results of this experiment are included in Table A3. The sign of our two estimates never change in this experiment. Furthermore, addings covariates leads to optimal transport estimators with smaller estimated full-time ATE and larger part-time ATE on aggregate. In future work with more tests for covariate selection and further sensitivity analysis, we hope stronger claims about the estimates’ magnitude can be made.

Table A3

Summary statistics of higher dimensional subsets for the CK ATE

TE FT TE PT
Mean 1.56 1.97
st. dev. 0.38 0.56
Min 0.69 3.59
Max 2.63 0.78

References

[1] Abadie A. Semiparametric difference-in-differences estimators. Rev Econ Stud. 2005;72(1):1–19. 10.1111/0034-6527.00321Search in Google Scholar

[2] Lechner M. The estimation of causal effects by difference-in-difference methods. Foundations and Trends® in Econometrics. 2011;4(3):165–224. 10.1561/0800000014Search in Google Scholar

[3] Imbens GW, Rubin DB. Causal inference in statistics, social, and biomedical sciences. New York, NY: Cambridge University Press; 2015. 10.1017/CBO9781139025751Search in Google Scholar

[4] Roth J, Sant’Anna PH, Bilinski A, Poe J. What’s trending in difference-in-differences? A synthesis of the recent econometrics literature. 2022. arXiv: http://arXiv.org/abs/arXiv:220101194. Search in Google Scholar

[5] Wing C, Simon K, Bello-Gomez RA. Designing difference in difference studies: best practices for public health policy research. Annual Review Public Health. 2018;39:453–69.10.1146/annurev-publhealth-040617-013507Search in Google Scholar PubMed

[6] Athey S, Imbens GW. Identification and inference in nonlinear difference-in-differences models. Econometrica. 2006;74(2):431–97. 10.1111/j.1468-0262.2006.00668.xSearch in Google Scholar

[7] Heckman J. Varieties of selection bias. Amer Econ Rev. 1990;80(2):313–8. Search in Google Scholar

[8] Roth J, Sant’Anna PH. When is parallel trends sensitive to functional form? 2020. arXiv: http://arXiv.org/abs/201004814. Search in Google Scholar

[9] Ryan AM, Kontopantelis E, Linden A, Burgess Jr JF. Now trending: Coping with non-parallel trends in difference-in-differences analysis. Stat Methods Med Res. 2019;28(12):3697–711. 10.1177/0962280218814570Search in Google Scholar PubMed

[10] Goodman-Bacon A, Marcus J. Using difference-in-differences to identify causal effects of COVID-19 policies. Survey Res Methods. 2020;14(2):153–8. 10.2139/ssrn.3603970Search in Google Scholar

[11] Drysdale KM, Hendricks NP. Adaptation to an irrigation water restriction imposed through local governance. J Environ Econ Management. 2018;91:150–65. 10.1016/j.jeem.2018.08.002Search in Google Scholar

[12] Peyré G, Cuturi M. Computational optimal transport. Foundations and Trends® in Machine Learning. 2019;11(5–6):355–607. 10.1561/2200000073Search in Google Scholar

[13] Card D, Krueger AB. Minimum wages and employment: a case study of the fast-food industry in New Jersey and Pennsylvania. Amer Econ Rev. 1994;84(4):772–93. 10.3386/w4509Search in Google Scholar

[14] Ghanem D, Sant’Anna PHC, Wüthrich K. Selection and parallel trends. 2022. arXiv: http://arXiv.org/abs/220309001. Search in Google Scholar

[15] Marx P, Tamer E, Tang X. Parallel trends and dynamic choices. 2022. arXiv: http://arXiv.org/abs/220706564. Search in Google Scholar

[16] Rigollet P, Weed J. Uncoupled isotonic regression via minimum Wasserstein deconvolution. Inform Inference A J IMA. 2019;8(4):691–717. 10.1093/imaiai/iaz006Search in Google Scholar

[17] Balabdaoui F, Doss CR, Durot C. Unlinked monotone regression. 2021. arXiv: http://arXiv.org/abs/arXiv:200700830. Search in Google Scholar

[18] Slawski M, Sen B. Permuted and unlinked monotone regression in Rd: an approach based on mixture modeling and optimal transport. 2022. arXiv: http://arXiv.org/abs/arXiv:220103528. Search in Google Scholar

[19] Callaway B, Li T. Quantile treatment effects in difference in differences models with panel data. Quantitative Econom. 2019;10(4):1579–618. 10.3982/QE935Search in Google Scholar

[20] Bonhomme S, Sauder U. Recovering distributions in difference-in-differences models: A comparison of selective and comprehensive schooling. Review Econom Stat. 2011;93(2):479–94. 10.1162/REST_a_00164Search in Google Scholar

[21] Brenier Y. Polar factorization and monotone rearrangement of vector-valued functions. Commun Pure Appl Math. 1991;44(4):375–417. 10.1002/cpa.3160440402Search in Google Scholar

[22] Caffarelli LA. Monotonicity properties of optimal transportation and the FKG and related inequalities. Comm Math Phys. 2000;214(3):547–63. 10.1007/s002200000257Search in Google Scholar

[23] Rockafellar RT. Convex analysis. Princeton, NJ: Princeton University Press; 1997. Search in Google Scholar

[24] Matzkin RL. Nonparametric estimation of nonadditive random functions. Econometrica. 2003;71(5):1339–75. 10.1111/1468-0262.00452Search in Google Scholar

[25] Chernozhukov V, Hansen C. An IV model of quantile treatment effects. Econometrica. 2005;73(1):245–61. 10.1111/j.1468-0262.2005.00570.xSearch in Google Scholar

[26] Imbens GW. Nonadditive models with endogenous regressors. Econometric Soc Monographs. 2007;43:17. 10.1017/CCOL0521871549.002Search in Google Scholar

[27] Ekeland I, Galichon A, Henry M. Comonotonic measures of multivariate risks. Math Finance. 2010 Oct;22(1):109–32. Search in Google Scholar

[28] Boissard E, Le Gouic T, Loubes JM. Distributionas template estimate with Wasserstein metrics. Bernoulli. 2015;21(2):740–59. 10.3150/13-BEJ585Search in Google Scholar

[29] Puccetti G, Scarsini M. Multivariate comonotonicity. J Multivariate Anal. 2010;101(1):291–304. 10.1016/j.jmva.2009.08.003Search in Google Scholar

[30] Ashlagi I, Braverman M, Hassidim A, Monderer D. Monotonicity and implementability. Econometrica. 2010;78(5):1749–72. 10.3982/ECTA8882Search in Google Scholar

[31] Rochet JC. A necessary and sufficient condition for rationalizability in a quasi-linear context. J Math Econom. 1987;16(2):191–200. 10.1016/0304-4068(87)90007-3Search in Google Scholar

[32] Shi X, Shum M, Song W. Estimating semi-parametric panel multinomial choice models using cyclic monotonicity. Econometrica. 2018;86(2):737–61. 10.3982/ECTA14115Search in Google Scholar

[33] Chernozhukov V, Galichon A, Henry M, Pass B. Identification of Hedonic equilibrium and nonseparable simultaneous equations. Journal of Political Economy. 2021;129(3):842–70. 10.1086/712447Search in Google Scholar

[34] Rüschendorf L. On c-optimal random variables. Stat Probability Lett. 1996;27(3):267–70. 10.1016/0167-7152(95)00078-XSearch in Google Scholar

[35] Gunsilius FF. A condition for the identification of multivariate models with binary instruments. J Econometrics. 2022;235:220–38. 10.1016/j.jeconom.2022.04.003Search in Google Scholar

[36] Galichon A. A survey of some recent applications of optimal transport methods to econometrics. Econometrics J. 2017;20(2):C1–11. 10.1111/ectj.12083Search in Google Scholar

[37] McCann RJ, Pass B. Optimal transportation between unequal dimensions. Archive Rational Mechanics Anal. 2020;238(3):1475–520. 10.1007/s00205-020-01569-5Search in Google Scholar

[38] Auricchio G, Veneroni M. On the structure of optimal transportation plans between discrete measures. Appl Math Optimiz. 2022;85(3):42. 10.1007/s00245-022-09861-4Search in Google Scholar

[39] Decancq K, Lugo MA. Weights in multidimensional indices of wellbeing: an overview. Econometric Rev. 2013;32(1):7–34. 10.1080/07474938.2012.690641Search in Google Scholar

[40] Duclos JY, Sahn DE, Younger SD. Robust multidimensional poverty comparisons. The Economic J. 2006;116(514):943–68. 10.1111/j.1468-0297.2006.01118.xSearch in Google Scholar

[41] Bourguignon F, Chakravarty SR. The measurement of multidimensional poverty. J Economic Inequality. 2003;1:25–49. 10.1023/A:1023913831342Search in Google Scholar

[42] Ekeland I, Galichon A, Henry M. Comonotonic measures of multivariate risks. Math Finance Int J Math Stat Financial Econom. 2012;22(1):109–32. 10.1111/j.1467-9965.2010.00453.xSearch in Google Scholar

[43] Embrechts P, McNeil A, Straumann D. Correlation and dependence in risk management: properties and pitfalls. Risk Management Value Risk Beyond. 2002;1:176–223. 10.1017/CBO9780511615337.008Search in Google Scholar

[44] Hallin M. Measure transportation and statistical decision theory. Ann Rev Stat Appl. 2022;9:401–24. 10.1146/annurev-statistics-040220-105948Search in Google Scholar

[45] García-Gómez C, Perez A, Prieto-Alaiz M. A review of stochastic dominance methods for poverty analysis. J Economic Surveys. 2019;33(5):1437–62. 10.1111/joes.12334Search in Google Scholar

[46] Embrechts P, Puccetti G. Bounds for functions of multivariate risks. J Multivariate Anal. 2006;97(2):526–47. 10.1016/j.jmva.2005.04.001Search in Google Scholar

[47] Shannon CE. A mathematical theory of communication. Bell Syst Technical J. 1948;27(3):379–423. 10.1002/j.1538-7305.1948.tb01338.xSearch in Google Scholar

[48] Forrow A, Hütter JC, Nitzan M, Rigollet P, Schiebinger G, Weed J. Statistical optimal transport via factored couplings. In: The 22nd International Conference on Artificial Intelligence and Statistics. PMLR; 2019. p. 2454–65. Search in Google Scholar

[49] Gunsilius FF. On the convergence rate of potentials of Brenier maps. Econometric Theory. Cambridge, England: Cambridge University Press; 2021. 10.1017/S0266466621000037Search in Google Scholar

[50] Hütter JC, Rigollet P. Minimax estimation of smooth optimal transport maps. Ann Stat. 2021;49(2):1166–94. 10.1214/20-AOS1997Search in Google Scholar

[51] de Lara L, González-Sanz A, Loubes JM. A consistent extension of discrete optimal transport maps for machine learning applications. 2021. arXiv: http://arXiv.org/abs/210208644. Search in Google Scholar

[52] Manole T, Balakrishnan S, Niles-Weed J, Wasserman L. Plugin estimation of smooth optimal transport maps. 2021. arXiv: http://arXiv.org/abs/arXiv:210712364. Search in Google Scholar

[53] Manole T, Niles-Weed J. Sharp convergence rates for empirical optimal transport with smooth costs. 2021. arXiv: http://arXiv.org/abs/arXiv:210613181. Search in Google Scholar

[54] Pooladian AA, Niles-Weed J. Entropic estimation of optimal transport maps. 2021. arXiv: http://arXiv.org/abs/arXiv:210912004. Search in Google Scholar

[55] Vacher A, Muzellec B, Rudi A, Bach F, Vialard FX. A dimension-free computational upper-bound for smooth optimal transport estimation. In: Proceedings of Thirty Fourth Conference on Learning Theory. PMLR; 2021. p. 4143–73. Search in Google Scholar

[56] Muzellec B, Vacher A, Bach F, Vialard FX, Rudi A. Near-optimal estimation of smooth transport maps with kernel sums-of-squares. 2021. arXiv: http://arXiv.org/abs/arXiv:211201907. Search in Google Scholar

[57] Deb N, Ghosal P, Sen B. Rates of estimation of optimal transport maps using plug-in estimators via barycentric projections. 2021. arXiv: http://arXiv.org/abs/arXiv:210701718. Search in Google Scholar

[58] Politis DN, Romano JP, Wolf M. On the asymptotic theory of subsampling. Stat Sinica. 2001;11:1105–24. Search in Google Scholar

[59] Romano JP, Shaikh AM. On the uniform asymptotic validity of subsampling and the bootstrap. Ann Stat. 2012;40(6):2798–822. 10.1214/12-AOS1051Search in Google Scholar

[60] Shao X, Politis DN. Fixed b subsampling and the block bootstrap: improved confidence sets based on p-value calibration. J R Stat Soc Ser B (Stat Methodol). 2013;75(1):161–84. 10.1111/j.1467-9868.2012.01037.xSearch in Google Scholar

[61] Neumark D, Wascher W. Minimum wages and employment: a case study of the fast-food industry in new jersey and pennsylvania: comment. Amer Econ Rev. 2000;90(5):1362–96. 10.1257/aer.90.5.1362Search in Google Scholar

[62] Dube A, Lester TW, Reich M. Minimum wage effects across state borders: Estimates using contiguous counties. Review Econom Stat. 2010;92(4):945–64. 10.1162/REST_a_00039Search in Google Scholar

[63] Meer J, West J. Effects of the minimum wage on employment dynamics. J Human Resources. 2016;51(2):500–22. 10.3368/jhr.51.2.0414-6298R1Search in Google Scholar

[64] Neumark D, Salas JI, Wascher W. Revisiting the minimum wage-Employment debate: Throwing out the baby with the bathwater? ILR Review. 2014;67(3 suppl):608–48. 10.1177/00197939140670S307Search in Google Scholar

[65] Lu B, Rosenbaum PR. Optimal pair matching with two control groups. J Comput Graph Stat. 2004;13(2):422–34. 10.1198/1061860043470Search in Google Scholar

[66] Ehrenberg RG, Brown C, Freeman RB, Hamermesh DS, Osterman P, Welch F. Myth and measurement: the new economics of the minimum wage. Industrial Labor Relations Review. 1995;48(4):827. 10.2307/2524359Search in Google Scholar

[67] Ropponen O. Reconciling the evidence of Card and Krueger (1994) and Neumark and Wascher (2000). J Appl Econometrics. 2011;26(6):1051–7. 10.1002/jae.1258Search in Google Scholar

[68] Segers J. Graphical and uniform consistency of estimated optimal transport plans. 2022. arXiv: http://arXiv.org/abs/arXiv:220802508. Search in Google Scholar

[69] Varadarajan VS. Weak convergence of measures on separable metric spaces. Sankhy Indian J Stat. 1958;19:15–22. Search in Google Scholar

[70] Rockafellar R. Characterization of the subdifferentials of convex functions. Pacific J Math. 1966;17(3):497–510. 10.2140/pjm.1966.17.497Search in Google Scholar

[71] Shorack GR, Wellner JA. Empirical processes with applications to statistics. Classics in Applied Mathematics. Philadelphia, PA: Society for Industrial and Applied Mathematics; 2009. 10.1137/1.9780898719017Search in Google Scholar

[72] Vapnik VN, Chervonenkis AY. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probability Appl. 1971;16(2):264–80. 10.1137/1116025Search in Google Scholar

[73] Fournier N, Guillin A. On the rate of convergence in Wasserstein distance of the empirical measure. Probability Theory Related Fields. 2015;162(3):707–38. 10.1007/s00440-014-0583-7Search in Google Scholar

[74] Canas G, Rosasco L. Learning probability measures with respect to optimal transport metrics. In: Pereira F, Burges CJ, Bottou L, Weinberger KQ, editors. Advances in Neural Information Processing Systems. vol. 25. Boston, MA: Curran Associates, Inc.; 2012. https://proceedings.neurips.cc/paper/2012/file/c54e7837e0cd0ced286cb5995327d1ab-Paper.pdf. Search in Google Scholar

[75] Abadie A, Imbens GW. Large sample properties of matching estimators for average treatment effects. Econometrica. 2006 Jan;74(1):235–67. 10.1111/j.1468-0262.2006.00655.xSearch in Google Scholar

[76] Cuturi M. Sinkhorn distances: lightspeed computation of optimal transport. In: Advances in neural information processing systems. vol. 26. Boston, MA: Curran Associates, Inc.; 2013. Search in Google Scholar

[77] Altschuler J, Weed J, Rigollet P. Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration. 2017. arXiv: http://arXiv.org/abs/170509634. Search in Google Scholar

[78] Papadakis N. Optimal transport for image processing [Habilitation à diriger des recherches]. Université de Bordeaux; Habilitation thesis; 2015. https://hal.science/tel-01246096. Search in Google Scholar

[79] Seguy V, Damodaran BB, Flamary R, Courty N, Rolet A, Blondel M. Large-scale optimal transport and mapping estimation. 2018. arXiv: http://arXiv.org/abs/171102283. Search in Google Scholar

[80] Makkuva AV, Taghvaei A, Oh S, Lee JD. Optimal transport mapping via input convex neural networks. 2020. arXiv: http://arXiv.org/abs/190810962. Search in Google Scholar

[81] Lu Y, Lu J. A Universal Approximation theorem of deep neural networks for expressing probability distributions. 2020. arXiv: http://arXiv.org/abs/200408867. Search in Google Scholar

[82] Flamary R, Courty N, Gramfort A, Alaya MZ, Boisbunon A, Chambon S, et al. POT: python optimal transport. J Machine Learn Res. 2021;22(78):1–8. Search in Google Scholar

Received: 2023-01-18
Revised: 2023-08-20
Accepted: 2023-09-05
Published Online: 2024-08-05

© 2024 the author(s), published by De Gruyter

This work is licensed under the Creative Commons Attribution 4.0 International License.

Articles in the same Issue

  1. Research Articles
  2. Evaluating Boolean relationships in Configurational Comparative Methods
  3. Doubly weighted M-estimation for nonrandom assignment and missing outcomes
  4. Regression(s) discontinuity: Using bootstrap aggregation to yield estimates of RD treatment effects
  5. Energy balancing of covariate distributions
  6. A phenomenological account for causality in terms of elementary actions
  7. Nonparametric estimation of conditional incremental effects
  8. Conditional generative adversarial networks for individualized causal mediation analysis
  9. Mediation analyses for the effect of antibodies in vaccination
  10. Sharp bounds for causal effects based on Ding and VanderWeele's sensitivity parameters
  11. Detecting treatment interference under K-nearest-neighbors interference
  12. Bias formulas for violations of proximal identification assumptions in a linear structural equation model
  13. Current philosophical perspectives on drug approval in the real world
  14. Foundations of causal discovery on groups of variables
  15. Improved sensitivity bounds for mediation under unmeasured mediator–outcome confounding
  16. Potential outcomes and decision-theoretic foundations for statistical causality: Response to Richardson and Robins
  17. Quantifying the quality of configurational causal models
  18. Design-based RCT estimators and central limit theorems for baseline subgroup and related analyses
  19. An optimal transport approach to estimating causal effects via nonlinear difference-in-differences
  20. Estimation of network treatment effects with non-ignorable missing confounders
  21. Double machine learning and design in batch adaptive experiments
  22. The functional average treatment effect
  23. An approach to nonparametric inference on the causal dose–response function
  24. Review Article
  25. Comparison of open-source software for producing directed acyclic graphs
  26. Special Issue on Neyman (1923) and its influences on causal inference
  27. Optimal allocation of sample size for randomization-based inference from 2K factorial designs
  28. Direct, indirect, and interaction effects based on principal stratification with a binary mediator
  29. Interactive identification of individuals with positive treatment effect while controlling false discoveries
  30. Neyman meets causal machine learning: Experimental evaluation of individualized treatment rules
  31. From urn models to box models: Making Neyman's (1923) insights accessible
  32. Prospective and retrospective causal inferences based on the potential outcome framework
  33. Causal inference with textual data: A quasi-experimental design assessing the association between author metadata and acceptance among ICLR submissions from 2017 to 2022
  34. Some theoretical foundations for the design and analysis of randomized experiments
Downloaded on 11.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/jci-2023-0004/html
Scroll to top button