arXiv:2609.27766v1 Announce Type: cross
Abstract: In safe hypothesis testing with test supermartingals, Ville's inequality provides anytime-valid type-I error guarantees for every significance level...
By Patrick Forr\'e
arXiv:2504. 19952v2 Announce Type: replace-cross Abstract: We present two general lower bounds for stopping times of sequential tests between arbitrary composite nulls $\mathcal P$ and alternatives $\mathcal Q$.
By Shubhada Agrawal, Ashwin Ram, Aaditya Ramdas
The paper studies contextual bilateral trade with full feedback, showing that action-independent observations eliminate the usual polynomial adaptation penalty seen in heavy-tailed bandits. It presents fully parameter-free algorithms that achieve oracle minimax regret rates without knowing the moment order or scale, and derives new regret bounds for both parametric and nonparametric settings. The key technical insight is a paired squared‑loss statistic whose noise cancels, enabling model selection and yielding regret rates that interpolate between classical nonparametric and linear extremes.
By Hangyi Zhao
arXiv:2608. 15365v1 Announce Type: new Abstract: Regret minimization (RM) and best-arm identification (BAI) are two fundamental objectives in multi-armed bandits.
By Jingxin Zhan, Yuze Han, Zhihua Zhang
arXiv:2609.37425v1 Announce Type: cross
Abstract: Fix a target accuracy $\varepsilon$, a gradient-noise level $s$, and a horizon $N$. We wish to design algorithms which minimize the probability of ob...
By Bart P. G. van Parys
arXiv:2608. 09450v1 Announce Type: new Abstract: Betting-based sequential tests and Blackwell approachability are linked by a rate-explicit reduction through support-function residuals.
By Jinze Zhao