You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Thank you for your fast response. I did not see these comments. :-)
Yeah. It seems an efficient solution. The purpose is just to identify different times when the current sample is, only one time step is okay which meets Ockham's Razor. From another perspective, (B, [all time step concat], N) compared to (B, [single time step embedding], N) is more redundant since all nodes are same time embedding in one sample.
I noticed that only the last time step of each sample is kept by the following code:
https://github.com/zezhishao/STID/blob/f9801a5d4939e7d3eb100525c1c027cbd34630d3/stid/stid_arch/stid_arch.py#L76-L88
More specifically, the operation "t_i_d_data[:, -1, :]" is used to get the last time step from input data.
Could you please provide more interpretations?
The text was updated successfully, but these errors were encountered: