2
$\begingroup$

a) Is there any way to prove that you cannot compute a probability difference when you know a logit difference?

b)In general, is there some acceptable way to convert distances in logodds space to distances in probability space? I have a bound for a difference of logits ($logit(p_1)-logit(p_2))$ when my problem calls for a bound in $p_1-p_2$, and I find no straightforward way to bound this difference.

$\endgroup$
1
  • 2
    $\begingroup$ Just try one or two examples: unless they are extremely carefully chosen, they will turn out to be counterexamples. $\endgroup$
    – whuber
    Commented Sep 18, 2018 at 14:51

1 Answer 1

4
$\begingroup$

Here are two pairs of probabilities with $\operatorname{logit} p_1 - \operatorname{logit} p_2$ equal but $p_1 - p_2$ not equal:

  • $p_1 = \tfrac{3}{4}$, $p_2 = \tfrac{1}{2}$
    • $p_1 - p_2 = \tfrac{1}{4}$
    • $\operatorname{logit} p_1 - \operatorname{logit} p_2 = \ln 3$
  • $p_1 = \tfrac{9}{10}$, $p_2 = \tfrac{3}{4}$
    • $p_1 - p_2 = \tfrac{3}{20}$
    • $\operatorname{logit} p_1 - \operatorname{logit} p_2 = \ln 3$
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.