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

推荐订阅源

罗磊的独立博客
Recent Announcements
Recent Announcements
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
有赞技术团队
有赞技术团队
J
Java Code Geeks
T
The Blog of Author Tim Ferriss
MyScale Blog
MyScale Blog
人人都是产品经理
人人都是产品经理
aimingoo的专栏
aimingoo的专栏
U
Unit 42
The GitHub Blog
The GitHub Blog
云风的 BLOG
云风的 BLOG
T
Tailwind CSS Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 三生石上(FineUI控件)
Apple Machine Learning Research
Apple Machine Learning Research
小众软件
小众软件
Hugging Face - Blog
Hugging Face - Blog
博客园 - 司徒正美
腾讯CDC
I
InfoQ
GbyAI
GbyAI
博客园_首页

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
Contiguity under high dimensional Gaussianity with applic...
Qiyang Han, Tiefeng Jiang, Yandi Shen · 2021-01-27 · via math.ST updates on arXiv.org

Le Cam's third/contiguity lemma is a fundamental probabilistic tool to compute the limiting distribution of a given statistic $T_n$ under a non-null sequence of probability measures $\{Q_n\}$, provided its limiting distribution under a null sequence $\{P_n\}$ is available, and the log likelihood ratio $\{\log (dQ_n/dP_n)\}$ has a distributional limit. Despite its wide-spread applications to low-dimensional statistical problems, the stringent requirement of Le Cam's third/contiguity lemma on the distributional limit of the log likelihood ratio makes it challenging, or even impossible to use in many modern high-dimensional statistical problems. This paper provides a non-asymptotic analogue of Le Cam's third/contiguity lemma under high dimensional normal populations. Our contiguity method is particularly compatible with sufficiently regular statistics $T_n$: the regularity of $T_n$ effectively reduces both the problems of (i) obtaining a null (Gaussian) limit distribution and of (ii) verifying our new quantitative contiguity condition, to those of derivative calculations and moment bounding exercises. More important, our method bypasses the need to understand the precise behavior of the log likelihood ratio, and therefore possibly works even when it necessarily fails to stabilize -- a regime beyond the reach of classical contiguity methods. As a demonstration of the scope of our new contiguity method, we obtain asymptotically exact power formulae for a number of widely used high-dimensional covariance tests, including the likelihood ratio tests and trace tests, that hold uniformly over all possible alternative covariance under mild growth conditions on the dimension-to-sample ratio. These new results go much beyond the scope of previous available case-specific techniques, and exhibit new phenomenon regarding the behavior of these important class of covariance tests.