[图书][B] Upper and lower bounds for stochastic processes
M Talagrand - 2014 - Springer
This book had a previous edition [132]. The changes between the two editions are not only
cosmetic or pedagogical, and the degree of improvement in the mathematics themselves is …
cosmetic or pedagogical, and the degree of improvement in the mathematics themselves is …
[图书][B] The generic chaining: upper and lower bounds of stochastic processes
M Talagrand - 2005 - books.google.com
What is the maximum level a certain river is likely to reach over the next 25 years?(Having
experienced three times a few feet of water in my house, I feel a keen personal interest in …
experienced three times a few feet of water in my house, I feel a keen personal interest in …
[PDF][PDF] Majorizing measures: the generic chaining
M Talagrand - The Annals of Probability, 1996 - projecteuclid.org
Majorizing measures provide bounds for the supremum of stochastic processes. They
represent the most general possible form of the chaining argument going back to …
represent the most general possible form of the chaining argument going back to …
Approximation, metric entropy and small ball estimates for Gaussian measures
WV Li, W Linde - The Annals of Probability, 1999 - projecteuclid.org
A precise link proved by Kuelbs and Li relates the small ball behavior of a Gaussian
measure $\mu $ on a Banach space $ E $ with the metric entropy behavior of $ K_\mu $, the …
measure $\mu $ on a Banach space $ E $ with the metric entropy behavior of $ K_\mu $, the …
Sampling discretization and related problems
B Kashin, E Kosov, I Limonova, V Temlyakov - Journal of Complexity, 2022 - Elsevier
This survey addresses sampling discretization and its connections with other areas of
mathematics. The survey concentrates on sampling discretization of norms of elements of …
mathematics. The survey concentrates on sampling discretization of norms of elements of …
Toward a unified theory of sparse dimensionality reduction in euclidean space
Let Φ∈ Rm xn be a sparse Johnson-Lindenstrauss transform [52] with column sparsity s.
For a subset T of the unit sphere and ε∈(0, 1/2), we study settings for m, s to ensure EΦ …
For a subset T of the unit sphere and ε∈(0, 1/2), we study settings for m, s to ensure EΦ …
The supremum of some canonical processes
M Talagrand - American Journal of Mathematics, 1994 - JSTOR
1. Introduction. Consider a random variable (rv) h such that Eh2< 0, and consider an
independent, identically distributed (iid) sequence (hk) k> l distributed like h. To each t=(tk) …
independent, identically distributed (iid) sequence (hk) k> l distributed like h. To each t=(tk) …
Approximating nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory's theorem
S Barman - Proceedings of the forty-seventh annual ACM …, 2015 - dl.acm.org
We present algorithmic applications of an approximate version of Caratheodory's theorem.
The theorem states that given a set of vectors X in Rd, for every vector in the convex hull of X …
The theorem states that given a set of vectors X in Rd, for every vector in the convex hull of X …
[图书][B] Approximation and entropy numbers of Volterra operators with application to Brownian motion
MA Lifshit︠s︡, W Linde - 2002 - books.google.com
This text considers a specific Volterra integral operator and investigates its degree of
compactness in terms of properties of certain kernel functions. In particular, under certain …
compactness in terms of properties of certain kernel functions. In particular, under certain …
Revisiting the approximate Carathéodory problem via the Frank-Wolfe algorithm
CW Combettes, S Pokutta - Mathematical Programming, 2023 - Springer
The approximate Carathéodory theorem states that given a compact convex set C ⊂ R^ n
C⊂ R n and p ∈ 2,+ ∞ p∈ 2,+∞, each point x^* ∈ C x∗∈ C can be approximated to ϵ ϵ …
C⊂ R n and p ∈ 2,+ ∞ p∈ 2,+∞, each point x^* ∈ C x∗∈ C can be approximated to ϵ ϵ …