For the OCR task, bandit learning does decrease Hamming loss, but it does not quite achieve full-information performance.
pairwise ranking (Algorithm 2) again converges faster than the alternative bandit algorithms by a factor of 2-4, despite similar learning rates for Algorithms 1 and 2 and a compensa-  tion of smaller learning rates in Algorithm 3 by variance reduction and regularization.