Skip to content
aiqbench takeMachine Learning

aiqbench analysis

This research introduces e-Process-Authorized Thompson Sampling (e-ATS), a method that rigorously controls when multi-armed bandit algorithms should adapt to non-stationary environments by using anytime-valid evidence rather than fixed thresholds. The study demonstrates that while historical data is valuable under stable conditions, blindly retaining it during distribution shifts can significantly increase regret, with the proposed framework reducing this risk without requiring manual tuning of forgetting parameters.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

When May a Bandit Leave Its Anchor? E-Process-Authorized Thompson Sampling under Non-stationarity

arXiv2 min read

arXiv:2610.03646v1 Announce Type: new Abstract: Stationarity rewards memory, but after a change the same history can mislead. We ask when forgetting should be permitted. E-process-authorized Thompson sampling (e-ATS) gives each arm full-history and discounted Beta states. An anytime-valid e-process first authorizes the discounted state, then a reversible relevance score controls its influence. Before authorization, e-ATS exactly follows optimistic Thompson sampling (OTS). Under a Beta-Bernoulli prior-predictive stationary model, e-ATS's probability of ever departing from OTS is at most the chosen $\alpha_E$, without fitted thresholds. Relative to e-ATS, removing authorization increased mean normalized dynamic pseudo-regret by $38.4\%$ on the registered suite but reduced it by $7.5\%$ on the literature-derived replay suite. Therefore, evidence controls when adaptation begins, not whether it always helps.

Title:When May a Bandit Leave Its Anchor? E-Process-Authorized Thompson Sampling under Non-stationarity

Abstract:Stationarity rewards memory, but after a change the same history can mislead. We ask when forgetting should be permitted. E-process-authorized Thompson sampling (e-ATS) gives each arm full-history and discounted Beta states. An anytime-valid e-process first authorizes the discounted state, then a reversible relevance score controls its influence. Before authorization, e-ATS exactly follows optimistic Thompson sampling (OTS). Under a Beta-Bernoulli prior-predictive stationary model, e-ATS's probability of ever departing from OTS is at most the chosen $\alpha_E$, without fitted thresholds. Relative to e-ATS, removing authorization increased mean normalized dynamic pseudo-regret by $38.4\%$ on the registered suite but reduced it by $7.5\%$ on the literature-derived replay suite. Therefore, evidence controls when adaptation begins, not whether it always helps.

25 pages, 3 figures. Accepted to the E-Values Workshop at NeurIPS 2026 (poster)

Machine Learning (cs.LG); Machine Learning (stat.ML)

arXiv:2610.03646 [cs.LG]

(or arXiv:2610.03646v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2610.03646 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 237 words

Related coverage