go-v.orgcodex
Menu
Page tools

codex · Philosophy

Algorithm IMED

Diagram for Algorithm IMED
In multi-armed bandit problems, IMED (for Indexed Minimum Empirical Divergence) is an algorithm developed in 2015 by Junya Honda and Akimichi Takemura. It is the first algorithm proved to be asymptotically optimal respect to the problem-dependant Lai–Robbins lower bound for distributions in (−∞,1]. · image: Wikimedia Commons

In multi-armed bandit problems, IMED (for Indexed Minimum Empirical Divergence) is an algorithm developed in 2015 by Junya Honda and Akimichi Takemura. It is the first algorithm proved to be asymptotically optimal respect to the problem-dependant Lai–Robbins lower bound for distributions in (−∞,1].

Wikipedia contributors, "Algorithm IMED", Wikipedia, revision 1378183466, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex