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

推荐订阅源

博客园 - 三生石上(FineUI控件)
博客园 - Franky
GbyAI
GbyAI
B
Blog
WordPress大学
WordPress大学
D
Docker
小众软件
小众软件
月光博客
月光博客
博客园 - 【当耐特】
T
The Blog of Author Tim Ferriss
IT之家
IT之家
腾讯CDC
Engineering at Meta
Engineering at Meta
Vercel News
Vercel News
H
Help Net Security
M
MIT News - Artificial intelligence
L
LangChain Blog
云风的 BLOG
云风的 BLOG
S
SegmentFault 最新的问题
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
美团技术团队
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
V
V2EX
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻

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
Maximal Ancillarity, Semiparametric Efficiency, and the E...
Marc Hallin, Bas J. M. Werker, Bo Zhou · 2026-03-08 · via math.ST updates on arXiv.org

Restricting statistical experiments via nuisance-ancillary $σ$-fields yields nuisance-free experiments. However, a moot point with ancillarity is that maximal ancillary $σ$-fields are typically not unique. There are exceptions, though, among which the limiting experiments in a locally asymptotically normal (LAN) context. Building on this, we address the maximal ancillarity uniqueness problem by adopting a Hájek-Le Cam asymptotic perspective and define the concept of sequences of locally asymptotically maximal nuisance-ancillary $σ$-fields. We then show that any semiparametrically efficient procedure admits versions that are measurable with respect to such $σ$-fields while enjoying strict finite-sample nuisance-ancillarity, hence eliminating the nuisance without the hassle of estimating it. This is in sharp contrast with classical tangent space projections, which also achieve semiparametric efficiency but only enjoy asymptotic nuisance-ancillarity -- at the price, moreover, of adequately estimating the nuisance. When the nuisance is the density of some noise or innovation driving the data-generating process of a LAN experiment, we show that a sequence of locally asymptotically maximal nuisance-ancillary $σ$-fields is generated by the so-called center-outward residual ranks and signs based on measure transportation results. Restricting local experiments to such $σ$-fields yields sequences of finite-sample nuisance-free (here, distribution-free) restrictions of the original local LAN experiments that nevertheless achieve the semiparametric efficiency bounds of the original ones.