中文
相关论文

相关论文: Concentration estimates for functions of finite hi…

200 篇论文

In this note we derive a sharp concentration inequality for the supremum of a smooth random field over a finite dimensional set. It is shown that this supremum can be bounded with high probability by the value of the field at some…

统计理论 · 数学 2013-07-08 Denis Belomestny , Vladimir Spokoiny

The potential applications of boundary functionals of random processes, such as the extreme values of these processes, the moment of first reaching a fixed level, the value of the process at the moment of reaching the level, the moment of…

统计力学 · 物理学 2025-01-15 V. V. Ryazanov

This paper discusses a methodology for determining a functional representation of a random process from a collection of scattered pointwise samples. The present work specifically focuses onto random quantities lying in a high dimensional…

数值分析 · 数学 2014-01-03 Lionel Mathelin

The concentration of measure phenomena were discovered as the mathematical background of statistical mechanics at the end of the XIX - beginning of the XX century and were then explored in mathematics of the XX-XXI centuries. At the…

机器学习 · 计算机科学 2018-03-20 A. N. Gorban , I. Y. Tyukin

Concentration inequalities, a major tool in probability theory, quantify how much a random variable deviates from a certain quantity. This paper proposes a systematic convex optimization approach to studying and generating concentration…

概率论 · 数学 2024-08-30 Celine Moucer , Adrien Taylor , Francis Bach

Let $(X_{n,i})_{1\le i\le n,n\in\mathbb{N}}$ be a triangular array of row-wise stationary $\mathbb{R}^d$-valued random variables. We use a "blocks method" to define clusters of extreme values: the rows of $(X_{n,i})$ are divided into $m_n$…

统计理论 · 数学 2020-05-19 Holger Drees , Holger Rootzén

Let $f:[0,1)^d \to {\mathbb R}$ be an integrable function. An objective of many computer experiments is to estimate $\int_{[0,1)^d} f(x) dx$ by evaluating f at a finite number of points in [0,1)^d. There is a design issue in the choice of…

统计理论 · 数学 2007-08-07 Wei-Liem Loh

We derive sharp upper and lower bounds for the pointwise concentration function of the maximum statistic of $d$ identically distributed real-valued random variables. Our first main result places no restrictions either on the common marginal…

统计理论 · 数学 2025-08-04 Matias D. Cattaneo , Ricardo P. Masini , William G. Underwood

We show how to extend several basic concentration inequalities for simple random tensors $X = x_1 \otimes \cdots \otimes x_d$ where all $x_k$ are independent random vectors in $\mathbb{R}^n$ with independent coefficients. The new results…

概率论 · 数学 2025-10-07 Roman Vershynin

Max-stable random fields play a central role in modeling extreme value phenomena. We obtain an explicit formula for the conditional probability in general max-linear models, which include a large class of max-stable random fields. As a…

统计计算 · 统计学 2010-11-29 Yizao Wang , Stilian A. Stoev

Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…

概率论 · 数学 2013-08-16 Richard Arratia , Simon Tavare

We derive concentration inequalities for functions of the empirical measure of large random matrices with infinitely divisible entries and, in particular, stable ones. We also give concentration results for some other functionals of these…

概率论 · 数学 2007-06-13 Christian Houdré , Hua Xu

We consider the problem of reconstructing a function given its values on a set of points with finite density. We prove that with probability one, the values of an almost periodic function on a random array of points (with finite density)…

comp-gas · 物理学 2016-08-31 P. Collet

An infinite urn scheme is defined by a probability mass function $(p_j)_{j\geq1}$ over positive integers. A random allocation consists of a sample of $N$ independent drawings according to this probability distribution where $N$ may be…

统计理论 · 数学 2016-09-29 Anna Ben-Hamou , Stéphane Boucheron , Mesrob I. Ohannessian

Let $\mathbf{X}^{(1)}_{n},\ldots,\mathbf{X}^{(m)}_{n}$, where $\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\ldots,X^{(i)}_{n})$, $i=1,\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their…

概率论 · 数学 2016-03-15 Ruoting Gong , Christian Houdré , Ümit Işlak

Consider $n$ complex random matrices $X_1,\ldots,X_n$ of size $d\times d$ sampled i.i.d. from a distribution with mean $E[X]=\mu$. While the concentration of averages of these matrices is well-studied, the concentration of other functions…

概率论 · 数学 2020-03-16 Tarun Kathuria , Satyaki Mukherjee , Nikhil Srivastava

Let $X_{1,n} \leq .... \leq X_{n,n}$ be the order statistics associated with a sample $X_{1}, ...., X_{n}$ whose pertaining distribution function (% \textit{df}) is $F$. We are concerned with the functional asymptotic behaviour of the…

统计方法学 · 统计学 2016-04-19 Modou Ngom , Gane Samb Lo

We consider a random variable $X$ that takes values in a (possibly infinite-dimensional) topological vector space $\mathcal{X}$. We show that, with respect to an appropriate "normal distance" on $\mathcal{X}$, concentration inequalities for…

概率论 · 数学 2010-09-27 Timothy John Sullivan , Houman Owhadi

Attention mechanism is a central component of the transformer architecture which led to the phenomenal success of large language models. However, the theoretical principles underlying the attention mechanism are poorly understood,…

机器学习 · 计算机科学 2023-12-11 Davoud Ataee Tarzanagh , Yingcong Li , Xuechen Zhang , Samet Oymak

This article studies the \emph{robust covariance matrix estimation} of a data collection $X = (x_1,\ldots,x_n)$ with $x_i = \sqrt \tau_i z_i + m$, where $z_i \in \mathbb R^p$ is a \textit{concentrated vector} (e.g., an elliptical random…

概率论 · 数学 2022-04-12 Cosme Louart , Romain Couillet