The Generalized Product Rule

post by aysajan · 2021-06-08T16:39:05.029Z · LW · GW · 7 comments

Contents

  Summary
None
7 comments

Imagine we have a company with investment projects A, B, C,....For instance, A might be a new high-speed Internet service, B might be a new advanced computer, C might be a new inventory management software, etc. We are interested in calculating the total return from these investments at the company. This calculation could be fairly complicated since returns are context-dependent - e.g., new computer B might have higher return in the context of new Internet service A than it would without the new Internet service. But let’s assume that the returns satisfy a few reasonable properties. 

1. The total return can be calculated from the return of each individual project given projects before it - e.g., the return of Internet service alone, the computer given the Internet service, the software given the computer and internet, etc.
2. If the return of one project increases (given projects before it) while everything else stays the same, then the total return increases. For instance, if the Internet service gets cheaper, then the return of project A should increase with everything else the same. As a result, the overall return should increase.
3. We can group projects into subprojects without changing the overall return. For instance, we could think of the Internet service and computer as a single project, or we could think of the computer and software as a single project, and either way the total return should stay the same.

Surprisingly, given just these three properties, we can conclude that returns obey a “product rule” similar to the product rule in probability theory.

$$w\left[R\right(A,B\left)\right]=w\left[R\right(A\left)\right]w\left[R\right(B|A\left)\right]$$

where $w$ is some transformation of returns (e.g., it could be log-return, return-squared, etc.)

This is essentially the first step in Cox’s Theorem, a theorem used (most notably by Jaynes) to ground the logicalist interpretation of probability. But as this post will illustrate, core ideas of Cox’s Theorem apply to many real-world systems which we don’t usually think of as “probability theory”.

Let’s unpack those assumptions a bit more for our investment return example by defining explicit variables on projects and returns. The three key properties are:

1. Return $R(A,B)$ of A and B together can be computed from the return $R\left(A\right)$ of A alone and the return $R\left(B|A\right)$ of B given A is done. For instance, the return on new high-speed Internet service and new computer together can be calculated from the return on the Internet service alone and the return on the computer given the Internet. Formally, $R(A,B)=F\left[R\right(A),R(B|A\left)\right]$for some function $F$.
2. If the return $R\left(A\right)$ goes up without changing $R\left(B|A\right)$, then the total return $R(A,B)$ of A and B together increases, and the same conclusion holds for $R\left(B|A\right)$ increasing with $R\left(A\right)$ unchanged. For instance, if the cost of high-speed Internet service goes down, then the return $R\left(A\right)$ presumably increases without changing the return $R\left(B|A\right)$ of the new computer given the Internet service, and this should increase the overall return $R(A,B)$. Formally, $F$ is increasing in both arguments.
3. We can group projects A and B, or B and C into subprojects without changing the overall return $R(A,B,C)$ of all three. For instance, if we want to compute total return $R(A,B,C)$ on new Internet service, computer and software, we could group together the internet and computer as one hardware-and-network project, then compute $R(A,B,C)$ from $R(A,B)$ (hardware-and-network return) along with $R(C|A,B)$ (return on the software given the hardware-and-network). Alternatively, we could instead group the computer and software as one hardware-and-software project with return $R(B,C|A)$, and we should still get the same answer for the return of all three projects together. Formally, $R(A,B,C)=F\left[R\right(A,B),R(C|A,B\left)\right]=F\left[R\right(A),R(B,C|A\left)\right]$.

The third rule implies that $F$ is associative. The key idea we derive here is that all one-dimensional, increasing and associative functions are either multiplication or some transformation of multiplication (e.g., addition/subtraction is log-transformation of multiplication).

Thus we get a product rule:

$$w\left[R\right(A,B\left)\right]=w\left[R\right(A\left)\right]w\left[R\right(B|A\left)\right]$$

where $w$ is some transformation (reversible) of $R$.

More generally, to derive the product rule, we need some objects of interest like A, B, C,..., which serves as input. We also need some kind of real-valued measurement $R$ of those objects. Then the core requirements for the product rule are:

• $R(A,B)$ is a function of $R\left(A\right)$ and $R\left(B|A\right)$:

$$R(A,B)=F\left[R\right(A),R(B|A\left)\right]$$

for some $F$.

• F is increasing with respect to both arguments:

If

$$R\left(A^{\prime }\right)>R\left(A\right),$$$$R\left(B|A^{\prime }\right)=R\left(B|A\right),$$

then

$$R(A^{\prime },B)>R(A,B).$$

Or, alternatively, if

$$R\left(B^{\prime }|A\right)>R\left(B|A\right),$$

R(A)=R(A),

then

$$R(A,B^{\prime })>R(A,B).$$

• We can group objects together without changing the value of measurement $R$:

$R(A,B,C)=F\left[R\right(A,B),R(C|A,B\left)\right]=F\left[R\right(A),R(B,C|A\left)\right]$

(Note that for the last assumption, we allow systems in which objects need to be kept in the same order - i.e., A before B before C. This is actually more general than the requirement for the product rule in probability theory, in which the objects are boolean logic variables, so “A and B” = “B and A”. If reordering is allowed, then our generalized-product-rule becomes generalized-Bayes-rule.)

The third assumption implies that $F$ is associative. The second implies that it’s increasing. The first implies that it’s one-dimensional. So, we get the generalized-product-rule.

What does this look like in the context of other real-world systems?

Example 1: Suppose I have an investment portfolio with stock A and bond B, and I want to calculate the standard deviation of portfolio return $R(A,B)$ as a proxy for risk measurement. This calculation is not trivial due to potential correlation of returns between stocks and bonds. For instance, the risk (measured in standard deviation) of investing in stocks alone is usually higher than the risk of investing in a portfolio with stocks and bonds. Let’s assume the risks exhibit three properties:

1. Portfolio risk $R(A,B)$ of stock A and bond B can be calculated from risk $R\left(A\right)$ of stock alone and incremental risk $R\left(B|A\right)$ (positive or negative) of adding bond B given stock A already in the portfolio.
2. If the risk $R\left(A\right)$ of the stock rises without changing the incremental risk $R\left(B|A\right)$, then the portfolio risk $R(A,B)$ rises.
3. Let’s consider adding another asset C, an 8-week T-Bills (a type of cash-equivalents) to the investment portfolio. If we’re computing new portfolio risk of stock A, bond B, and T-Bills C, then we could group stock and bond together as one sub-portfolio, and compute $R(A,B,C)$ from $R(A,B)$ (non-cash-asset) along with $R(C|A,B)$ (incremental risk of adding T-Bills given the non-cash-asset). Alternatively, we could instead group the bond and T-Bills into one portfolio (non-equity-asset) with risk $R(B,C|A)$, and we still get the same risk for all three assets together.

As a result, we can apply the product rule to investment risks:

$$w\left[R\right(A,B\left)\right]=w\left[R\right(A\left)\right]w\left[R\right(B|A\left)\right],$$

where $w$ is some transformation of incremental risk (e.g.,  exponentiated assuming that those incremental risks add).

Example 2: Let’s look at a different system in which we’re interested in calculating the contribution in points made by basketball players A, B, C,... in a game relative to total points made by the team. For instance, $R\left(A\right)$ could be 30%, meaning Stephen Curry contributes 30% of the total team points in a game, $R\left(B\right)$ could be 25%, meaning Klay Thompson contributes 25% of the total points made, etc. Again, we assume three properties:

1. The points contribution $R(A,B)$ of Stephen Curry and Klay Thompson together on the court can be calculated from the contribution $R\left(A\right)$ of Stephen Curry alone and incremental contribution $R\left(B|A\right)$ of Klay Thompson given Stephen Curry on the court.
2. If the contribution $R\left(A\right)$ of Stephen Curry increases without changing the incremental contribution $R\left(B|A\right)$, then the overall contribution $R(A,B)$ to the team increases as well.
3. We can group Stephen Curry and Klay Thomspon together as one “splash” player, and compute $R(A,B,C)$ from $R(A,B)$ (contribution of the “splash”) along with $R(C|A,B)$ (incremental contribution of Draymond Green given the “splash”). Alternatively, we could group Klay Thomson and Draymond Green as one big-man player with the contribution $R(B,C|A)$, and we will get the same total contribution for all three players together on the court.

Thus, we can have the product rule applied to basketball players’ shooting percentage:

$$w\left[R\right(A,B\left)\right]=w\left[R\right(A\left)\right]w\left[R\right(B|A\left)\right]$$

where $w$ is some transformation of player contribution.

Example 3: Let’s consider a modified version of the classic traveling salesman problem in theoretical computer science and operations research. We’re interested in finding the shortest travel time from an origin to cities A, B, C, …. Presumably the shortest travel time satisfy three assumptions:

1. The shortest time $R(A,B)$ of visiting cities A and B exactly once from origin can be computed from $R\left(A\right)$ of visiting city A and added time $R\left(B|A\right)$ of visiting city B given we already visited city A.
2. If the shortest time $R\left(A\right)$ of visiting city A increases without changing the additional travel time $R\left(B|A\right)$, then the total traveling time $R(A,B)$ of visiting both city A and B increases.
3. Let's add another city C to our travel plan. We can group city A and B together as one region, and compute $R(A,B,C)$ of shortest travel time to visit A, B, and C exactly once from $R(A,B)$ of visiting the region with cities A and B along with $R(C|A,B)$ (additional time it adds to visit city C along with city A and B to the total trip time). We could also instead group city B and C together with shortest travel time $R(B,C|A)$, and we will get the same answer for visiting every city exactly once in our trip.

With these three assumption above, we could apply the generalized product rule to the shortest travel time problem:

$$w\left[R\right(A,B\left)\right]=w\left[R\right(A\left)\right]w\left[R\right(B|A\left)\right],$$

where $w$ is some transformation (reversible) of shortest travel time (e.g., exponentiated shortest travel time).

Summary

The product rule in probability, $p\left(AB\right)=p\left(A\right)p\left(B|A\right)$, states that the probability p(AB) of both A and B are true can be calculated by using probability $p\left(A\right)$ of A being true alone and probability $p\left(B|A\right)$ of B being true given A is true.  The conditions of the product rule suggest possible avenues to extend the traditional product rule to deal with things that are not restricted to logical boolean type. In particular, this post suggests continuing to use the product rule to represent real-valued measurements of objects A, B, C,... that satisfy a few fairly reasonable properties and proposes a generalized form of the product rule $w\left[R\right(A,B\left)\right]=w\left[R\right(A\left)\right]w\left[R\right(B|A\left)\right]$. $R$ is some kind of real-number measurement and $w$ is some transformation of $R$. For instance, in the company investment project example we have $w\left[R\right(A,B\left)\right]=w\left[R\right(A\left)\right]w\left[R\right(B|A\left)\right]$ where $R$ represents the project return and $w$ can be log return.

7 comments

Comments sorted by top scores.