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

推荐订阅源

酷 壳 – CoolShell
酷 壳 – CoolShell
D
DataBreaches.Net
C
Check Point Blog
雷峰网
雷峰网
小众软件
小众软件
GbyAI
GbyAI
美团技术团队
P
Proofpoint News Feed
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
罗磊的独立博客
大猫的无限游戏
大猫的无限游戏
WordPress大学
WordPress大学
MyScale Blog
MyScale Blog
The Cloudflare Blog
阮一峰的网络日志
阮一峰的网络日志
Apple Machine Learning Research
Apple Machine Learning Research
Y
Y Combinator Blog
Jina AI
Jina AI
爱范儿
爱范儿
Last Week in AI
Last Week in AI
MongoDB | Blog
MongoDB | Blog
I
InfoQ
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园 - 司徒正美

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
Estimation of Smooth Functionals in Normal Models: Bias R...
Vladimir Koltchinskii, Mayya Zhilova · 2019-12-19 · via math.ST updates on arXiv.org

Let $X_1,\dots, X_n$ be i.i.d. random variables sampled from a normal distribution $N(μ,Σ)$ in ${\mathbb R}^d$ with unknown parameter $θ=(μ,Σ)\in Θ:={\mathbb R}^d\times {\mathcal C}_+^d,$ where ${\mathcal C}_+^d$ is the cone of positively definite covariance operators in ${\mathbb R}^d.$ Given a smooth functional $f:Θ\mapsto {\mathbb R}^1,$ the goal is to estimate $f(θ)$ based on $X_1,\dots, X_n.$ Let $$ Θ(a;d):={\mathbb R}^d\times \Bigl\{Σ\in {\mathcal C}_+^d: σ(Σ)\subset [1/a, a]\Bigr\}, a\geq 1, $$ where $σ(Σ)$ is the spectrum of covariance $Σ.$ Let $\hat θ:=(\hat μ, \hat Σ),$ where $\hat μ$ is the sample mean and $\hat Σ$ is the sample covariance, based on the observations $X_1,\dots, X_n.$ For an arbitrary functional $f\in C^s(Θ),$ $s=k+1+ρ, k\geq 0, ρ\in (0,1],$ we define a functional $f_k:Θ\mapsto {\mathbb R}$ such that \begin{align*} & \sup_{θ\in Θ(a;d)}\|f_k(\hat θ)-f(θ)\|_{L_2({\mathbb P}_θ)} \lesssim_{s, β} \|f\|_{C^{s}(Θ)} \biggr[\biggl(\frac{a}{\sqrt{n}} \bigvee a^{βs}\biggl(\sqrt{\frac{d}{n}}\biggr)^{s} \biggr)\wedge 1\biggr], \end{align*} where $β=1$ for $k=0$ and $β>s-1$ is arbitrary for $k\geq 1.$ This error rate is minimax optimal and similar bounds hold for more general loss functions. If $d=d_n\leq n^α$ for some $α\in (0,1)$ and $s\geq \frac{1}{1-α},$ the rate becomes $O(n^{-1/2}).$ Moreover, for $s>\frac{1}{1-α},$ the estimators $f_k(\hat θ)$ is shown to be asymptotically efficient. The crucial part of the construction of estimator $f_k(\hat θ)$ is a bias reduction method studied in the paper for more general statistical models than normal.