Learning mirror maps in policy mirror descent
<|reference_start|>Learning mirror maps in policy mirror descent: Policy Mirror Descent (PMD) is a popular framework in reinforcement learning, serving as a unifying perspective that encompasses numerous algorithms. These algorithms are derived through the selection of a mirror map and enjoy finite-time convergence guarantees. Despite its popularity, the exploration of PMD's full potential is limited, with the majority of research focusing on a particular mirror map -- namely, the negative entropy -- which gives rise to the renowned Natural Policy Gradient (NPG) method. It remains uncertain from existing theoretical studies whether the choice of mirror map significantly influences PMD's efficacy. In our work, we conduct empirical investigations to show that the conventional mirror map choice (NPG) often yields less-than-optimal outcomes across several standard benchmark environments. Using evolutionary strategies, we identify more efficient mirror maps that enhance the performance of PMD. We first focus on a tabular environment, i.e. Grid-World, where we relate existing theoretical bounds with the performance of PMD for a few standard mirror maps and the learned one. We then show that it is possible to learn a mirror map that outperforms the negative entropy in more complex environments, such as the MinAtar suite. Our results suggest that mirror maps generalize well across various environments, raising questions about how to best match a mirror map to an environment's structure and characteristics.<|reference_end|>
@article{alfano2024learning,
    title={Learning mirror maps in policy mirror descent},
    author={Carlo Alfano, Sebastian Towers, Silvia Sapora, Chris Lu, Patrick
  Rebeschini},
    journal={arXiv preprint arXiv:2402.05187},
    year={2024},
    archivePrefix={arXiv},
    eprint={2402.05187},
    primaryClass={stat.ML cs.LG math.OC}
}