Skip to content

Commit

Permalink
Figure name fix [EN]14-1.md (#701)
Browse files Browse the repository at this point in the history
Issue #461
  • Loading branch information
marofmar authored Dec 11, 2020
1 parent 89d785d commit b6c9c3b
Showing 1 changed file with 2 additions and 2 deletions.
4 changes: 2 additions & 2 deletions docs/en/week14/14-1.md
Original file line number Diff line number Diff line change
Expand Up @@ -79,7 +79,7 @@ Let’s assume that $Z_1$, $Z_2$, and $Y_1$ are discrete binary variables, and $
However, we notice that for a given $X$, $E_a$ only has two possible input configurations: $Z_1 = 0$ and $Z_1 = 1$. Similarly, $E_b$ and $E_c$ only have 4 possible input configurations, and $E_d$ has 6. Hence,
there is no need for more than $2 + 4 + 4 + 6 = 16$ single factor evaluations.

Hence, we can pre compute the 16 factor values, and put them on the arcs in a trellis as shown in Figure 19 (bottom).
Hence, we can pre compute the 16 factor values, and put them on the arcs in a trellis as shown in Figure 5 (bottom).

The nodes in each column represent the possible values of a single variable. Each edge is weighted by the output energy of the factor for the corresponding values of its input variables. With this representation, a single path from the start node to the end node represents one possible configuration of all the variables. The sum of the weights along a path is equal to the total energy for the corresponding configuration. Therefore, the inference problem can be reduced to searching for the **shortest path** in this graph. This can be performed using a dynamic programming method such as the Viterbi algorithm, or the A\* algorithm. The cost is proportional to the number of edges (16), which is exponentially smaller than the number of paths in general.

Expand All @@ -98,7 +98,7 @@ However, it only applies to factor graphs that are bipartite trees (with no loop
Figure 6.
</center>

The factor graph shown in Figure 20 is a log domain factor graph for linear structured models ("simple energy-based factor graphs" we are talking about)
The factor graph shown in Figure 6 is a log domain factor graph for linear structured models ("simple energy-based factor graphs" we are talking about)

Each factor is a linear function of the trainable parameters. It depends on the input $X$ and on a pair of individual labels $(Y_m, Y_n)$. In general, each factor could depend on more than two individual labels, but we will limit the discussion to pairwise factors to simplify the notation:

Expand Down

0 comments on commit b6c9c3b

Please sign in to comment.