paper-with-me

홈 › Papers

Optimistic Interior Point Methods for Sequential Hypothesis Testing by Betting

2025-02-11 · Can Chen, Jun-Kun Wang

The technique of "testing by betting" frames nonparametric sequential hypothesis testing as a multiple-round game, where a player bets on future observations that arrive in a streaming fashion, accumulates wealth that quantifies evidence against the null hypothesis, and rejects the null once the wealth exceeds a specified threshold while controlling the false positive error. Designing an online learning algorithm that achieves a small regret in the game can help rapidly accumulate the bettor's wealth, which in turn can shorten the time to reject the null hypothesis under the alternative $H_1$. However, many of the existing works employ the Online Newton Step (ONS) to update within a halved decision space to avoid a gradient explosion issue, which is potentially conservative for rapid wealth accumulation. In this paper, we introduce a novel strategy utilizing interior-point methods in optimization that allows updates across the entire interior of the decision space without the risk of gradient explosion. Our approach not only maintains strong statistical guarantees but also facilitates faster null hypothesis rejection in critical scenarios, overcoming the limitations of existing approaches.

📄 PDF Abstract BibTeX arXiv:2502.07774

Code (1)

canchen-cc/oip-betting 공식 구현

Similar Papers 제목 키워드 기반

A Trust-Region Interior-Point Stochastic Sequential Quadratic Programming Method

2026-03-10 · Yuchen Fang, Jihun Kim, Sen Na, James Demmel 외 arxiv

In this paper, we propose a trust-region interior-point stochastic sequential quadratic programming (TR-IP-SSQP) method for solving optimization problems with a stochastic objective and deterministic nonlinear equality a…

A Value-Function-based Interior-point Method for Non-convex Bi-level Optimization

2021-06-15 · Risheng Liu, Xuan Liu, Xiaoming Yuan, Shangzhi Zeng 외

Bi-level optimization model is able to capture a wide range of complex learning tasks with practical interest. Due to the witnessed efficiency in solving bi-level programs, gradient-based methods have gained popularity i…

Privately Learning Thresholds: Closing the Exponential Gap

2019-11-22 · Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor 외

We study the sample complexity of learning threshold functions under the constraint of differential privacy. It is assumed that each labeled example in the training data is the information of one individual and we would …

Variational Bayesian Optimistic Sampling

2021-10-29 · NeurIPS 2021 12 · Brendan O'Donoghue, Tor Lattimore

We consider online sequential decision problems where an agent must balance exploration and exploitation. We derive a set of Bayesian `optimistic' policies which, in the stochastic multi-armed bandit case, includes the T…

Thompson Sampling

Dual-Regularized Riccati Recursions for Interior-Point Optimal Control

2025-09-19 · João Sousa-Pinto, Dominique Orban arxiv

We derive closed-form extensions of the sequential and parallel Riccati recursions for solving dual-regularized linear-quadratic regulator (LQR) problems, with $O(N)$ sequential time and $O(\log(N))$ parallel time, respe…