相关论文: Tail Bounds for Functions of Weighted Tensor Sums …
Building on a work by Alm, we consider a model of weighted self-avoiding walks on a lattice and develop a method for computing upper bounds on the corresponding weighted connective constant, which we implement in a publicly available…
The contribution of this paper is to introduce change of measure based techniques for the rare-event analysis of heavy-tailed stochastic processes. Our changes-of-measure are parameterized by a family of distributions admitting a mixture…
We prove a Chernoff-type bound for sums of matrix-valued random variables sampled via a random walk on an expander, confirming a conjecture due to Wigderson and Xiao. Our proof is based on a new multi-matrix extension of the Golden-Thompson…
We modify Talagrand's generic chaining method to obtain upper bounds for all p-th moments of the supremum of a stochastic process. These bounds lead to an estimate for the upper tail of the supremum with optimal deviation parameters. We…
The extreme value dependence of regularly varying stationary time series can be described by the spectral tail process. Drees, Segers and Warchol [Extremes 18(3): 369--402, 2015] proposed estimators of the marginal distributions of this…
Mond and Pecaric introduced a method to simplify the determination of complementary inequalities for Jensen's inequality by converting it into a single-variable maximization or minimization problem of continuous functions. This principle…
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…
In this paper we introduce a new simple but powerful general technique for the study of edge- and vertex-reinforced processes with super-linear reinforcement, based on the use of order statistics for the number of edge, respectively of…
Tensor models play an increasingly prominent role in many fields, notably in machine learning. In several applications, such as community detection, topic modeling and Gaussian mixture learning, one must estimate a low-rank signal from a…
We prove deviation inequalities for sums of high-dimensional random matrices and operators with dependence and {\rc heavy tails}. Estimation of high-dimensional matrices is a concern for numerous modern applications. However, most results…
We prove several trace inequalities that extend the Araki Lieb Thirring (ALT) inequality, Golden Thompson (GT) inequality and logarithmic trace inequality to arbitrary many tensors. Our approaches rely on complex interpolation theory as…
We consider a multivariate distributional recursion of sum-type as arising in the probabilistic analysis of algorithms and random trees. We prove an upper tail bound for the solution using Chernoff's bounding technique by estimating the…
The non-asymptotic tail bounds of random variables play crucial roles in probability, statistics, and machine learning. Despite much success in developing upper bounds on tail probability in literature, the lower bounds on tail…
In this paper we present a tail inequality for the maximum of partial sums of a weakly dependent sequence of random variables that are not necessarily bounded. The class considered includes geometrically and subgeometrically strongly mixing…
Mond and Pecaric proposed a powerful method, namd as MP method, to deal with operator inequalities. However, this method requires a real-valued function to be convex or concave, and the normalized positive linear map between Hilbert spaces.…
We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…
The high-dimensional parameter space of deep neural networks -- the neuromanifold -- is endowed with a unique metric tensor defined by the Fisher information. Reliable and scalable computation of this metric tensor is valuable for theorists…
We study the random variables (r.v.) with values in the so-called mixed (anisotropic) Lebesgue-Riesz spaces: formulate the sufficient conditions for belonging of the r.v. to these spaces, estimate the tail of norms distribution, especially…
Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…
The Hanson-Wright inequality is an upper bound for tails of real quadratic forms in independent random variables. In this work, we extend the Hanson-Wright inequality for the Ky Fan k-norm for the polynomial function of the quadratic sum of…