The author's preface gives an outline: "This book is about weakconvergence methods in metric spaces, with applications sufficient to show their power and utility. The Introduction motivates the definitions and indicates how the theory will yield solutions to problems arising outside it. Chapter 1 sets out the basic general theorems, which are then specialized in Chapter 2 to the space C[0, l ] of continuous functions on the unit interval and in Chapter 3 to the space D [0, 1 ] of functions with discontinuities of the first kind. The results of the first three chapters are used in Chapter 4 to derive a variety of limit theorems for dependent sequences of random variables. " The book develops and expands on Donsker's 1951 and 1952 papers on the invariance principle and empirical distributions. The basic random variables remain real-valued although, of course, measures on C[0, l ] and D[0, l ] are vitally used. Within this framework, there are various possibilities for a different and apparently better treatment of the material. More of the general theory of weak convergence of probabilities on separable metric spaces would be useful. Metrizability of the convergence is not brought up until late in the Appendix. The close relation of the Prokhorov metric and a metric for convergence in probability is (hence) not mentioned (see V. Strassen, Ann. Math. Statist. 36 (1965), 423-439; the reviewer, ibid. 39 (1968), 1563-1572). This relation would illuminate and organize such results as Theorems 4.1, 4.2 and 4.4 which give isolated, ad hoc connections between weak convergence of measures and nearness in probability. In the middle of p. 16, it should be noted that C*(S) consists of signed measures which need only be finitely additive if 5 is not compact. On p. 239, where the author twice speaks of separable subsets having nonmeasurable cardinal, he means "discrete" rather than "separable." Theorem 1.4 is Ulam's theorem that a Borel probability on a complete separable metric space is tight. Theorem 1 of Appendix 3 weakens completeness to topological completeness. After mentioning that probabilities on the rationals are tight, the author says it is an

Convergence of probability measures

Thank you very much for downloading decoupling from dependence to independence. As you may know, people have search numerous times for their chosen readings like this decoupling from dependence to independence, but end up in infectious downloads. Rather than reading a good book with a cup of tea in the afternoon, instead they are facing with some harmful bugs inside their computer. decoupling from dependence to independence is available in our book collection an online access to it is set as public so you can get it instantly. Our book servers saves in multiple locations, allowing you to get the most less latency time to download any of our books like this one. Kindly say, the decoupling from dependence to independence is universally compatible with any devices to read.

Decoupling From Dependence To Independence

We give the first polynomial-time algorithm for robust regression in the list-decodable setting where an adversary can corrupt a greater than 1/2 fraction of examples. For any \alpha < 1, our algorithm takes as input a sample {(x_i,y_i)}_{i \leq n} of n linear equations where \alpha n of the equations satisfy y_i = \langle x_i,\ell^*\rangle +\zeta for some small noise \zeta and (1-\alpha) n of the equations are {\em arbitrarily} chosen. It outputs a list L of size O(1/\alpha) - a fixed constant - that contains an \ell that is close to \ell^*. Our algorithm succeeds whenever the inliers are chosen from a certifiably anti-concentrated distribution D. In particular, this gives a (d/\alpha)^{O(1/\alpha^8)} time algorithm to find a O(1/\alpha) size list when the inlier distribution is a standard Gaussian. For discrete product distributions that are anti-concentrated only in regular directions, we give an algorithm that achieves similar guarantee under the promise that \ell^* has all coordinates of the same magnitude. To complement our result, we prove that the anti-concentration assumption on the inliers is information-theoretically necessary. To solve the problem we introduce a new framework for list-decodable learning that strengthens the ``identifiability to algorithms'' paradigm based on the sum-of-squares method.

/pdf/list-decodable-linear-regression-1rsslmx1jc.pdf

List-decodable Linear Regression

Given samples from an unknown multivariate distribution $p$ , is it possible to distinguish whether $p$ is the product of its marginals versus $p$ being far from every product distribution? Similarly, is it possible to distinguish whether $p$ equals a given distribution $q$ versus $p$ and $q$ being far from each other? These problems of testing independence and goodness-of-fit have received enormous attention in statistics, information theory, and theoretical computer science, with sample-optimal algorithms known in several interesting regimes of parameters. Unfortunately, it has also been understood that these problems become intractable in large dimensions, necessitating exponential sample complexity. Motivated by the exponential lower bounds for general distributions as well as the ubiquity of Markov random fields (MRFs) in the modeling of high-dimensional distributions, we initiate the study of distribution testing on structured multivariate distributions, and in particular, the prototypical example of MRFs: the Ising Model . We demonstrate that, in this structured setting, we can avoid the curse of dimensionality, obtaining sample, and time efficient testers for independence and goodness-of-fit. One of the key technical challenges we face along the way is bounding the variance of functions of the Ising model.

Testing Ising Models

We derive multi-level concentration inequalities for polynomials in independent random variables with an α-sub-exponential tail decay. A particularly interesting case is given by quadratic forms f(X1,…,Xn)=⟨X,AX⟩, for which we prove Hanson–Wright-type inequalities with explicit dependence on various norms of the matrix A. A consequence of these inequalities is a two-level concentration inequality for quadratic forms in α-sub-exponential random variables, such as quadratic Poisson chaos.
We provide various applications of these inequalities. Among them are generalizations of some results proven by Rudelson and Vershynin from sub-Gaussian to α-sub-exponential random variables, i. e. concentration of the Euclidean norm of the linear image of a random vector and concentration inequalities for the distance between a random vector and a fixed subspace.

/pdf/concentration-inequalities-for-polynomials-in-a-sub-87l8kdnjh4.pdf

Concentration inequalities for polynomials in α-sub-exponential random variables

We extend recent higher order concentration results in the discrete setting to include functions of possibly dependent variables whose distribution (on the product space) satisfies a logarithmic Sobolev inequality with respect to a difference operator that arises from Glauber type dynamics. Examples include the Ising model on a graph with $n$ sites with general, but weak interactions (i.e. in the Dobrushin uniqueness regime), for which we prove concentration results of homogeneous polynomials, as well as random permutations, and slices of the hypercube with dynamics given by either the Bernoulli-Laplace or the symmetric simple exclusion processes.

/pdf/higher-order-concentration-for-functions-of-weakly-dependent-2wgft2x2d4.pdf

Higher order concentration for functions of weakly dependent random variables

In this work we derive multi-level concentration inequalities for polynomial functions in independent random variables with a $\alpha$-sub-exponential tail decay. A particularly interesting case is given by quadratic forms $f(X_1, \ldots, X_n) = \langle X,A X \rangle$, for which we prove Hanson-Wright-type inequalities with explicit dependence on various norms of the matrix $A$. A consequence of these inequalities is a two-level concentration inequality for quadratic forms in $\alpha$-sub-exponential random variables, such as quadratic Poisson chaos. 
We provide various applications of these inequalities. Among these are generalizations the results given by Rudelson-Vershynin from sub-Gaussian to $\alpha$-sub-exponential random variables, i. e. concentration of the Euclidean norm of the linear image of a random vector, small ball probability estimates and concentration inequalities for the distance between a random vector and a fixed subspace. Moreover, we obtain concentration inequalities for the excess loss in a fixed design linear regression and the norm of a randomly projected random vector.

/pdf/concentration-inequalities-for-polynomials-in-alpha-sub-3gjqrd0tyh.pdf

Concentration inequalities for polynomials in $\alpha$-sub-exponential random variables

We extend recent higher order concentration results in the discrete setting to include functions of possibly dependent variables whose distribution (on the product space) satisfies a logarithmic Sobolev inequality with respect to a difference operator that arises from Gibbs sampler type dynamics. Examples of such random variables include the Ising model on a graph with n nodes with general, but weak interactions, i.e. in the Dobrushin uniqueness regime, for which we prove concentration results of homogeneous polynomials, as well as random permutations, and slices of the hypercube with dynamics given by either the Bernoulli-Laplace or the symmetric simple exclusion processes.

We derive sufficient conditions for a probability measure on a finite product space (a spin system) to satisfy a (modified) logarithmic Sobolev inequality. We establish these conditions for various examples, such as the (vertex-weighted) exponential random graph model, the random coloring and the hard-core model with fugacity. This leads to two separate branches of applications. The first branch is given by mixing time estimates of the Glauber dynamics. The proofs do not rely on coupling arguments, but instead use functional inequalities. As a byproduct, this also yields exponential decay of the relative entropy along the Glauber semigroup. Secondly, we investigate the concentration of measure phenomenon (particularly of higher order) for these spin systems. We show the effect of better concentration properties by centering not around the mean, but around a stochastic term in the exponential random graph model. From there, one can deduce a central limit theorem for the number of triangles from the CLT of the edge count. In the Erdős–Renyi model the first-order approximation leads to a quantification and a proof of a central limit theorem for subgraph counts.

Holger Sambale

Papers

Concentration inequalities for polynomials in α-sub-exponential random variables

Higher order concentration for functions of weakly dependent random variables

Concentration inequalities for polynomials in $\alpha$-sub-exponential random variables

Higher order concentration for functions of weakly dependent random variables

Logarithmic Sobolev inequalities for finite spin systems and applications