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

推荐订阅源

L
LangChain Blog
B
Blog RSS Feed
阮一峰的网络日志
阮一峰的网络日志
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
H
Help Net Security
MyScale Blog
MyScale Blog
WordPress大学
WordPress大学
Microsoft Azure Blog
Microsoft Azure Blog
GbyAI
GbyAI
小众软件
小众软件
大猫的无限游戏
大猫的无限游戏
Martin Fowler
Martin Fowler
Vercel News
Vercel News
S
SegmentFault 最新的问题
M
MIT News - Artificial intelligence
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
Last Week in AI
Last Week in AI
Hugging Face - Blog
Hugging Face - Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
博客园 - 【当耐特】
Google DeepMind News
Google DeepMind News
Engineering at Meta
Engineering at Meta
云风的 BLOG
云风的 BLOG

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
Geometrical and statistical properties of M-estimates of ...
Corina Ciobotaru, Christian Mazza · 2018-12-31 · via math.ST updates on arXiv.org

We consider data from the Grassmann manifold $G(m,r)$ of all vector subspaces of dimension $r$ of $\mathbb{R}^m$, and focus on the Grassmannian statistical model which is of common use in signal processing and statistics. Canonical Grassmannian distributions $\mathbb{G}_Σ$ on $G(m,r)$ are indexed by parameters $Σ$ from the manifold $\mathcal{M}= Pos_{sym}^{1}(m)$ of positive definite symmetric matrices of determinant $1$. Robust M-estimates of scatter (GE) for general probability measures $\mathcal{P}$ on $G(m,r)$ are studied. Such estimators are defined to be the maximizers of the Grassmannian log-likelihood $-\ell_{\mathcal{P}}(Σ)$ as function of $Σ$. One of the novel features of this work is a strong use of the fact that $\mathcal{M}$ is a CAT(0) space with known visual boundary at infinity $\partial \mathcal{M}$. We also recall that the sample space $G(m,r)$ is a part of $\partial \mathcal{M}$, show the distributions $\mathbb{G}_Σ$ are $SL(m,\mathbb{R})$--quasi-invariant, and that $\ell_{\mathcal{P}}(Σ)$ is a weighted Busemann function. Let $\mathcal{P}_n =(δ_{U_1}+\cdots+δ_{U_n})/n$ be the empirical probability measure for $n$-samples of random i.i.d. subspaces $U_i\in G(m,r)$ of common distribution $\mathcal{P}$, whose support spans $\mathbb{R}^m$. For $Σ_n$ and $Σ_{\mathcal{P}}$ the GEs of $\mathcal{P}_n$ and $\mathcal{P}$, we show the almost sure convergence of $Σ_n$ towards $Σ$ as $n\to\infty$ using methods from geometry, and provide a central limit theorem for the rescaled process $C_n = \frac{m}{tr(Σ_{\mathcal{P}}^{-1} Σ_n)}g^{-1} Σ_n g^{-1}$, where $Σ=gg$ with $g\in SL(m,\mathbb{R})$ the unique symmetric positive-definite square root of $Σ$.