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

推荐订阅源

Google DeepMind News
Google DeepMind News
B
Blog RSS Feed
The GitHub Blog
The GitHub Blog
Recent Announcements
Recent Announcements
A
About on SuperTechFans
G
Google Developers Blog
aimingoo的专栏
aimingoo的专栏
U
Unit 42
WordPress大学
WordPress大学
Y
Y Combinator Blog
罗磊的独立博客
J
Java Code Geeks
Microsoft Azure Blog
Microsoft Azure Blog
腾讯CDC
博客园 - 叶小钗
Stack Overflow Blog
Stack Overflow Blog
Engineering at Meta
Engineering at Meta
Microsoft Security Blog
Microsoft Security Blog
GbyAI
GbyAI
V
V2EX
雷峰网
雷峰网
H
Hackread – Cybersecurity News, Data Breaches, AI and More
S
SegmentFault 最新的问题
酷 壳 – CoolShell
酷 壳 – CoolShell

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
Light tails: Gibbs conditional principle under extreme de...
2013-05-15 · via math.ST updates on arXiv.org

Let $X_{1},..,X_{n}$ denote an i.i.d. sample with light tail distribution and $S_{1}^{n}$ denote the sum of its terms; let $a_{n}$ be a real sequence\ going to infinity with $n.$\ In a previous paper (\cite{BoniaCao}) it is proved that as $n\rightarrow\infty$, given $\left(S_{1}^{n}/n>a_{n}\right) $ all terms $X_{i_{\text{}}}$ concentrate around $a_{n}$ with probability going to 1. This paper explores the asymptotic distribution of $X_{1}$ under the conditioning events $\left(S_{1}^{n}/n=a_{n}\right) $ and $\left(S_{1}^{n}/n\geq a_{n}\right)$ . It is proved that under some regulatity property, the asymptotic conditional distribution of $X_{1}$ given $\left(S_{1}^{n}/n=a_{n}\right) $ can be approximated in variation norm by the tilted distribution at point $a_{n}$, extending therefore the classical LDP case developed in Diaconis and Freedman (1988) . Also under $\left(S_{1}^{n}/n\geq a_{n}\right) $ the dominating point property holds. It also considers the case when the $X_{i}$'s are $\mathbb{R}^{d}-$valued, $f$ is a real valued function defined on $\mathbb{R}^{d}$ and the conditioning event writes $\left(U_{1}^{n}/n=a_{n}\right) $ or $\left(U_{1}^{n}/n\geq a_{n}\right)$ with $U_{1}^{n}:=\left(f(X_{1})+..+f(X_{n})\right) /n$ and $f(X_{1})$ has a light tail distribution$.$ As a by-product some attention is paid to the estimation of high level sets of functions.