Rolling Average vs Gradient Descent with Softmax & Cross Entropy

Jump to navigation Jump to search

Rolling Average vs Gradient Descent with Softmax & Cross Entropy

Edited by author.
Last edit: 06:49, 27 July 2021

You do not have permission to edit this page, for the following reasons:

  • The action you have requested is limited to users in the group: Users.
  • You must confirm your email address before editing pages. Please set and validate your email address through your user preferences.

You can view and copy the source of this page.

 

Return to Thread:Talk:Rolling Averages/Rolling Average vs Softmax & Cross Entropy.

Then one step further, you don't use VCS any more, instead add the logits of velocity bins, accel bins and distance bins, etc., all together. This structure is essentially estimating the probability as a multiplication of probability when e.g. velocity is high and distance is close.

If the movement profile relating to velocity, distance, etc. is independent, this approach will be mostly the same as traditional segmented VCS, with more data points.

Note that this approach is essentially a neural network without hidden units, or multiclass logistic regression.

Xor (talk)06:15, 27 July 2021