惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

Engineering at Meta
Engineering at Meta
雷峰网
雷峰网
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
B
Blog
Y
Y Combinator Blog
WordPress大学
WordPress大学
Microsoft Azure Blog
Microsoft Azure Blog
小众软件
小众软件
G
Google Developers Blog
云风的 BLOG
云风的 BLOG
罗磊的独立博客
博客园 - 三生石上(FineUI控件)
博客园 - 叶小钗
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
量子位
The Cloudflare Blog
T
The Blog of Author Tim Ferriss
博客园_首页
B
Blog RSS Feed
Hugging Face - Blog
Hugging Face - Blog
IT之家
IT之家
阮一峰的网络日志
阮一峰的网络日志
L
LangChain Blog
宝玉的分享
宝玉的分享

math.ST updates on arXiv.org

What is Learnable in Valiant's Theory of the Learnable? Learning Perturbations to Extrapolate Your LLM Byzantine-Robust Distributed Sparse Learning Revisited The Sample Complexity of Multiple Change Point Identification under Bandit Feedback A proximal gradient algorithm for composite log-concave sampling Model-based Bootstrap of Controlled Markov Chains Approximation of Maximally Monotone Operators : A Graph Convergence Perspective Posterior Contraction Rates for Sparse Kolmogorov-Arnold Networks in Anisotropic Besov Spaces MIST: Reliable Streaming Decision Trees for Online Class-Incremental Learning via McDiarmid Bound A Spectral Framework for Closed-Form Relative Density Estimation Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability Higher-Order Equilibrium Tracking for EM-Compressible Online Estimation Scaling Limits of Long-Context Transformers A Note on Non-Negative $L_1$-Approximating Polynomials Susceptibilities and Patterning: A Primer on Linear Response in Bayesian Learning Linear Response Estimators for Singular Statistical Models Statistical inference with belief functions: A survey Robust stochastic first order methods in heavy-tailed noise via medoid mini-batch gradient sampling Every Feedforward Neural Network Definable in an o-Minimal Structure Has Finite Sample Complexity Adaptive auditing of AI systems with anytime-valid guarantees Locally Near Optimal Piecewise Linear Regression in High Dimensions via Difference of Max-Affine Functions Risk-Controlled Post-Processing of Decision Policies Covariate Balancing and Riesz Regression Should Be Guided by the Neyman Orthogonal Score in Debiased Machine Learning A Unified Pair-GRPO Family: From Implicit to Explicit Preference Constraints for Stable and General RL Alignment Time-Inhomogeneous Preconditioned Langevin Dynamics A Fine-Grained Understanding of Uniform Convergence for Halfspaces CITE: Anytime-Valid Statistical Inference in LLM Self-Consistency Ratio-based Loss Functions Optimal Confidence Band for Kernel Gradient Flow Estimator A renormalization-group inspired lattice-based framework for piecewise generalized linear models
Locally most powerful sequential tests of a simple hypoth...
Andrey Novikov, Petr Novikov · 2009-05-11 · via math.ST updates on arXiv.org

Let $X_1,X_2,...$ be a discrete-time stochastic process with a distribution $P_θ$, $θ\inΘ$, where $Θ$ is an open subset of the real line. We consider the problem of testing a simple hypothesis $H_0:$ $θ=θ_0$ versus a composite alternative $H_1:$ $θ>θ_0$, where $θ_0\inΘ$ is some fixed point. The main goal of this article is to characterize the structure of locally most powerful sequential tests in this problem. For any sequential test $(ψ,φ)$ with a (randomized) stopping rule $ψ$ and a (randomized) decision rule $φ$ let $α(ψ,φ)$ be the type I error probability, $\dot β_0(ψ,φ)$ the derivative, at $θ=θ_0$, of the power function, and $\mathscr N(ψ)$ an average sample number of the test $(ψ,φ)$. Then we are concerned with the problem of maximizing $\dot β_0(ψ,φ)$ in the class of all sequential tests such that $$ α(ψ,φ)\leq α\quad{and}\quad \mathscr N(ψ)\leq \mathscr N, $$ where $α\in[0,1]$ and $\mathscr N\geq 1$ are some restrictions. It is supposed that $\mathscr N(ψ)$ is calculated under some fixed (not necessarily coinciding with one of $P_θ$) distribution of the process $X_1,X_2...$. The structure of optimal sequential tests is characterized.