We provide a simple proof that the Chernoff-Savage [1] result, establishing the uniform dominance of normal-score rank procedures over their Gaussian competitors, also holds in a broad class of problems involving serial and/or multivariate observations. The non-admissibility of the corresponding everyday practice Gaussian procedures (multivariate least-squares estimators, multivariate t-tests a...

Known properties of ‘‘canonical connections’’ from database theory and of ‘‘closed sets’’ from statistics implicitly define a hypergraph convexity, here called canonical convexity (cconvexity), and provide an efficient algorithm to compute c-convex hulls. We characterize the class of hypergraphs in which c-convexity enjoys the Minkowski–Krein–Milman property. Moreover, we compare c-convexity wi...

The present paper continues Sjj ostrand's study 13] of correlation functions of lattice eld theories by means of Witten's deformed Lapla-cian. Under the assumptions speciied in the paper and for suuciently low temperature, we derive an estimate for the spectral gap of a certain Witten Laplacian which enables us to prove the exponential decay of the two-point correlation function and, further, t...

Abstract. We are interested in the Logarithmic Sobolev Inequality for the infinite volume Gibbs measure with no quadratic interactions. We consider unbounded spin systems on the one dimensional Lattice with interactions that go beyond the usual strict convexity and without uniform bound on the second derivative. We assume that the one dimensional single-site measure with boundaries satisfies th...

We propose the class of uniformly convex W -hyperbolic spaces with monotone modulus of uniform convexity (UCW -hyperbolic spaces for short) as an appropriate setting for the study of nonexpansive iterations. UCW -hyperbolic spaces are a natural generalization both of uniformly convex normed spaces and CAT (0)-spaces. Furthermore, we apply proof mining techniques to get effective rates of asympt...

Let L = ∆+Z for a C1 vector field Z on a complete Riemannian manifold possibly with a boundary. By using the uniform distance, a number of transportation-cost inequalities on the path space for the (reflecting) L-diffusion process are proved to be equivalent to the curvature condition Ric−∇Z ≥ −K and the convexity of the boundary (if exists). These inequalities are new even for manifolds withou...

In this paper we analyze, based on an interplay between ideas and techniques from logic geometric analysis, a pursuit-evasion game. More precisely, focus uniform betweenness property use it in the study of discrete lion man game with $\varepsilon$-capture criterion. particular, prove that uniformly convex bounded domains always wins and, using stemming proof mining, extract rate convergence for...

We study the problem of computing a planar curve, restricted to lie between two given polygonal chains, such that the integral of the square of arc-length derivative of curvature along the curve is minimized. We introduce the Minimum Variation B-spline problem which is a linearly constrained optimization problem over curves defined by Bspline functions only. An empirical investigation indicates...

We show that a cocycle has a dominated splitting if and only if there is a uniform exponential gap between singular values of its iterates. Then we consider sets Σ in GL(d, R) with the property that any cocycle with values in Σ has a dominated splitting. We characterize these sets in terms of existence of invariant multicones, thus extending a 2-dimensional result by Avila, Bochi, and Yoccoz. W...

For supervised classification problems, it is well known that learnability is equivalent to uniform convergence of the empirical risks and thus to learnability by empirical minimization. Inspired by recent regret bounds for online convex optimization, we study stochastic convex optimization, and uncover a surprisingly different situation in the more general setting: although the stochastic conv...