24 research outputs found

    Confounding Equivalence in Causal Inference

    Full text link
    The paper provides a simple test for deciding, from a given causal diagram, whether two sets of variables have the same bias-reducing potential under adjustment. The test requires that one of the following two conditions holds: either (1) both sets are admissible (i.e., satisfy the back-door criterion) or (2) the Markov boundaries surrounding the manipulated variable(s) are identical in both sets. Applications to covariate selection and model testing are discussed.Comment: Appears in Proceedings of the Twenty-Sixth Conference on Uncertainty in Artificial Intelligence (UAI2010

    An algorithm for finding a shortest vector in a two-dimensional modular lattice

    Get PDF
    AbstractLet 0 < a, b < d be integers with a ≠ b. The lattice Ld(a, b) is the set of all multiples of the vector (a, b) modulo d. An algorithm is presented for finding a shortest vector in Ld(a, b). The complexity of the algorithm is shown to be logarithmic in the size of d when the number of arithmetical operations is counted

    Fibonacci encoding—To combat time dither in digital transmission

    No full text

    Confounding Equivalence in Causal Inference

    No full text
    The paper provides a simple test for deciding, from a given causal diagram, whether two sets of variables have the same bias-reducing potential under adjustment. The test requires that one of the following two conditions holds: either (1) both sets are admissible (i.e., satisfy the back-door criterion) or (2) the Markov boundaries surrounding the manipulated variable(s) are identical in both sets. Applications to covariate selection and model testing are discussed
    corecore