{"ID":2838419,"CreatedAt":"2026-06-01T04:54:23.091178241Z","UpdatedAt":"2026-06-01T04:54:23.091178241Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2511.16925","arxiv_id":"2511.16925","title":"Approximate Least-Favorable Distributions and Nearly Optimal Tests via Stochastic Mirror Descent","abstract":"We consider a class of hypothesis testing problems where the null hypothesis postulates $M$ distributions for the observed data, and there is only one possible distribution under the alternative. We show that one can use a stochastic mirror descent routine for convex optimization to provably obtain - after finitely many iterations - both an approximate least-favorable distribution and a nearly optimal test, in a sense we make precise. Our theoretical results yield concrete recommendations about the algorithm's implementation, including its initial condition, its step size, and the number of iterations. Importantly, our suggested algorithm can be viewed as a slight variation of the algorithm suggested by Elliott, Müller, and Watson (2015), whose theoretical performance guarantees are unknown.","short_abstract":"We consider a class of hypothesis testing problems where the null hypothesis postulates $M$ distributions for the observed data, and there is only one possible distribution under the alternative. We show that one can use a stochastic mirror descent routine for convex optimization to provably obtain - after finitely man...","url_abs":"https://arxiv.org/abs/2511.16925","url_pdf":"https://arxiv.org/pdf/2511.16925v1","authors":"[\"Andrés Aradillas Fernández\",\"José Blanchet\",\"José Luis Montiel Olea\",\"Chen Qiu\",\"Jörg Stoye\",\"Lezhi Tan\"]","published":"2025-11-21T03:36:26Z","proceeding":"econ.EM","tasks":"[\"econ.EM\",\"math.ST\"]","methods":"[]","has_code":false}