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

推荐订阅源

T
Threatpost
CTFtime.org: upcoming CTF events
CTFtime.org: upcoming CTF events
T
The Blog of Author Tim Ferriss
S
SegmentFault 最新的问题
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 司徒正美
T
Tailwind CSS Blog
The Cloudflare Blog
The Last Watchdog
The Last Watchdog
PCI Perspectives
PCI Perspectives
博客园 - 聂微东
Stack Overflow Blog
Stack Overflow Blog
TaoSecurity Blog
TaoSecurity Blog
云风的 BLOG
云风的 BLOG
C
Cybersecurity and Infrastructure Security Agency CISA
O
OpenAI News
Recorded Future
Recorded Future
GbyAI
GbyAI
www.infosecurity-magazine.com
www.infosecurity-magazine.com
Y
Y Combinator Blog
D
Darknet – Hacking Tools, Hacker News & Cyber Security
量子位
博客园 - 叶小钗
V
Vulnerabilities – Threatpost
F
Full Disclosure
Recent Announcements
Recent Announcements
Vercel News
Vercel News
S
Schneier on Security
H
Heimdal Security Blog
Cisco Talos Blog
Cisco Talos Blog
V2EX - 技术
V2EX - 技术
cs.AI updates on arXiv.org
cs.AI updates on arXiv.org
B
Blog RSS Feed
宝玉的分享
宝玉的分享
Exploit-DB.com RSS Feed
Exploit-DB.com RSS Feed
P
Privacy & Cybersecurity Law Blog
T
Threat Research - Cisco Blogs
G
Google Developers Blog
C
Cyber Attacks, Cyber Crime and Cyber Security
爱范儿
爱范儿
IT之家
IT之家
大猫的无限游戏
大猫的无限游戏
C
Check Point Blog
N
Netflix TechBlog - Medium
S
Security @ Cisco Blogs
cs.CV updates on arXiv.org
cs.CV updates on arXiv.org
Microsoft Azure Blog
Microsoft Azure Blog
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Threat Intelligence Blog | Flashpoint
Threat Intelligence Blog | Flashpoint
Cyberwarzone
Cyberwarzone

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 Direct Estimation of Schrödinger Bridge Time-Series Drifts: Finite-Sample, Asymptotic, and Adaptive Guarantees Information-theoretic Limits of Learning and Estimation Adaptivity Under Realizability Constraints: Comparing In-Context and Agentic Learning Multiscale Euclidean Network Trajectories: Second-Moment Geometry, Attribution, and Change Points Causal discovery under mean independence and linearity Perturbation is All You Need for Extrapolating Language Models Realizable Bayes-Consistency for General Metric Losses Vanishing L2 regularization for the softmax Multi Armed Bandit Imbalanced Classification under Capacity Constraints Intrinsic effective sample size for manifold-valued Markov chain Monte Carlo via kernel discrepancy On the Optimal Sample Complexity of Offline Multi-Armed Bandits with KL Regularization Extrapolation in Statistical Learning with Extreme Value Theory Adaptive Estimation and Inference in Semi-parametric Heterogeneous Clustered Multitask Learning via Neyman Orthogonality Beyond ECE: Calibrated Size Ratio, Risk Assessment, and Confidence-Weighted Metrics Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression Mean Testing under Truncation beyond Gaussian Decoupled Descent: Exact Test Error Tracking Via Approximate Message Passing Hyper Input Convex Neural Networks for Shape Constrained Learning and Optimal Transport Observable Neural ODEs for Identifiable Causal Forecasting in Continuous Time Elite-Driven Support Vector Machines for Classification A Limit Theory of Foundation Models: A Mathematical Approach to Understanding Emergent Intelligence and Scaling Laws Learning Curves and Benign Overfitting of Spectral Algorithms in Large Dimensions Concave Statistical Utility Maximization Bandits via Influence-Function Gradients The Sample Complexity of Multicalibration Cover meets Robbins while Betting on Bounded Data: $\ln n$ Regret and Almost Sure $\ln\ln n$ Regret Achieving the Kesten-Stigum bound in the non-uniform hypergraph stochastic block model On two ways to use determinantal point processes for Monte Carlo integration Recovery Guarantees for Continual Learning of Dependent Tasks: Memory, Data-Dependent Regularization, and Data-Dependent Weights Structural interpretability in SVMs with truncated orthogonal polynomial kernels Cloning is as Hard as Learning for Stabilizer States Ordinary Least Squares is a Special Case of Transformer Identifiability of Potentially Degenerate Gaussian Mixture Models With Piecewise Affine Mixing NetworkNet: A Deep Neural Network Approach for Random Networks with Sparse Nodal Attributes and Complex Nodal Heterogeneity ADD for Multi-Bit Image Watermarking Cost-optimal Sequential Testing via Doubly Robust Q-learning Query Lower Bounds for Diffusion Sampling Tail-Aware Information-Theoretic Generalization for RLHF and SGLD Spatio-temporal probabilistic forecast using MMAF-guided learning The Geometry of Knowing: From Possibilistic Ignorance to Probabilistic Certainty -- A Measure-Theoretic Framework for Epistemic Convergence Generalization Properties of Score-matching Diffusion Models for Intrinsically Low-dimensional Data Conformal Policy Control Continuous-time reinforcement learning: ellipticity enables model-free value function approximation High-accuracy sampling for diffusion models and log-concave distributions Analyzing Shapley Additive Explanations to Understand Anomaly Detection Algorithm Behaviors and Their Complementarity Optimal Lower Bounds for Online Multicalibration Understanding Overparametrization in Survival Models through Interpolation Eventually LIL Regret: Almost Sure $\ln\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data Limit Theorems for Stochastic Gradient Descent in High-Dimensional Single-Layer Networks Optimal In-context Adaptivity and Distributional Robustness of Transformers Don't Pass@k: A Bayesian Framework for Large Language Model Evaluation The Good, the Bad, and the Sampled: a No-Regret Approach to Safe Online Classification GOSPA and T-GOSPA quasi-metrics for evaluation of multi-object tracking algorithms A note on the unique properties of the Kullback--Leibler divergence for sampling via gradient flows Multi-Armed Bandits With Machine Learning-Generated Surrogate Rewards Efficient compression of neural networks and datasets Out-of-Distribution Generalization of In-Context Learning: A Low-Dimensional Subspace Perspective Super-fast Rates of Convergence for Neural Network Classifiers under the Hard Margin Condition Sharp Gaussian approximations for Decentralized Federated Learning Learning Operators by Regularized Stochastic Gradient Descent with Operator-valued Kernels Smoothed Analysis of Learning from Positive Samples Statistical Impossibility and Possibility of Aligning LLMs with Human Preferences: From Condorcet Paradox to Nash Equilibrium Sharp Risk Bounds for Early-Stopping in Gaussian Linear Regression Gaussian Approximation and Multiplier Bootstrap for Stochastic Gradient Descent Copula-enhanced Vision Transformer for high myopia diagnosis through OU UWF fundus images General Frameworks for Conditional Two-Sample Testing Improved Hardness Results for Learning Intersections of Halfspaces Consistency of Lloyd's Algorithm Under Perturbations Convergence Rates for Non-Log-Concave Sampling and Log-Partition Estimation Distribution-Free Stochastic Analysis and Robust Multilevel Vector Field Anomaly Detection Efficient Parameter Estimation of Truncated Boolean Product Distributions
Curvature effects on the empirical mean in Riemannian and affine Manifolds: a non-asymptotic high concentration expansion in the small-sample regime
2019-06-18 · via math.ST updates on arXiv.org

The asymptotic concentration of the Fr{é}chet mean of IID random variables on a Rieman-nian manifold was established with a central limit theorem by Bhattacharya \& Patrangenaru (BP-CLT) [6]. This asymptotic result shows that the Fr{é}chet mean behaves almost as the usual Euclidean case for sufficiently concentrated distributions. However, the asymptotic covariance matrix of the empirical mean is modified by the expected Hessian of the squared distance. This Hessian matrix was explicitly computed in [5] for constant curvature spaces in order to relate it to the sectional curvature. Although explicit, the formula remains quite difficult to interpret, and the intuitive effect of the curvature on the asymptotic convergence remains unclear. Moreover, we are most often interested in the mean of a finite sample of small size in practice. In this work, we aim at understanding the effect of the manifold curvature in this small sample regime. Last but not least, one would like computable and interpretable approximations that can be extended from the empirical Fr{é}chet mean in Rie-mannian manifolds to the empirical exponential barycenters in affine connection manifolds. For distributions that are highly concentrated around their mean, and for any finite number of samples, we establish explicit Taylor expansions on the first and second moment of the empirical mean thanks to a new Taylor expansion of the Riemannian log-map in affine connection spaces. This shows that the empirical mean has a bias in 1/n proportional to the gradient of the curvature tensor contracted twice with the covariance matrix, and a modulation of the convergence rate of the covariance matrix proportional to the covariance-curvature tensor. We show that our non-asymptotic high concentration expansion is consistent with the asymptotic expansion of the BP-CLT. Experiments on constant curvature spaces demonstrate that both expansions are very accurate in their domain of validity. Moreover, the modulation of the convergence rate of the empirical mean's covariance matrix is explicitly encoded using a scalar multiplicative factor that gives an intuitive vision of the impact of the curvature: the variance of the empirical mean decreases faster than in the Euclidean case in negatively curved space forms, with an infinite speed for an infinite negative curvature. This suggests potential links with the stickiness of the Fr{é}chet mean described in stratified spaces. On the contrary, the variance of the empirical mean decreases more slowly than in the Euclidean case in positive curvature space forms, with divergence when we approach the limits of the Karcher \& Kendall concentration conditions with a uniform distribution on the equator of the sphere, for which the Fr{é}chet mean is not a single point any more.