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

推荐订阅源

G
Google Developers Blog
F
Fortinet All Blogs
Microsoft Azure Blog
Microsoft Azure Blog
腾讯CDC
Vercel News
Vercel News
Recent Announcements
Recent Announcements
博客园 - Franky
小众软件
小众软件
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
The Cloudflare Blog
宝玉的分享
宝玉的分享
I
InfoQ
博客园 - 聂微东
Jina AI
Jina AI
J
Java Code Geeks
V
V2EX
U
Unit 42
Stack Overflow Blog
Stack Overflow Blog
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
阮一峰的网络日志
阮一峰的网络日志
L
LangChain Blog
T
The Blog of Author Tim Ferriss
量子位

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
Simultaneous estimation of the mean and the variance in h...
Xavier Gendre · 2008-07-16 · via math.ST updates on arXiv.org

Let $Y$ be a Gaussian vector of $\mathbb{R}^n$ of mean $s$ and diagonal covariance matrix $Γ$. Our aim is to estimate both $s$ and the entries $σ_i=Γ_{i,i}$, for $i=1,...,n$, on the basis of the observation of two independent copies of $Y$. Our approach is free of any prior assumption on $s$ but requires that we know some upper bound $γ$ on the ratio $\max_iσ_i/\min_iσ_i$. For example, the choice $γ=1$ corresponds to the homoscedastic case where the components of $Y$ are assumed to have common (unknown) variance. In the opposite, the choice $γ>1$ corresponds to the heteroscedastic case where the variances of the components of $Y$ are allowed to vary within some range. Our estimation strategy is based on model selection. We consider a family $\{S_m\timesΣ_m, m\in\mathcal{M}\}$ of parameter sets where $S_m$ and $Σ_m$ are linear spaces. To each $m\in\mathcal{M}$, we associate a pair of estimators $(\hat{s}_m,\hatσ_m)$ of $(s,σ)$ with values in $S_m\timesΣ_m$. Then we design a model selection procedure in view of selecting some $\hat{m}$ among $\mathcal{M}$ in such a way that the Kullback risk of $(\hat{s}_{\hat{m}},\hatσ_{\hat{m}})$ is as close as possible to the minimum of the Kullback risks among the family of estimators $\{(\hat{s}_m,\hatσ_m), m\in\mathcal{M}\}$. Then we derive uniform rates of convergence for the estimator $(\hat{s}_{\hat{m}},\hatσ_{\hat{m}})$ over Hölderian balls. Finally, we carry out a simulation study in order to illustrate the performances of our estimators in practice.