Frontend
On the Tightness and Computational Tractability of Higher-Dimensional Confidence Sequences
arXiv stat.ML0 views
arXiv:2610.03727v2 Announce Type: replace Abstract: Modern sequential monitoring problems often involve multiple metrics, where we monitor several data streams simultaneously and may act once the evidence is strong enough. Confidence sequences (CSs) are a natural tool for such continuous monitoring. However, for bounded vector means, existing multivariate CSs are either tight but computationally intractable, or fast to compute but conservative. To address this, we study three lifts of one-dimensional betting-based CSs to higher dimensions: a weighted Bonferroni region, an equivalent max-wealth form, and a portfolio region. The portfolio is typically much tighter, especially in higher dimensions, but its boundary and properties such as volume are not available in closed form. To make this tighter construction usable, we propose tractable outer approximations of the portfolio region that preserve statistical validity: a bounding box, an $\ell_p$-ellipsoid, and their intersection. We prove set relations among all constructions and show empirically that these approximations (i) achieve regions close to the intractable portfolio, (ii) substantially outperform existing tractable multivariate CSs, and (iii) enable practical use cases such as multi-metric A/B testing and model comparison.
Source:https://arxiv.org/abs/2610.03727PreviousMinimax PAC Bounds for Learning in Exogenous Contextual MDPsNextA Survey on Archetypal Analysis
Related posts

The Effort to Reach: Designing for Fitts’s Law
0dev.to UX
GitHub’s New Dependabot Verdict Can Lag Behind Your Next Commit
0dev.to GitHub

Document Review With Unsiloed and TypeSafe Jev
0dev.to Machine Learning
AmeriHealth Caritas Files 61-Worker WARN Notice in Orlando, Effective December 31, 2026
0dev.to Career
Remote SWE Jobs Paying Up to $220k (Nov 2)
0dev.to Career
What are your goals for the week? #203
0dev.to Career