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

推荐订阅源

J
Java Code Geeks
Hugging Face - Blog
Hugging Face - Blog
博客园_首页
爱范儿
爱范儿
罗磊的独立博客
美团技术团队
Jina AI
Jina AI
量子位
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
酷 壳 – CoolShell
酷 壳 – CoolShell
有赞技术团队
有赞技术团队
V
V2EX
阮一峰的网络日志
阮一峰的网络日志
小众软件
小众软件
IT之家
IT之家
雷峰网
雷峰网
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 司徒正美
大猫的无限游戏
大猫的无限游戏
博客园 - 聂微东
月光博客
月光博客
人人都是产品经理
人人都是产品经理
博客园 - 三生石上(FineUI控件)

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
Limiting distribution for the maximal standardized increm...
Zakhar Kabluchko, Yizao Wang · 2012-11-14 · via math.ST updates on arXiv.org

Let $X_1,X_2,...$ be independent identically distributed random variables with $\mathbb E X_k=0$, $\mathrm{Var} X_k=1$. Suppose that $\varphi(t):=\log \mathbb E e^{t X_k}<\infty$ for all $t>-σ_0$ and some $σ_0>0$. Let $S_k=X_1+...+X_k$ and $S_0=0$. We are interested in the limiting distribution of the multiscale scan statistic $$ M_n=\max_{0\leq i <j\leq n} \frac{S_j-S_i}{\sqrt{j-i}}. $$ We prove that for an appropriate normalizing sequence $a_n$, the random variable $M_n^2-a_n$ converges to the Gumbel extreme-value law $\exp\{-e^{-c x}\}$. The behavior of $M_n$ depends strongly on the distribution of the $X_k$'s. We distinguish between four cases. In the superlogarithmic case we assume that $\varphi(t)<t^2/2$ for every $t>0$. In this case, we show that the main contribution to $M_n$ comes from the intervals $(i,j)$ having length $l:=j-i$ of order $a(\log n)^{p}$, $a>0$, where $p=q/(q-2)$ and $q\in{3,4,...}$ is the order of the first non-vanishing cumulant of $X_1$ (not counting the variance). In the logarithmic case we assume that the function $ψ(t):=2\varphi(t)/t^2$ attains its maximum $m_*>1$ at some unique point $t=t_*\in (0,\infty)$. In this case, we show that the main contribution to $M_n$ comes from the intervals $(i,j)$ of length $d_*\log n+a\sqrt{\log n}$, $a\in\mathbb R$, where $d_*=1/\varphi(t_*)>0$. In the sublogarithmic case we assume that the tail of $X_k$ is heavier than $\exp\{-x^{2-\varepsilon}\}$, for some $\varepsilon>0$. In this case, the main contribution to $M_n$ comes from the intervals of length $o(\log n)$ and in fact, under regularity assumptions, from the intervals of length $1$. In the remaining, fourth case, the $X_k$'s are Gaussian. This case has been studied earlier in the literature. The main contribution comes from intervals of length $a\log n$, $a>0$. We argue that our results cover most interesting distributions with light tails.