We assume that the executor and all tables are deterministic and the executor can be called as many times as possible.
given that MAVER effectively considers more negative examples during each update, we expect that it is more stable compared to the MMR algorithm.