Feature request: log matrix product about math HOT 6 OPEN

Thanks, @mhollanders. That looks like a reasonable function to implement. If you want to implement directly in Stan, this form will be more efficient.

/**
   * Return the natural logarithm of the product of the elementwise exponentiation of the specified matrices.  
   *
   * @param a first matrix
   * @param b second matrix
   * @return  log(exp(a) * exp(b))
   * @throws reject if cols(a) != rows(b)
   */
  matrix log_product_exp(matrix a, matrix b) {
    int M = rows(a);
    int K = cols(a);
    int N = cols(b);
    if (rows(N) != K) reject("matrices must conform for multiplication");
    matrix[M, K] a_tr = a';
    matrix[M, N] c;
    for (n in 1:N)
      for (m in 1:M)
        c[m, n] = log_sum_exp(a_tr[ , m] + b[ , n]);
    return c;
  }

That's because (a) it's more efficient to transpose the matrix all at once rather than a row at a time because the underlying algorithm can use cache-sensitive blocking, and (b) because matrices are column major in Stan, so it's more efficient to travers them in the revised order.

Unlike in R, return isn't a function, so it doesn't need parens. I also rewrote the doc to conform to our expected style, which describes what a function returns as explicitly as possible in one sentence. Along with this, I changed the name to more closely follow log-sum-exp.

In Stan, to extend this to row vectors and vectors, we'llneed an additional signature that is specific about return type (here I chose vector, but it could've been row_vector and it can't be both).

real log_product_exp(row_vector a, vector b);

It'll be more efficient to rewrite this function than delegate to the matrix version in Stan. This could also be done as an outer product of (vector, row_vector).

P.S. We have a built-in HMM distribution implementing the forward/backward algorithm under the hood if you have a standard HMM.

from math.

Thanks for the prompt response and tips, @bob-carpenter, I have made the changes to my code for efficiency! FYI, my HMM is a bit more complex but it's good to see those HMM functions built-in!

from math.

I'm curious about the added complexity and how we might improve our interface. One thing we didn't support well was varying transition matrices involving predictors, whereas I know those are things that show up in, say, moveHMM in R, which is popular in ecology (we tested against some of their simpler examples when setting up our HMM interfaces).

from math.

P.S. I hope you caught my bugs varying m/n to I/j! I'll go back and edit the code for coherence.

from math.

Hey, firstly, yes I did catch the bugs.

For my model, I firstly just generate new TPMs for each individual because there are very often individual-by-time varying covariates, such as individual infection intensity in disease models. Secondly, this model is sort of a doubly nested HMM (there's probably a better term that exists). The idea is that ecological transitions (such as mortality and infection state transitions) occur between so-called primary occasions. Within each primary occasion, multiple replicated secondary surveys occur. In my disease example, multiple surveys are conducted and during each capture, a sample is collected to determine infection status. However, we get both false-negatives and false-positives in the sampling process. Therefore, both the ecological states (alive and uninfected/infected, dead) and possible observed states (detected and uninfected/infected, not detected) are (partially) latent. Finally, for each sample that's collected, it's subjected to multiple diagnostic runs to determine whether that sample was infected; once again, there are false-negatives and false-positives in this process too. Note that this is another place where time-varying individual covariates are included; the diagnostic runs inform the latent sample infection intensity, and the (sometimes) replicated sample infection intensities inform the latent individual infection intensities. These infection intensities are used to model the detection probabilities of the sampling and diagonstic processes.

If you check out my first post in this thread, you can see this model in Stan code. Otherwise, here I have it written in equations (with latent states).

Actually, one thing that's really common with HMMs is unequal time intervals. You might consider adding a continuous time variation as a Stan functions, where you simply take the transition rate matrix (TRM), multiply it by the time interval between (primary) occasions, and matrix exponentiate it to yield the transition probability matrix (I do this in my model too).

from math.

Thanks for the clarification. I'll reply in Discourse.

from math.