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

推荐订阅源

WordPress大学
WordPress大学
博客园 - 司徒正美
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
A
About on SuperTechFans
Google DeepMind News
Google DeepMind News
T
Tailwind CSS Blog
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
M
MIT News - Artificial intelligence
L
LangChain Blog
aimingoo的专栏
aimingoo的专栏
Engineering at Meta
Engineering at Meta
Martin Fowler
Martin Fowler
H
Help Net Security
B
Blog
Y
Y Combinator Blog
小众软件
小众软件
S
SegmentFault 最新的问题
I
InfoQ
爱范儿
爱范儿
Hugging Face - Blog
Hugging Face - Blog
D
Docker
博客园 - 【当耐特】
J
Java Code Geeks
阮一峰的网络日志
阮一峰的网络日志

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
Asymptotically Efficient Estimation of Smooth Functionals...
Vladimir Koltchinskii · 2017-10-25 · via math.ST updates on arXiv.org

Let $X$ be a centered Gaussian random variable in a separable Hilbert space ${\mathbb H}$ with covariance operator $Σ.$ We study a problem of estimation of a smooth functional of $Σ$ based on a sample $X_1,\dots ,X_n$ of $n$ independent observations of $X.$ More specifically, we are interested in functionals of the form $\langle f(Σ), B\rangle,$ where $f:{\mathbb R}\mapsto {\mathbb R}$ is a smooth function and $B$ is a nuclear operator in ${\mathbb H}.$ We prove concentration and normal approximation bounds for plug-in estimator $\langle f(\hat Σ),B\rangle,$ $\hat Σ:=n^{-1}\sum_{j=1}^n X_j\otimes X_j$ being the sample covariance based on $X_1,\dots, X_n.$ These bounds show that $\langle f(\hat Σ),B\rangle$ is an asymptotically normal estimator of its expectation ${\mathbb E}_Σ \langle f(\hat Σ),B\rangle$ (rather than of parameter of interest $\langle f(Σ),B\rangle$) with a parametric convergence rate $O(n^{-1/2})$ provided that the effective rank ${\bf r}(Σ):= \frac{{\bf tr}(Σ)}{\|Σ\|}$ (${\rm tr}(Σ)$ being the trace and $\|Σ\|$ being the operator norm of $Σ$) satisfies the assumption ${\bf r}(Σ)=o(n).$ At the same time, we show that the bias of this estimator is typically as large as $\frac{{\bf r}(Σ)}{n}$ (which is larger than $n^{-1/2}$ if ${\bf r}(Σ)\geq n^{1/2}$). In the case when ${\mathbb H}$ is finite-dimensional space of dimension $d=o(n),$ we develop a method of bias reduction and construct an estimator $\langle h(\hat Σ),B\rangle$ of $\langle f(Σ),B\rangle$ that is asymptotically normal with convergence rate $O(n^{-1/2}).$ Moreover, we study asymptotic properties of the risk of this estimator and prove minimax lower bounds for arbitrary estimators showing the asymptotic efficiency of $\langle h(\hat Σ),B\rangle$ in a semi-parametric sense.