If we say ”X will happen if and only if Y1 and Y2 and
Y3… all happen, so we estimate P(Y1) and P(Y2|Y1)
and P(Y3|Y1,Y2) &c, and then multiply them together to estimate P(X)=P(Y1)⋅P(Y2|Y1)⋅P(Y3|Y2,Y1⋅)⋅…”, do we usually get a probability that is close to P(X)? Does this improve forecasts where one tries to estimate P(X) directly?
Decomposition methods are designed to improve accuracy by splitting
the judgmental task into a series of smaller and cognitively less
demanding tasks, and then combining the resulting judgements. Armstrong a(2001) distinguishes between decomposition, where the breakdown of the task is multiplicative (e.g. sales forecast=market size forecast×market share forecast), and segmentation, where it is additive (e.g. sales forecast=Northern region forecast+Western region forecast+Central region forecast), but we will use the term for both approaches here. Surprisingly, there has been
relatively little research over the last 25 years into the value of decomposition and the conditions under which it is likely to improve accuracy. In only a few cases has the accuracy of forecasts resulting from decomposition been tested against those of control groups making forecasts holistically. One exception is Edmundson (1990) who found that for a time series extrapolation task, obtaining separate estimates of the trend, seasonal and random components and then combining these to obtain forecasts led to greater accuracy than could be obtained from holistic forecasts. Similarly, Webby, O’Connor and Edmundson (2005) showed that, when a time series was disturbed in some periods by several simultaneous special events, accuracy was greater when forecasters were required to make separate estimates for the effect of each event, rather than estimating the combined effects holistically. Armstrong and Collopy (1993) also constructed more accurate forecasts by structuring the selection and weighting of statistical forecasts around the judge’s knowledge of separate factors that influence the trends in time series (causal forces).
Many other proposals for decomposition methods have been based on an act of faith that breaking down judgmental tasks is bound to improve accuracy or upon the fact that decomposition yields an audit trail and hence a defensible rationale for the forecasts (Abramson & Finizza, 1991;
Bunn & Wright, 1991;
Flores, Olson, & Wolfe,
1992;
Saaty & Vargas, 1991; Salo & Bunn, 1995;
Wolfe & Flores,
1990).
Yet, as Goodwin and Wright (1993) point out, decomposition is not guaranteed to improve accuracy and may actually reduce it when the decomposed judgements are psychologically more complex or less familiar than holistic judgements, or where the increased number of judgements required by the decomposition induces fatigue.
(Emphasis mine).
The types of decomposition described here seem quite different from
the ones used in the sources above: Decomposed time series are quite
dissimilar to multiplied probabilities for binary predictions, and in combination with the conceptual counter-arguments the evidence appears quite weak.
It appears as if a team of a few (let’s say 4) dedicated forecasters could
run a small experiment to determine whether multiplicative decomposition for binary forecasts a good method, by randomly spending 20 minutes either making explicitely decomposed forecasts or control forecasts (although the exact method for control needs to be elaborated on). Working in parallel, making 70 forecasts should take 70 forecasts⋅1hr3 forecasts⋅14≈5.8hr less than 6 hours, although it’d be useful to search for more recent literature on the question.
There is Little Evidence on Question Decomposition
If we say ”X will happen if and only if Y1 and Y2 and Y3… all happen, so we estimate P(Y1) and P(Y2|Y1) and P(Y3|Y1,Y2) &c, and then multiply them together to estimate P(X)=P(Y1)⋅P(Y2|Y1)⋅P(Y3|Y2,Y1⋅)⋅…”, do we usually get a probability that is close to P(X)? Does this improve forecasts where one tries to estimate P(X) directly?
This type of question decomposition (which one could call multiplicative decomposition) appears to be a relatively common method for forecasting, see Allyn-Feuer & Sanders 2023, Silver 2016, Kaufman 2011, Carlsmith 2022 and Hanson 2011, but there have been conceptual arguments against this technique, see Yudkowsky 2017, AronT 2023 and Gwern 2019, which all argue that it reliably underestimates the probability of events.
What is the empirical evidence for decomposition being a technique that improves forecasts?
Lawrence et al. 2006 summarize the state of research on the question:
(Emphasis mine).
The types of decomposition described here seem quite different from the ones used in the sources above: Decomposed time series are quite dissimilar to multiplied probabilities for binary predictions, and in combination with the conceptual counter-arguments the evidence appears quite weak.
It appears as if a team of a few (let’s say 4) dedicated forecasters could run a small experiment to determine whether multiplicative decomposition for binary forecasts a good method, by randomly spending 20 minutes either making explicitely decomposed forecasts or control forecasts (although the exact method for control needs to be elaborated on). Working in parallel, making 70 forecasts should take 70 forecasts⋅1hr3 forecasts⋅14≈5.8hr less than 6 hours, although it’d be useful to search for more recent literature on the question.