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

推荐订阅源

Google DeepMind News
Google DeepMind News
B
Blog RSS Feed
量子位
aimingoo的专栏
aimingoo的专栏
V
Visual Studio Blog
Y
Y Combinator Blog
Vercel News
Vercel News
云风的 BLOG
云风的 BLOG
宝玉的分享
宝玉的分享
Engineering at Meta
Engineering at Meta
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
GbyAI
GbyAI
人人都是产品经理
人人都是产品经理
博客园 - 叶小钗
Stack Overflow Blog
Stack Overflow Blog
大猫的无限游戏
大猫的无限游戏
Microsoft Security Blog
Microsoft Security Blog
B
Blog
Last Week in AI
Last Week in AI
有赞技术团队
有赞技术团队
博客园 - 聂微东
腾讯CDC
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
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
Estimation of trace functionals and spectral measures of ...
Vladimir Koltchinskii · 2024-02-18 · via math.ST updates on arXiv.org

Let $f:{\mathbb R}_+\mapsto {\mathbb R}$ be a smooth function with $f(0)=0.$ A problem of estimation of a functional $τ_f(Σ):= {\rm tr}(f(Σ))$ of unknown covariance operator $Σ$ in a separable Hilbert space ${\mathbb H}$ based on i.i.d. mean zero Gaussian observations $X_1,\dots, X_n$ with values in ${\mathbb H}$ and covariance operator $Σ$ is studied. Let $\hat Σ_n$ be the sample covariance operator based on observations $X_1,\dots, X_n.$ Estimators \begin{align*} T_{f,m}(X_1,\dots, X_n):= \sum_{j=1}^m C_j τ_f(\hat Σ_{n_j}) \end{align*} based on linear aggregation of several plug-in estimators $τ_f(\hat Σ_{n_j}),$ where the sample sizes $n/c\leq n_1<\dots<n_m\leq n$ and coefficients $C_1,\dots, C_n$ are chosen to reduce the bias, are considered. The complexity of the problem is characterized by the effective rank ${\bf r}(Σ):= \frac{{\rm tr}(Σ)}{\|Σ\|}$ of covariance operator $Σ.$ It is shown that, if $f\in C^{m+1}({\mathbb R}_+)$ for some $m\geq 2,$ $\|f''\|_{L_{\infty}}\lesssim 1,$ $\|f^{(m+1)}\|_{L_{\infty}}\lesssim 1,$ $\|Σ\|\lesssim 1$ and ${\bf r}(Σ)\lesssim n,$ then \begin{align*} & \|\hat T_{f,m}(X_1,\dots, X_n)-τ_f(Σ)\|_{L_2} \lesssim_m \frac{\|Σf'(Σ)\|_2}{\sqrt{n}} + \frac{{\bf r}(Σ)}{n}+ {\bf r}(Σ)\Bigl(\sqrt{\frac{{\bf r}(Σ)}{n}}\Bigr)^{m+1}. \end{align*} Similar bounds have been proved for the $L_{p}$-errors and some other Orlicz norm errors of estimator $\hat T_{f,m}(X_1,\dots, X_n).$ The optimality of these error rates, other estimators for which asymptotic efficiency is achieved and uniform bounds over classes of smooth test functions $f$ are also discussed.