Do something to compensate for greedy behavior of adaptive probabilities

[tdaede]

Rate adaptation matches the decoder, but on the encoder side this makes it greedy - it may not find the global optimum for the frame because making a symbol more probable now may make it cheaper later in the frame.

This is virtually impossible to search via trellis etc, but could be improved via some sort of hack to reduce the greediness.