Original: Bivariate Causal Discovery for Categorical Data via Classification with Optimal Label Permutation
Revised: Bivariate Causal Discovery for Categorical Data via Classification with Optimal Label Permutation

Original: Abstract
Revised: Abstract

Original: Causal discovery for quantitative data has been extensively studied but less is known for categorical data.
Revised: Causal discovery for quantitative data has been extensively studied but less is known for categorical data.

Original: We propose a novel causal model for categorical data based on a new classification model, termed classification with optimal label permutation (COLP).
Revised: We propose a novel causal model for categorical data based on a new classification model, termed classification with optimal label permutation (COLP).

Original: By design, COLP is a parsimonious classifier, which gives rise to a provably identifiable causal model.
Revised: By design, COLP is a parsimonious classifier, which gives rise to a provably identifiable causal model.

Original: A simple learning algorithm via comparing likelihood functions of causal and anti-causal models suffices to learn the causal direction.
Revised: A simple learning algorithm via comparing likelihood functions of causal and anti-causal models suffices to learn the causal direction.

Original: Through experiments with synthetic and real data, we demonstrate the favorable performance of the proposed COLP-based causal model compared to state-of-the-art methods.
Revised: Through experiments with synthetic and real data, we demonstrate the favorable performance of the proposed COLP-based causal model compared to state-of-the-art methods.

Original: We also make available an accompanying R package
Revised: We also make available an accompanying R package

Original: COLP , which contains the proposed causal discovery algorithm and a benchmark dataset of categorical cause-effect pairs.
Revised: COLP , which contains the proposed causal discovery algorithm and a benchmark dataset of categorical cause-effect pairs.

Original:  Introduction
Revised:  Introduction

Original: Discovering causality from observational data has seen rapid development in recent years partly because knowledge of causality is desired in many areas where controlled experimentation is very difficult, infeasible, or expensive to carry out.
Revised: Discovering causality from observational data has seen rapid development in recent years partly because knowledge of causality is desired in many areas where controlled experimentation is very difficult, infeasible, or expensive to carry out.

Original: Particularly, for continuous and count data, numerous methods and theories have been developed [Shimizu et al., 2006, Hoyer et al., 2009, Zhang and
Revised: Particularly, for continuous and count data, numerous methods and theories have been developed [Shimizu et al., 2006, Hoyer et al., 2009, Zhang and

Original: Hyvärinen, 2009, Mooij et al., 2010, Janzing et al., 2012, Chen et al., 2014, Sgouritsa et al., 2015,
Revised: Hyvärinen, 2009, Mooij et al., 2010, Janzing et al., 2012, Chen et al., 2014, Sgouritsa et al., 2015,

Original: Hernandez-Lobato et al., 2016, Marx and Vreeken, 2017, Blöbaum et al., 2018, Park and Park, 2019,
Revised: Hernandez-Lobato et al., 2016, Marx and Vreeken, 2017, Blöbaum et al., 2018, Park and Park, 2019,

Original: Choi et al., 2020, Tagasovska et al., 2020].
Revised: Choi et al., 2020, Tagasovska et al., 2020].

Original: All of these methods, in essence, exploit the quantitative nature of continuous and count data in discovering causality.
Revised: All of these methods, in essence, exploit the quantitative nature of continuous and count data in discovering causality.

Original: Therefore, they are not applicable to categorical data for which the values can only be interpreted qualitatively.
Revised: Therefore, they are not applicable to categorical data for which the values can only be interpreted qualitatively.

Original: For example, while
Revised: For example, while

Original: Y = g
Revised: Y = g

Original: ( X ) + E may be a reasonable causal model for continuous data, the interpretation of such model for categorical data, although possible [Peters et al., 2010, Suzuki et al., 2014] under certain circumstances, is much less natural because the order of magnitude of the values of categorical data is arbitrary and meaningless [Cai et al., 2018].
Revised: ( X ) + E may be a reasonable causal model for continuous data, the interpretation of such model for categorical data, although possible [Peters et al., 2010, Suzuki et al., 2014] under certain circumstances, is much less natural because the order of magnitude of the values of categorical data is arbitrary and meaningless [Cai et al., 2018].

Original: In general, causal discovery for categorical data is much less studied.
Revised: In general, causal discovery for categorical data is much less studied.

Original: What is known to date is that the causal model X
Revised: What is known to date is that the causal model X

Original: → Y can be identified if X and Y are ordinal [Ni and Mallick, 2022], if X admits a hidden compact representation Y ′ =
Revised: → Y can be identified if X and Y are ordinal [Ni and Mallick, 2022], if X admits a hidden compact representation Y ′ =

Original: f ( X ) such that | Y ′
Revised: f ( X ) such that | Y ′

Original: | < | X | ( |·| denotes the cardinality) and X → Y ′
Revised: | < | X | ( |·| denotes the cardinality) and X → Y ′

Original: → Y [Cai et al., 2018], if the exogenous variable E of the structural causal model
Revised: → Y [Cai et al., 2018], if the exogenous variable E of the structural causal model

Original: Y = f
Revised: Y = f

Original: ( X, E ) has entropy that does not scale with the number of categories [Compton et al., 2020], if P ( X ) and P ( Y | X ) are independent random variables [Liu and Chan, 2016], or if the categorical variables X and Y are binary and they do not share the same marginal distribution [Wei et al., 2018].
Revised: ( X, E ) has entropy that does not scale with the number of categories [Compton et al., 2020], if P ( X ) and P ( Y | X ) are independent random variables [Liu and Chan, 2016], or if the categorical variables X and Y are binary and they do not share the same marginal distribution [Wei et al., 2018].

Original: Note that causal discovery methods that focus on identifying Markov equivalence classes [Spirtes et al., 2000, Lam et al., 2022] are not directly applicable to bivariate causal discovery problems as
Revised: Note that causal discovery methods that focus on identifying Markov equivalence classes [Spirtes et al., 2000, Lam et al., 2022] are not directly applicable to bivariate causal discovery problems as

Original: X → Y and Y → X are Markov equivalent.
Revised: X → Y and Y → X are Markov equivalent.

Original: However, when additional variables are available, they may be able to identify direct or indirect causal relationship between X and Y .
Revised: However, when additional variables are available, they may be able to identify direct or indirect causal relationship between X and Y .

Original: In this paper, we propose a novel causal model for categorical data based on classification with optimal label permutation (COLP).
Revised: In this paper, we propose a novel causal model for categorical data based on classification with optimal label permutation (COLP).

Original: COLP itself is a new classifier, which is more parsimonious than multinomial regression.
Revised: COLP itself is a new classifier, which is more parsimonious than multinomial regression.

Original: COLP is inspired by ordinal regression, which has considerably lower model complexity than multinomial regression.
Revised: COLP is inspired by ordinal regression, which has considerably lower model complexity than multinomial regression.

Original: Unfortunately, by design, ordinal regression is only applicable to categorical responses that admit a natural ordering, e.g., human satisfaction (low, medium, and high).
Revised: Unfortunately, by design, ordinal regression is only applicable to categorical responses that admit a natural ordering, e.g., human satisfaction (low, medium, and high).

Original: However, many categorical variables (e.g., choice of sports from { gymnastics, boxing, volleyball } ) do not appear to have natural orderings but we argue that for the purposes of prediction, the response
Revised: However, many categorical variables (e.g., choice of sports from { gymnastics, boxing, volleyball } ) do not appear to have natural orderings but we argue that for the purposes of prediction, the response

Original: Y may be ordered in a meaningful way depending on the predictor X .
Revised: Y may be ordered in a meaningful way depending on the predictor X .

Original: For instance, if one wants to to predict a person’s choice of sports Y ∈ { gymnastics, boxing, volleyball } based on his/her height
Revised: For instance, if one wants to to predict a person’s choice of sports Y ∈ { gymnastics, boxing, volleyball } based on his/her height

Original: X , it would make sense to order gymnastics < boxing < volleyball because on average volleyball players are taller than boxers who in turn tend to be taller than gymnasts.
Revised: X , it would make sense to order gymnastics < boxing < volleyball because on average volleyball players are taller than boxers who in turn tend to be taller than gymnasts.

Original: On the other hand, if the prediction of Y is based on the person’s strength, another ordering, volleyball < gymnastics < boxer, may be more suitable.
Revised: On the other hand, if the prediction of Y is based on the person’s strength, another ordering, volleyball < gymnastics < boxer, may be more suitable.

Original: In either case, once the ordering has been figured out, an ordinal regression can be applied to model and predict Y given X .
Revised: In either case, once the ordering has been figured out, an ordinal regression can be applied to model and predict Y given X .

Original: Of course, determining the ordering of Y could be subjective and tedious.
Revised: Of course, determining the ordering of Y could be subjective and tedious.

Original: The proposed COLP model is precisely designed to automatically find the best category ordering in an objective way.
Revised: The proposed COLP model is precisely designed to automatically find the best category ordering in an objective way.

Original: As expected, its model complexity is between multinomial regression and ordinal regression.
Revised: As expected, its model complexity is between multinomial regression and ordinal regression.

Original: The main objective of this paper is causal discovery for categorical data.
Revised: The main objective of this paper is causal discovery for categorical data.

Original: It turns out that the parsimony of COLP is quite useful in that regard – while causal models based on multinomial regression are non-identifiable, we prove that the proposed COLP-based causal models are identifiable under the causal Markov and causal sufficient assumptions.
Revised: It turns out that the parsimony of COLP is quite useful in that regard – while causal models based on multinomial regression are non-identifiable, we prove that the proposed COLP-based causal models are identifiable under the causal Markov and causal sufficient assumptions.

Original: Our experiments with synthetic and real data show that the proposed method outperforms state-of-the-art alternative methods.
Revised: Our experiments with synthetic and real data show that the proposed method outperforms state-of-the-art alternative methods.

Original:  Proposed Method
Revised:  Proposed Method

Original: We first introduce the classification model COLP in Section 2.1.
Revised: We first introduce the classification model COLP in Section 2.1.

Original: COLP may be of interest by itself as a new classifier but the focus of this paper is to build a causal model based on COLP, which is presented in Section 2.2.
Revised: COLP may be of interest by itself as a new classifier but the focus of this paper is to build a causal model based on COLP, which is presented in Section 2.2.

Original: 2.1 Classification with Optimal Label Permutation
Revised: 2.1 Classification with Optimal Label Permutation

Original: Let Y ∈ { 1 , . . .
Revised: Let Y ∈ { 1 , . . .

Original: , L } be a categorical response variable with L levels and let X =
Revised: , L } be a categorical response variable with L levels and let X =

Original: ( X 1 , . . .
Revised: ( X 1 , . . .

Original: , X S ) T be a S -dimensional predictor vector.
Revised: , X S ) T be a S -dimensional predictor vector.

Original: Note that if L = 2 , ordinal logistic regression, nominal logistic regression, and the proposed COLP are equivalent and hence hereafter we always assume L > 2 .
Revised: Note that if L = 2 , ordinal logistic regression, nominal logistic regression, and the proposed COLP are equivalent and hence hereafter we always assume L > 2 .

Original: Later, X will be dummy variables representing a categorical predictor with S levels but, for now, we present COLP for a general set of predictors.
Revised: Later, X will be dummy variables representing a categorical predictor with S levels but, for now, we present COLP for a general set of predictors.

Original: If Y is ordered, an ordinal regression is often used,
Revised: If Y is ordered, an ordinal regression is often used,

Original: [Equation]
Revised: [Equation]

Original: where F is some link function (e.g., standard normal or logistic CDF), γ 1 < · · · < γ L are a set of thresholds, and β ∈ R S are ordinal regression coefficients.
Revised: where F is some link function (e.g., standard normal or logistic CDF), γ 1 < · · · < γ L are a set of thresholds, and β ∈ R S are ordinal regression coefficients.

Original: Equation (1) implies the conditional probability distribution P ( Y = ℓ | X )
Revised: Equation (1) implies the conditional probability distribution P ( Y = ℓ | X )

Original: = F ( γ ℓ − X T β ) − F ( γ ℓ − 1 − X T β ) for ℓ ∈ { 1 , . . .
Revised: = F ( γ ℓ − X T β ) − F ( γ ℓ − 1 − X T β ) for ℓ ∈ { 1 , . . .

Original: , L }
Revised: , L }

Original: where γ 0 =
Revised: where γ 0 =

Original: −∞ , γ 1 = 0 (for parameter identifiability), and γ L = ∞ .
Revised: −∞ , γ 1 = 0 (for parameter identifiability), and γ L = ∞ .

Original: Therefore, effectively, the model complexity (i.e., the number of parameters) of an ordinal regression is L − 2 + S .
Revised: Therefore, effectively, the model complexity (i.e., the number of parameters) of an ordinal regression is L − 2 + S .

Original: If Y is nominal with no natural ordering, a multinomial (logistic) regression can be used instead,
Revised: If Y is nominal with no natural ordering, a multinomial (logistic) regression can be used instead,

Original: [Equation]
Revised: [Equation]

Original: where β ℓ are category-specific regression coefficients and, for parameter identifiability, β L = 0 .
Revised: where β ℓ are category-specific regression coefficients and, for parameter identifiability, β L = 0 .

Original: The effective model complexity is ( L − 1) × S , which is strictly greater than the model complexity of an ordinal regression, L − 2 + S for L > 2 and S > 1 .
Revised: The effective model complexity is ( L − 1) × S , which is strictly greater than the model complexity of an ordinal regression, L − 2 + S for L > 2 and S > 1 .

Original: Even though multinomial regression is obviously also applicable to ordinal data by simply ignoring the ordering, ordinal regression is often preferred over multinomial regression in this case because of parsimony.
Revised: Even though multinomial regression is obviously also applicable to ordinal data by simply ignoring the ordering, ordinal regression is often preferred over multinomial regression in this case because of parsimony.

Original: Here, we propose a new classification model, which is more parsimonious than multinomial regression and is useful beyond ordinal categorical data.
Revised: Here, we propose a new classification model, which is more parsimonious than multinomial regression and is useful beyond ordinal categorical data.

Original: The general idea is to introduce a permutation σ : { 1 , . . .
Revised: The general idea is to introduce a permutation σ : { 1 , . . .

Original: , L } (cid:55)→ { 1 , . . .
Revised: , L } (cid:55)→ { 1 , . . .

Original: , L } , which orders the categories so that the ordinal regression is applicable.
Revised: , L } , which orders the categories so that the ordinal regression is applicable.

Original: Specifically, we propose the following probability model,
Revised: Specifically, we propose the following probability model,

Original: [Equation]
Revised: [Equation]

Original: which is similar to ordinal regression (1) but with an important additional parameter σ ∈ Σ where Σ is the collection of all permutations of size L .
Revised: which is similar to ordinal regression (1) but with an important additional parameter σ ∈ Σ where Σ is the collection of all permutations of size L .

Original: Because any ordering σ and its reverse (cid:101) σ (i.e., σ ( i ) < σ ( j ) if and only if (cid:101) σ ( i ) > (cid:101) σ ( j ) ) would lead to equivalent ordinal regression models, for parameter identifiability, we assume σ (1) <
Revised: Because any ordering σ and its reverse (cid:101) σ (i.e., σ ( i ) < σ ( j ) if and only if (cid:101) σ ( i ) > (cid:101) σ ( j ) ) would lead to equivalent ordinal regression models, for parameter identifiability, we assume σ (1) <

Original: σ (2) .
Revised: σ (2) .

Original: Therefore, the effective size of σ is L − 2 because once σ (3) , . . .
Revised: Therefore, the effective size of σ is L − 2 because once σ (3) , . . .

Original: , σ ( L ) are fixed, σ (1) and σ (2) are fixed due to the contraint.
Revised: , σ ( L ) are fixed, σ (1) and σ (2) are fixed due to the contraint.

Original: Consequently, the overall complexity of the proposed COLP model is L − 2 + S + L − 2 = 2 L + S − 4 , which is less than the complexity of a multinomial regression, ( L − 1) × S , for L, S > 2 .
Revised: Consequently, the overall complexity of the proposed COLP model is L − 2 + S + L − 2 = 2 L + S − 4 , which is less than the complexity of a multinomial regression, ( L − 1) × S , for L, S > 2 .

Original: Similarly to the ordinal regression, (3) implies the conditional probability mass function,
Revised: Similarly to the ordinal regression, (3) implies the conditional probability mass function,

Original: [Equation]
Revised: [Equation]

Original: As we mentioned in Section 1, although a categorical variable may not have a natural ordering, for the purpose of modeling and prediction, they may be ordered in a meaningful way depending on the predictors.
Revised: As we mentioned in Section 1, although a categorical variable may not have a natural ordering, for the purpose of modeling and prediction, they may be ordered in a meaningful way depending on the predictors.

Original: The proposed COLP, by including ordering as a parameter, can automatically find the best ordering in an objective manner.
Revised: The proposed COLP, by including ordering as a parameter, can automatically find the best ordering in an objective manner.

Original: In addition, even for categorical variables that have natural orderings, the proposed COLP may still be preferred over both ordinal regression and multinomial regression.
Revised: In addition, even for categorical variables that have natural orderings, the proposed COLP may still be preferred over both ordinal regression and multinomial regression.

Original: For instance, in one of later real data examples, Y = shelf placement ∈ { 1 , 2 , 3 } (counting from the floor) and X = cereal manufacturer.
Revised: For instance, in one of later real data examples, Y = shelf placement ∈ { 1 , 2 , 3 } (counting from the floor) and X = cereal manufacturer.

Original: To predict Y based on X , it makes more sense to use a less natural ordering 1 < 3 < 2 for Y as shoppers are more likely to buy products on the middle shelf than either the top or bottom.
Revised: To predict Y based on X , it makes more sense to use a less natural ordering 1 < 3 < 2 for Y as shoppers are more likely to buy products on the middle shelf than either the top or bottom.

Original: In fact, when we ran COLP on this data, 1 < 3 < 2 was identified as the optimal ordering.
Revised: In fact, when we ran COLP on this data, 1 < 3 < 2 was identified as the optimal ordering.

Original: Moreover, COLP and the multinomial regression had the same goodness of fit, which was better than that of the ordinal regression.
Revised: Moreover, COLP and the multinomial regression had the same goodness of fit, which was better than that of the ordinal regression.

Original: COLP had the best out-of-sample prediction, followed by the ordinal regression, and the multinomial was the worst.
Revised: COLP had the best out-of-sample prediction, followed by the ordinal regression, and the multinomial was the worst.

Original: For this example, COLP had the right model complexity to achieve the best model fit as well as the best out-of-sample prediction.
Revised: For this example, COLP had the right model complexity to achieve the best model fit as well as the best out-of-sample prediction.

Original: 2.2 COLP-Based Causal Discovery
Revised: 2.2 COLP-Based Causal Discovery

Original: Next, we build a causal model based on COLP.
Revised: Next, we build a causal model based on COLP.

Original: Let Y ∈ { 1 , . . .
Revised: Let Y ∈ { 1 , . . .

Original: , L } and X ∈ { 1 , . . .
Revised: , L } and X ∈ { 1 , . . .

Original: , S } with
Revised: , S } with

Original: L, S > 2 .
Revised: L, S > 2 .

Original: The COLP-based causal model considers two competing causal hypotheses,
Revised: The COLP-based causal model considers two competing causal hypotheses,

Original: [Equation]
Revised: [Equation]

Original: with (observational) probability mass functions,
Revised: with (observational) probability mass functions,

Original: [Equation]
Revised: [Equation]

Original: where P X → Y ( X = s ) and P Y → X ( Y = ℓ ) are multinomial with probabilities
Revised: where P X → Y ( X = s ) and P Y → X ( Y = ℓ ) are multinomial with probabilities

Original: ω = ( ω 1 , . . . , ω S ) and ρ = ( ρ 1 , . .
Revised: ω = ( ω 1 , . . . , ω S ) and ρ = ( ρ 1 , . .

Original: , ρ L ) , and
Revised: , ρ L ) , and

Original: P X
Revised: P X

Original: → Y ( Y = ℓ | X = s ) and P Y
Revised: → Y ( Y = ℓ | X = s ) and P Y

Original: → X ( X = s | Y = ℓ ) take similar forms as (4),
Revised: → X ( X = s | Y = ℓ ) take similar forms as (4),

Original: [Equation]
Revised: [Equation]

Original: where X ∈ { 0 , 1 } S and Y ∈ { 0 , 1 } L are dummy variable representation of X and Y , and σ ∈ Σ and π ∈ Π are permutations of { 1 , . . .
Revised: where X ∈ { 0 , 1 } S and Y ∈ { 0 , 1 } L are dummy variable representation of X and Y , and σ ∈ Σ and π ∈ Π are permutations of { 1 , . . .

Original: , L } and { 1 , . . .
Revised: , L } and { 1 , . . .

Original: , S } .
Revised: , S } .

Original: In summary, causal model M 0 :
Revised: In summary, causal model M 0 :

Original: X → Y is parameterized by ( ω , β , γ , σ ) with γ =
Revised: X → Y is parameterized by ( ω , β , γ , σ ) with γ =

Original: ( γ 2 , . . . , γ L − 1 ) and β ∈ R S whereas M 1 : Y → X is parameterized by ( ρ , α , η , π ) with η = ( η 2 , . .
Revised: ( γ 2 , . . . , γ L − 1 ) and β ∈ R S whereas M 1 : Y → X is parameterized by ( ρ , α , η , π ) with η = ( η 2 , . .

Original: , η S − 1 ) and α ∈ R L .
Revised: , η S − 1 ) and α ∈ R L .

Original: Like regression, the proposed COLP-based casual model (complexity = 2 L + 2 S − 5 ) is more parsimonious than a saturated bivariate multinomial model (complexity =
Revised: Like regression, the proposed COLP-based casual model (complexity = 2 L + 2 S − 5 ) is more parsimonious than a saturated bivariate multinomial model (complexity =

Original: S
Revised: S

Original: × L − 1 ).
Revised: × L − 1 ).

Original: In fact, a multinomial causal model where P X
Revised: In fact, a multinomial causal model where P X

Original: → Y ( Y = ℓ | X = s ) is multinomial regression has the same complexity as the saturated model.
Revised: → Y ( Y = ℓ | X = s ) is multinomial regression has the same complexity as the saturated model.

Original: Therefore, a multinomial causal model is essentially just a reparameterization of a joint multinomial distribution, which of course can be factorized in both causal and anti-causal directions, and hence is not identifiable.
Revised: Therefore, a multinomial causal model is essentially just a reparameterization of a joint multinomial distribution, which of course can be factorized in both causal and anti-causal directions, and hence is not identifiable.

Original: Now, the question is: can the parsimonious COLP-based casual model break the symmetry?
Revised: Now, the question is: can the parsimonious COLP-based casual model break the symmetry?

Original: The answer is yes, which will be formally established in the next section.
Revised: The answer is yes, which will be formally established in the next section.

Original: →$ (&,() * + :& → ( * - :( → &
Revised: →$ (&,() * + :& → ( * - :( → &

Original: Saturated
Revised: Saturated

Original: MultinomialModel
Revised: MultinomialModel

Original: COLP-Based Causal Model !
Revised: COLP-Based Causal Model !

Original: (&,() & =& =& =( =0.
Revised: (&,() & =& =& =( =0.

Original: ( =0.
Revised: ( =0.

Original: ( =0.
Revised: ( =0.

Original: ((|&) & =& =& =( =0.
Revised: ((|&) & =& =& =( =0.

Original: ( =0.
Revised: ( =0.

Original: ( =0.
Revised: ( =0.

Original: (&|() ( =( =( =& =0.
Revised: (&|() ( =( =( =& =0.

Original: & =0.
Revised: & =0.

Original: & =0.
Revised: & =0.

Original: Although it is easy to find P ( X | Y ) and P ( Y ) for the anti-causal model M 1 : Y → X from the joint probability P ( X, Y ) , M 1 is no longer in the class of COLP-based causal models.
Revised: Although it is easy to find P ( X | Y ) and P ( Y ) for the anti-causal model M 1 : Y → X from the joint probability P ( X, Y ) , M 1 is no longer in the class of COLP-based causal models.

Original: Hence, if causal models are constrained to be COLP-based, the correct causal direction X
Revised: Hence, if causal models are constrained to be COLP-based, the correct causal direction X

Original: → Y can be identified.
Revised: → Y can be identified.

Original: 2.3 Identifiability
Revised: 2.3 Identifiability

Original: Before stating our main identifiability theorem, we first provide intuition as to why multinomial regression-based causal models are non-identifiable whereas the proposed COLP-based causal models are identifiable.
Revised: Before stating our main identifiability theorem, we first provide intuition as to why multinomial regression-based causal models are non-identifiable whereas the proposed COLP-based causal models are identifiable.

Original: As mentioned in Section 2.2, multinomial regression-based causal models are simply reparameterization of a saturated bivariate multinomial model whereas COLP-based causal models are more parsimonious.
Revised: As mentioned in Section 2.2, multinomial regression-based causal models are simply reparameterization of a saturated bivariate multinomial model whereas COLP-based causal models are more parsimonious.

Original: We represent such relation as a Venn diagram in Figure 1.
Revised: We represent such relation as a Venn diagram in Figure 1.

Original: For a given
Revised: For a given

Original: COLP-based causal model (represented by the dot in the inner ellipse)
Revised: COLP-based causal model (represented by the dot in the inner ellipse)

Original: , say M 0 :
Revised: , say M 0 :

Original: X → Y with
Revised: X → Y with

Original: X, Y ∈ { 1 , 2 , 3 } , its conditional probability P ( Y | X ) and marginal probability P ( X ) (represented by the probability tables at the bottom left corner) are determined by its specific parameter values, say ω
Revised: X, Y ∈ { 1 , 2 , 3 } , its conditional probability P ( Y | X ) and marginal probability P ( X ) (represented by the probability tables at the bottom left corner) are determined by its specific parameter values, say ω

Original: =
Revised: =

Original: 25 , 0 . 5) , γ = 1 , β = (1 , − 1 , 1) T , σ (1) = 1 , σ (2) = 3 , and σ (3)
Revised: 25 , 0 . 5) , γ = 1 , β = (1 , − 1 , 1) T , σ (1) = 1 , σ (2) = 3 , and σ (3)

Original: = 2 .
Revised: = 2 .

Original: The conditional and marginal probability distributions define the joint distribution P ( X, Y ) represented by the dot and the probability table at the top left corner.
Revised: The conditional and marginal probability distributions define the joint distribution P ( X, Y ) represented by the dot and the probability table at the top left corner.

Original: Now consider a causal model with a reversed direction
Revised: Now consider a causal model with a reversed direction

Original: M 1 : Y → X .
Revised: M 1 : Y → X .

Original: Since the joint distribution P ( X, Y ) can always factorize into P ( Y ) and P ( X | Y ) (represented by the probability tables at the top right corner), it is obvious that M 0 ≡ M 1 under such factorization.
Revised: Since the joint distribution P ( X, Y ) can always factorize into P ( Y ) and P ( X | Y ) (represented by the probability tables at the top right corner), it is obvious that M 0 ≡ M 1 under such factorization.

Original: But M 1 , represented by the dot in the outer ellipse, does not belong to the class of
Revised: But M 1 , represented by the dot in the outer ellipse, does not belong to the class of

Original: COLP-based causal models anymore.
Revised: COLP-based causal models anymore.

Original: In summary, when constrained to COLP-based causal models, this particular example of M 0 does not have an equivalent model.
Revised: In summary, when constrained to COLP-based causal models, this particular example of M 0 does not have an equivalent model.

Original: The identifiability theorem below shows that this is true in general.
Revised: The identifiability theorem below shows that this is true in general.

Original: Theorem 1 If there is no unmeasured confounder, the link function F ( · ) is a fixed real analytic function 1 , and F ′ ( · ) is nowhere zero, then for almost all ( ω , β , γ , σ ) , there does not exist ( ρ , α , η , π )
Revised: Theorem 1 If there is no unmeasured confounder, the link function F ( · ) is a fixed real analytic function 1 , and F ′ ( · ) is nowhere zero, then for almost all ( ω , β , γ , σ ) , there does not exist ( ρ , α , η , π )

Original: such that M 0 ≡ M 1 , i.e., P X → Y ( X = s, Y = ℓ ) =
Revised: such that M 0 ≡ M 1 , i.e., P X → Y ( X = s, Y = ℓ ) =

Original: P Y → X ( X = s, Y = ℓ ) for all ( s, l ) ∈ { 1 , . .
Revised: P Y → X ( X = s, Y = ℓ ) for all ( s, l ) ∈ { 1 , . .

Original: . , S } × { 1 , . . .
Revised: . , S } × { 1 , . . .

Original: , L } .
Revised: , L } .

Original: All proofs are provided in the Supplementary Material.
Revised: All proofs are provided in the Supplementary Material.

Original: No unmeasured confounder is a common assumption in prior causal discovery work for categorical data [Peters et al., 2010, Suzuki et al., 2014,
Revised: No unmeasured confounder is a common assumption in prior causal discovery work for categorical data [Peters et al., 2010, Suzuki et al., 2014,

Original: Liu and Chan, 2016, Cai et al., 2018, Compton et al., 2020].
Revised: Liu and Chan, 2016, Cai et al., 2018, Compton et al., 2020].

Original: The requirements on the link function
Revised: The requirements on the link function

Original: F ( · ) are quite mild; well-known link functions such as probit and logistic satisfy them.
Revised: F ( · ) are quite mild; well-known link functions such as probit and logistic satisfy them.

Original: Input: data ( x 1 , y 1 ) , . .
Revised: Input: data ( x 1 , y 1 ) , . .

Original: , ( x n , y n ) , initial parameters ω , β , γ , σ
Revised: , ( x n , y n ) , initial parameters ω , β , γ , σ

Original: Compute M ( σ ) = max ω , β , γ (cid:81) ni
Revised: Compute M ( σ ) = max ω , β , γ (cid:81) ni

Original: =1 P X → Y ( X = x i , Y =
Revised: =1 P X → Y ( X = x i , Y =

Original: y i | ω , β , γ , σ )
Revised: y i | ω , β , γ , σ )

Original: Set M ⋆ =
Revised: Set M ⋆ =

Original: M ( σ ) repeat
Revised: M ( σ ) repeat

Original: Initialize Improvement = false for all permutation σ ′ reachable from σ do
Revised: Initialize Improvement = false for all permutation σ ′ reachable from σ do

Original: Compute M ( σ ′ ) if M ( σ ′ ) > M ⋆ then
Revised: Compute M ( σ ′ ) if M ( σ ′ ) > M ⋆ then

Original: Set σ = σ ′ and M ⋆ =
Revised: Set σ = σ ′ and M ⋆ =

Original: M ( σ ′ )
Revised: M ( σ ′ )

Original: Set Improvement = true end if end for until Improvement is false
Revised: Set Improvement = true end if end for until Improvement is false

Original: Output: maximized likelihood M ⋆
Revised: Output: maximized likelihood M ⋆

Original: Next, we show that asymptotically we can correctly identify the true causal model.
Revised: Next, we show that asymptotically we can correctly identify the true causal model.

Original: Theorem 

Revised: Theorem

Original: If M 0 : X → Y is the true data generating model, the likelihood of M 0 is asymptotically greater than that of the anti-causal model M 1 : Y → X .
Revised: If M 0 : X → Y is the true data generating model, the likelihood of M 0 is asymptotically greater than that of the anti-causal model M 1 : Y → X .

Original: Theorems 1 and 2 suggest a simple causal discovery algorithm based on maximum likelihood estimation (MLE).
Revised: Theorems 1 and 2 suggest a simple causal discovery algorithm based on maximum likelihood estimation (MLE).

Original: For a dataset with n observations, ( x 1 , y 1 ) , . . .
Revised: For a dataset with n observations, ( x 1 , y 1 ) , . . .

Original: , ( x n , y n ) , we conclude M 0 :
Revised: , ( x n , y n ) , we conclude M 0 :

Original: X →
Revised: X →

Original: Y
Revised: Y

Original: if
Revised: if

Original: [Equation]
Revised: [Equation]

Original: and conclude M 1 : Y → X otherwise.
Revised: and conclude M 1 : Y → X otherwise.

Original: The MLE can be carried out in two steps.
Revised: The MLE can be carried out in two steps.

Original: In the first step, for every σ ∈ Σ , we maximize the likelihood over ω , β , γ through the standard MLE of ordinal regression by treating σ ( y 1 ) , . . .
Revised: In the first step, for every σ ∈ Σ , we maximize the likelihood over ω , β , γ through the standard MLE of ordinal regression by treating σ ( y 1 ) , . . .

Original: , σ ( y n ) as ordered labels, M ( σ ) = max ω , β , γ (cid:81) ni
Revised: , σ ( y n ) as ordered labels, M ( σ ) = max ω , β , γ (cid:81) ni

Original: =1 P X
Revised: =1 P X

Original: → Y ( X = x i , Y =
Revised: → Y ( X = x i , Y =

Original: y i | ω , β , γ , σ ) .
Revised: y i | ω , β , γ , σ ) .

Original: Then in the second step, we pick the largest M ( σ ) among all σ ∈ Σ .
Revised: Then in the second step, we pick the largest M ( σ ) among all σ ∈ Σ .

Original: This exhaustive search over all permutations is feasible when the number of categories is small.
Revised: This exhaustive search over all permutations is feasible when the number of categories is small.

Original: For categorical data with a moderately large number of categories, an iterative greedy search algorithm (Algorithm 1) can be used instead.
Revised: For categorical data with a moderately large number of categories, an iterative greedy search algorithm (Algorithm 1) can be used instead.

Original: At each iteration, we compute the MLE of ordinal regression for all the permutations that can be reached from the current permutation by switching the order of two elements.
Revised: At each iteration, we compute the MLE of ordinal regression for all the permutations that can be reached from the current permutation by switching the order of two elements.

Original: We replace the current permutation by the permutation with the largest increase in likelihood and stop the algorithm when the likelihood can no longer be improved.
Revised: We replace the current permutation by the permutation with the largest increase in likelihood and stop the algorithm when the likelihood can no longer be improved.

Original:  Experiments 3.1 Synthetic Data
Revised:  Experiments 3.1 Synthetic Data

Original: We first assessed the performance of the proposed COLP-based causal discovery method with three sets of synthetic data.
Revised: We first assessed the performance of the proposed COLP-based causal discovery method with three sets of synthetic data.

Original: For comparison, we considered two state-of-the-art categorical discovery methods based on hidden compact representation (HCR, [Cai et al., 2018]) and conditional entropy (CE, Compton et al.
Revised: For comparison, we considered two state-of-the-art categorical discovery methods based on hidden compact representation (HCR, [Cai et al., 2018]) and conditional entropy (CE, Compton et al.

Original: 3.1.1 Scenario 1: Small Number of Categories
Revised: 3.1.1 Scenario 1: Small Number of Categories

Original: We generated data with the number of categories L = S = 5 and varying sample size n = 50 , 100 , . . .
Revised: We generated data with the number of categories L = S = 5 and varying sample size n = 50 , 100 , . . .

Original: The true parameters were set as ω =
Revised: The true parameters were set as ω =

Original: (1 / 5 , 1 / 5 , 1 / 5 , 1 / 5 , 1 / 5) , β ∼ N (0 , I 5 ) , σ ( ℓ ) = ℓ, ∀ ℓ , and γ chosen to have balanced class size for each variable.
Revised: (1 / 5 , 1 / 5 , 1 / 5 , 1 / 5 , 1 / 5) , β ∼ N (0 , I 5 ) , σ ( ℓ ) = ℓ, ∀ ℓ , and γ chosen to have balanced class size for each variable.

Original: Both the exhaustive (COLPExhaustive) and greedy (COLP-Greedy) versions of the COLP-based causal discovery algorithm were applied.
Revised: Both the exhaustive (COLPExhaustive) and greedy (COLP-Greedy) versions of the COLP-based causal discovery algorithm were applied.

Original: The results based on 500 repeat simulations are summarized in Figure 2a.
Revised: The results based on 500 repeat simulations are summarized in Figure 2a.

Original: COLP-Exhaustive and COLP-Greedy had virtually the same accuracy in identifying the correct causal directions, both of which increased with the sample size, which empirically verified Theorems 1 and 2, and uniformly outperformed HCR and CE.
Revised: COLP-Exhaustive and COLP-Greedy had virtually the same accuracy in identifying the correct causal directions, both of which increased with the sample size, which empirically verified Theorems 1 and 2, and uniformly outperformed HCR and CE.

Original: We also computed the Kendall’s Tau between the estimated category
Revised: We also computed the Kendall’s Tau between the estimated category

Original: [Figure]
Revised: [Figure]

Original: [Figure]
Revised: [Figure]

Original: ordering and the true ordering.
Revised: ordering and the true ordering.

Original: Kendall’s Tau close to 1 indicates a good estimation.
Revised: Kendall’s Tau close to 1 indicates a good estimation.

Original: The average
Revised: The average

Original: Kendall’s Tau of COLP-Greedy is reported in Figure 3.
Revised: Kendall’s Tau of COLP-Greedy is reported in Figure 3.

Original: As sample size increased, the ordering estimation improved as expected.
Revised: As sample size increased, the ordering estimation improved as expected.

Original: In the Supplementary Material
Revised: In the Supplementary Material

Original: [Figure]
Revised: [Figure]

Original: we present two additional results under this scenario:
Revised: we present two additional results under this scenario:

Original: (i) we performed an ablation study to demonstrate the importance of learning the category ordering, and (ii) we investigated how estimation of causal direction and label permutation vary as the number of categories increases.
Revised: (i) we performed an ablation study to demonstrate the importance of learning the category ordering, and (ii) we investigated how estimation of causal direction and label permutation vary as the number of categories increases.

Original: 3.1.2 Scenario 2: Larger Number of Categories
Revised: 3.1.2 Scenario 2: Larger Number of Categories

Original: We now increased the number of categories to L = S = 10 while keeping all the other simulation parameters the same.
Revised: We now increased the number of categories to L = S = 10 while keeping all the other simulation parameters the same.

Original: We did not apply COLP-Exhaustive in this scenario.
Revised: We did not apply COLP-Exhaustive in this scenario.

Original: As shown in Figure 2b,
Revised: As shown in Figure 2b,

Original: COLP-Greedy outperformed HCR and CE across all sample sizes and the margins were wider than those in Scenario 1.
Revised: COLP-Greedy outperformed HCR and CE across all sample sizes and the margins were wider than those in Scenario 1.

Original: The ordering estimation had the similar increasing trend in Kendall’s Tau as sample size increased as in Scenario 1 (Figure 3).
Revised: The ordering estimation had the similar increasing trend in Kendall’s Tau as sample size increased as in Scenario 1 (Figure 3).

Original: 3.1.3 Scenario 3: Hidden Confounders
Revised: 3.1.3 Scenario 3: Hidden Confounders

Original: While our identifiability theory assumes no unmeasured confounders, we empirically tested the sensitivity of our method to the presence of confounders.
Revised: While our identifiability theory assumes no unmeasured confounders, we empirically tested the sensitivity of our method to the presence of confounders.

Original: We generated trivariate categorical data ( X, Y, Z ) from the following true causal graph with all the simulation parameters kept the same as in
Revised: We generated trivariate categorical data ( X, Y, Z ) from the following true causal graph with all the simulation parameters kept the same as in

Original: Scenario 1,
Revised: Scenario 1,

Original: X
Revised: X

Original: Y
Revised: Y

Original: Z
Revised: Z

Original: We applied COLP, HCR, and CE to ( X, Y ) only (i.e., Z became a hidden confounder).
Revised: We applied COLP, HCR, and CE to ( X, Y ) only (i.e., Z became a hidden confounder).

Original: As shown in Figures 2c and 3, COLP had the best performance and the estimation of causal directions and category orderings approached perfect recovery as sample size increased even in the presence of confounders.
Revised: As shown in Figures 2c and 3, COLP had the best performance and the estimation of causal directions and category orderings approached perfect recovery as sample size increased even in the presence of confounders.

Original: 3.2 Real Data
Revised: 3.2 Real Data

Original: We further evaluated the proposed COLP-based causal discovery method with four sets of public real categorical data: (i) Pittsburgh Bridges dataset, (ii)
Revised: We further evaluated the proposed COLP-based causal discovery method with four sets of public real categorical data: (i) Pittsburgh Bridges dataset, (ii)

Original: Abalone dataset, (iii) Tübingen Cause-Effect
Revised: Abalone dataset, (iii) Tübingen Cause-Effect

Original: Pairs, and (iv) a newly-created Categorical Cause-Effect Pairs.
Revised: Pairs, and (iv) a newly-created Categorical Cause-Effect Pairs.

Original: For comparison, we considered HCR and CE as before.
Revised: For comparison, we considered HCR and CE as before.

Original: For variables with more than six categories, only the greedy search was applied for COLP-based causal discovery.
Revised: For variables with more than six categories, only the greedy search was applied for COLP-based causal discovery.

Original: For variables with fewer categories, both exhaustive and greedy algorithms were applied, which generally produced the same results; therefore, we do not differentiate between the two implementations when reporting the results below for simplicity.
Revised: For variables with fewer categories, both exhaustive and greedy algorithms were applied, which generally produced the same results; therefore, we do not differentiate between the two implementations when reporting the results below for simplicity.

Original: 3.2.1 Pittsburgh Bridges Dataset
Revised: 3.2.1 Pittsburgh Bridges Dataset

Original: This dataset [Reich and Fenves, 1989] is available from the UCI Machine Learning Repository and was used in previous causal discovery work [Cai et al., 2018].
Revised: This dataset [Reich and Fenves, 1989] is available from the UCI Machine Learning Repository and was used in previous causal discovery work [Cai et al., 2018].

Original: It has 108 observations and the following 4 true cause-effect pairs: Erected (Crafts, Emerging, Mature, Modern)
Revised: It has 108 observations and the following 4 true cause-effect pairs: Erected (Crafts, Emerging, Mature, Modern)

Original: → Span (Short,
Revised: → Span (Short,

Original: Medium, Long), Material (Steel, Iron, Wood) → Span (Short, Medium, Long), Material → Lanes (1, 2, 4, 6), and Purpose (Aqueduct, Highway, Rail, Walk) → Type (Wood, Suspen, Simple-T, Arch,
Revised: Medium, Long), Material (Steel, Iron, Wood) → Span (Short, Medium, Long), Material → Lanes (1, 2, 4, 6), and Purpose (Aqueduct, Highway, Rail, Walk) → Type (Wood, Suspen, Simple-T, Arch,

Original: Cantilev, CONT-T).
Revised: Cantilev, CONT-T).

Original: In addition to HCR and CE, we also applied Markov equivalence class-based causal discovery algorithm, GRaSP [Lam et al., 2022], to all the variables.
Revised: In addition to HCR and CE, we also applied Markov equivalence class-based causal discovery algorithm, GRaSP [Lam et al., 2022], to all the variables.

Original: The results are presented in Table 1.
Revised: The results are presented in Table 1.

Original: COLP was able to correctly identify all 4 cause-effect pairs whereas HCR missed 1 pair, CE missed 2 pairs, and GRaSP correctly identified two direct causal links and two indirect causal links (i.e., directed paths with the correct directions).
Revised: COLP was able to correctly identify all 4 cause-effect pairs whereas HCR missed 1 pair, CE missed 2 pairs, and GRaSP correctly identified two direct causal links and two indirect causal links (i.e., directed paths with the correct directions).

Original: The effect variables of the first three pairs, Span and Lanes, have natural orderings, namely, Short <
Revised: The effect variables of the first three pairs, Span and Lanes, have natural orderings, namely, Short <

Original: Medium <
Revised: Medium <

Original: Long and 1 < 2 < 4 < 6 .
Revised: Long and 1 < 2 < 4 < 6 .

Original: The optimal orderings identified by COLP perfectly matched them (note that COLP does not take the natural ordering as an input).
Revised: The optimal orderings identified by COLP perfectly matched them (note that COLP does not take the natural ordering as an input).

Original: The effect variable, Type, of the last pair does not have an obvious natural ordering.
Revised: The effect variable, Type, of the last pair does not have an obvious natural ordering.

Original: The optimal ordering was estimated to be Simple-T <
Revised: The optimal ordering was estimated to be Simple-T <

Original: Cantilev < CONT-T <
Revised: Cantilev < CONT-T <

Original: Arch <
Revised: Arch <

Original: Wood < Suspen and the COLP regression coefficients under X
Revised: Wood < Suspen and the COLP regression coefficients under X

Original: → Y were estimated to be ˆ β Aqueduct = 2 . 90 , ˆ β Highway = 1 .
Revised: → Y were estimated to be ˆ β Aqueduct = 2 . 90 , ˆ β Highway = 1 .

Original: 03 , ˆ β Rail = − 1 .
Revised: 03 , ˆ β Rail = − 1 .

Original: and ˆ β Walk = 13 . 66 .
Revised: and ˆ β Walk = 13 . 66 .

Original: This ordering seems sensible considering that the predictor/cause was Purpose.
Revised: This ordering seems sensible considering that the predictor/cause was Purpose.

Original: For example, { Simple-T,
Revised: For example, { Simple-T,

Original: Cantilev, CONT-T } bridges are more likely to be used for rail roads whereas { Arch, Wood, Suspen } bridges are more likely to be used for walking.
Revised: Cantilev, CONT-T } bridges are more likely to be used for rail roads whereas { Arch, Wood, Suspen } bridges are more likely to be used for walking.

Original: Therefore, their ordering is consistent with the signs of ˆ β Rail (negative) and ˆ β Walk (positive).
Revised: Therefore, their ordering is consistent with the signs of ˆ β Rail (negative) and ˆ β Walk (positive).

Original: [Table]
Revised: [Table]

Original: 3.2.2 Abalone Dataset
Revised: 3.2.2 Abalone Dataset

Original: This dataset [Nash et al., 1994] is available from the UCI Machine Learning Repository and was used in previous research [Cai et al., 2018].
Revised: This dataset [Nash et al., 1994] is available from the UCI Machine Learning Repository and was used in previous research [Cai et al., 2018].

Original: It has 4177 observations and the following 3 true cause-effect pairs: Sex (male, female, infant)
Revised: It has 4177 observations and the following 3 true cause-effect pairs: Sex (male, female, infant)

Original: → Length, Sex → Diameter, and Sex → Height.
Revised: → Length, Sex → Diameter, and Sex → Height.

Original: We discretized
Revised: We discretized

Original: Length, Diameter, and Height into 5 categories at their 20%,40%,60%, and 80% quantiles.
Revised: Length, Diameter, and Height into 5 categories at their 20%,40%,60%, and 80% quantiles.

Original: As in
Revised: As in

Original: Section 3.2.1, we compared COLP with HCR, CE, and GRaSP.
Revised: Section 3.2.1, we compared COLP with HCR, CE, and GRaSP.

Original: The results are reported in Table 2.
Revised: The results are reported in Table 2.

Original: COLP was able to correctly identify all 3 cause-effect pairs whereas HCR missed 1 pair, CE missed all 3 pairs, and GRaSP correctly identified one direct causal relationship and one indirect causal relationship, and failed to determine the causal direction of one pair.
Revised: COLP was able to correctly identify all 3 cause-effect pairs whereas HCR missed 1 pair, CE missed all 3 pairs, and GRaSP correctly identified one direct causal relationship and one indirect causal relationship, and failed to determine the causal direction of one pair.

Original: Because all the effect variables were obtained by discretization at quantiles, they had natural orderings.
Revised: Because all the effect variables were obtained by discretization at quantiles, they had natural orderings.

Original: Again, in all cases, the optimal orderings identified by COLP perfectly matched them.
Revised: Again, in all cases, the optimal orderings identified by COLP perfectly matched them.

Original: [Table]
Revised: [Table]

Original: 3.2.3 Tübingen Cause-Effect Pairs
Revised: 3.2.3 Tübingen Cause-Effect Pairs

Original: This is a well-known causal benchmark dataset [Mooij et al., 2016]
Revised: This is a well-known causal benchmark dataset [Mooij et al., 2016]

Original: (version: 12/20/2017).
Revised: (version: 12/20/2017).

Original: We picked pair 52, 53, 54,
Revised: We picked pair 52, 53, 54,

Original: [Table]
Revised: [Table]

Original: and 105 for testing, which were rarely used in prior work because at least one of the variables in each pair is multivariate.
Revised: and 105 for testing, which were rarely used in prior work because at least one of the variables in each pair is multivariate.

Original: We applied K-means to each multivariate variable with
Revised: We applied K-means to each multivariate variable with

Original: K = 5 and used the cluster labels as a categorical variable, and discretized each univariate variable at 5 evenly spaced quantiles.
Revised: K = 5 and used the cluster labels as a categorical variable, and discretized each univariate variable at 5 evenly spaced quantiles.

Original: The results are shown in Table 3.
Revised: The results are shown in Table 3.

Original: COLP was able to correctly identify all 5 cause-effect pairs whereas
Revised: COLP was able to correctly identify all 5 cause-effect pairs whereas

Original: HCR missed 1 pair and CE missed 2 pairs.
Revised: HCR missed 1 pair and CE missed 2 pairs.

Original: The effect variables of Pairs 53 and 105 have natural orderings, which matched the optimal orderings identified by COLP.
Revised: The effect variables of Pairs 53 and 105 have natural orderings, which matched the optimal orderings identified by COLP.

Original: [Table]
Revised: [Table]

Original: ✓ ✓ ✓
Revised: ✓ ✓ ✓

Original: [Table]
Revised: [Table]

Original: ✓ ✓ ✓
Revised: ✓ ✓ ✓

Original: [Table]
Revised: [Table]

Original: ✓ ✗ ✗
Revised: ✓ ✗ ✗

Original: [Table]
Revised: [Table]

Original: ✓ ✓ ✗
Revised: ✓ ✓ ✗

Original: 3.2.4 Categorical Cause-Effect Pairs
Revised: 3.2.4 Categorical Cause-Effect Pairs

Original: The Tübingen Cause-Effect Pairs data are largely continuous and may not be the best benchmarks for categorical causal discovery.
Revised: The Tübingen Cause-Effect Pairs data are largely continuous and may not be the best benchmarks for categorical causal discovery.

Original: Hence, we created a categorical causal discovery benchmark dataset using a similar approach as in Mooij et al.
Revised: Hence, we created a categorical causal discovery benchmark dataset using a similar approach as in Mooij et al.

Original: Specifically, we searched for appropriate datasets in R packages MASS and datasets for which the pairwise causal relationships should be obvious from the context (e.g., treatment assignment causes treatment effect), and at least one of the variables in each pair is categorical.
Revised: Specifically, we searched for appropriate datasets in R packages MASS and datasets for which the pairwise causal relationships should be obvious from the context (e.g., treatment assignment causes treatment effect), and at least one of the variables in each pair is categorical.

Original: For non-categorical variable, we discretized it at 5 evenly spaced quantiles.
Revised: For non-categorical variable, we discretized it at 5 evenly spaced quantiles.

Original: The resulting dataset contains 33 categorical cause-effect pairs and is available in the R package
Revised: The resulting dataset contains 33 categorical cause-effect pairs and is available in the R package

Original: COLP .
Revised: COLP .

Original: The results are shown in Table 4.
Revised: The results are shown in Table 4.

Original: Overall, COLP, HCR, and CE were able to correctly identify 70%, 61%, and 52% causal-effect pairs, respectively.
Revised: Overall, COLP, HCR, and CE were able to correctly identify 70%, 61%, and 52% causal-effect pairs, respectively.

Original: In terms of the ordering estimation, some results were interesting.
Revised: In terms of the ordering estimation, some results were interesting.

Original: For example, as mentioned in Section 2.1, for the "MASS::UScereal" data, the ordering of Y = shelf placement ∈ { 1 , 2 , 3 } was estimated to be 1 < 3 < 2 , which matches the fact that middle shelf is the most popular, followed by the top shelf, and the bottom shelf is the least popular.
Revised: For example, as mentioned in Section 2.1, for the "MASS::UScereal" data, the ordering of Y = shelf placement ∈ { 1 , 2 , 3 } was estimated to be 1 < 3 < 2 , which matches the fact that middle shelf is the most popular, followed by the top shelf, and the bottom shelf is the least popular.

Original: In fact, under the correct causal direction X → Y , COLP was better than ordinal and multinomial regressions in terms of both goodness of fit (via within-sample prediction) and out-of-sample prediction (via leave-one-out cross-validation)
Revised: In fact, under the correct causal direction X → Y , COLP was better than ordinal and multinomial regressions in terms of both goodness of fit (via within-sample prediction) and out-of-sample prediction (via leave-one-out cross-validation)

Original: [Table] [Table]
Revised: [Table] [Table]

Original:  Conclusion
Revised:  Conclusion

Original: There are a few limitations of the current work.
Revised: There are a few limitations of the current work.

Original: First, our identifiability theory assumes no unmeasured confounders.
Revised: First, our identifiability theory assumes no unmeasured confounders.

Original: Although our empirical studies suggested that the proposed method was relatively robust to the presence of confounders, it would be interesting to theoretically investigate the identifiability under this scenario.
Revised: Although our empirical studies suggested that the proposed method was relatively robust to the presence of confounders, it would be interesting to theoretically investigate the identifiability under this scenario.

Original: Second, we have focused on bivariate causal discovery.
Revised: Second, we have focused on bivariate causal discovery.

Original: Extending it to multivariate cases would broaden the applicability of the proposed method.
Revised: Extending it to multivariate cases would broaden the applicability of the proposed method.

Original: Third, the categorical cause-effect pairs dataset can be expanded by surveying more publicly available data
Revised: Third, the categorical cause-effect pairs dataset can be expanded by surveying more publicly available data

Original: [Table]
Revised: [Table]

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

Original: This research was partially supported by NSF DMS-2112943 and NSF DMS-1918851.
Revised: This research was partially supported by NSF DMS-2112943 and NSF DMS-1918851.

Original: We appreciate the constructive comments from anonymous reviewers, which helped improve the paperChecklist
Revised: We appreciate the constructive comments from anonymous reviewers, which helped improve the paper

Original: For all authors... (a) Do the main claims made in the abstract and introduction accurately reflect the paper’s contributions and scope?

Original: [Yes] (b) Did you describe the limitations of your work?

Original: [Yes] See Section 4.

Original: (c) Did you discuss any potential negative societal impacts of your work?

Original: [N/A] (d) Have you read the ethics review guidelines and ensured that your paper conforms to them?

Original: [Yes] 2.

Original: If you are including theoretical results... (a) Did you state the full set of assumptions of all theoretical results?

Original: [Yes] (b) Did you include complete proofs of all theoretical results?

Original: [Yes] 3.

Original: If you ran experiments... (a) Did you include the code, data, and instructions needed to reproduce the main experimental results (either in the supplemental material or as a URL)?

Original: [Yes] An R package is submitted as supplemental material (b) Did you specify all the training details (e

Original: g., data splits, hyperparameters, how they were chosen)?

Original: [Yes] (c) Did you report error bars (e

Original: g., with respect to the random seed after running experiments multiple times)?

Original: [Yes]

Original: (d) Did you include the total amount of compute and the type of resources used (e.g., type of GPUs, internal cluster, or cloud provider)?

Original: [No] The focus of this paper is identifiability and the computation is quite fast and straightforward.

Original: If you are using existing assets (e.g., code, data, models) or curating/releasing new assets... (a) If your work uses existing assets, did you cite the creators?

Original: [Yes] (b) Did you mention the license of the assets?

Original: [N/A] (c) Did you include any new assets either in the supplemental material or as a URL?

Original: [Yes] (d) Did you discuss whether and how consent was obtained from people whose data you’re using/curating?

Original: [N/A] (e) Did you discuss whether the data you are using/curating contains personally identifiable information or offensive content?

Original: [N/A] 5.

Original: If you used crowdsourcing or conducted research with human subjects... (a) Did you include the full text of instructions given to participants and screenshots, if applicable?

Original: [N/A] (b) Did you describe any potential participant risks, with links to Institutional Review Board (IRB) approvals, if applicable?

Original: [N/A] (c) Did you include the estimated hourly wage paid to participants and the total amount spent on participant compensation?

Original: [N/A]