Displaying 501 – 520 of 744

Showing per page

On the mean speed of convergence of empirical and occupation measures in Wasserstein distance

Emmanuel Boissard, Thibaut Le Gouic (2014)

Annales de l'I.H.P. Probabilités et statistiques

In this work, we provide non-asymptotic bounds for the average speed of convergence of the empirical measure in the law of large numbers, in Wasserstein distance. We also consider occupation measures of ergodic Markov chains. One motivation is the approximation of a probability measure by finitely supported measures (the quantization problem). It is found that rates for empirical or occupation measures match or are close to previously known optimal quantization rates in several cases. This is notably...

On the Optimality of Sample-Based Estimates of the Expectation of the Empirical Minimizer***

Peter L. Bartlett, Shahar Mendelson, Petra Philips (2010)

ESAIM: Probability and Statistics

We study sample-based estimates of the expectation of the function produced by the empirical minimization algorithm. We investigate the extent to which one can estimate the rate of convergence of the empirical minimizer in a data dependent manner. We establish three main results. First, we provide an algorithm that upper bounds the expectation of the empirical minimizer in a completely data-dependent manner. This bound is based on a structural result due to Bartlett and Mendelson, which relates...

On the randomized complexity of Banach space valued integration

Stefan Heinrich, Aicke Hinrichs (2014)

Studia Mathematica

We study the complexity of Banach space valued integration in the randomized setting. We are concerned with r times continuously differentiable functions on the d-dimensional unit cube Q, with values in a Banach space X, and investigate the relation of the optimal convergence rate to the geometry of X. It turns out that the nth minimal errors are bounded by c n - r / d - 1 + 1 / p if and only if X is of equal norm type p.

On the Recursive Estimation of the Location and of the Size of the Mode of a Probability Density

Djeddour, Khédidja, Mokkadem, Abdelkader, Pelletier, Mariane (2008)

Serdica Mathematical Journal

2000 Mathematics Subject Classification: 62G07, 62L20.Tsybakov [31] introduced the method of stochastic approximation to construct a recursive estimator of the location q of the mode of a probability density. The aim of this paper is to provide a companion algorithm to Tsybakov's algorithm, which allows to simultaneously recursively approximate the size m of the mode. We provide a precise study of the joint weak convergence rate of both estimators. Moreover, we introduce the averaging principle...

Optimal nonlinear transformations of random variables

Aldo Goia, Ernesto Salinelli (2010)

Annales de l'I.H.P. Probabilités et statistiques

In this paper we deepen the study of the nonlinear principal components introduced by Salinelli in 1998, referring to a real random variable. New insights on their probabilistic and statistical meaning are given with some properties. An estimation procedure based on spline functions, adapting to a statistical framework the classical Rayleigh–Ritz method, is introduced. Asymptotic properties of the estimator are proved, providing an upper bound for the rate of convergence under suitable mild conditions....

Optimal uncertainty quantification for legacy data observations of Lipschitz functions

T. J. Sullivan, M. McKerns, D. Meyer, F. Theil, H. Owhadi, M. Ortiz (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

We consider the problem of providing optimal uncertainty quantification (UQ) – and hence rigorous certification – for partially-observed functions. We present a UQ framework within which the observations may be small or large in number, and need not carry information about the probability distribution of the system in operation. The UQ objectives are posed as optimization problems, the solutions of which are optimal bounds on the quantities of interest; we consider two typical settings, namely parameter...

Optimum beam design via stochastic programming

Eva Žampachová, Pavel Popela, Michal Mrázek (2010)

Kybernetika

The purpose of the paper is to discuss the applicability of stochastic programming models and methods to civil engineering design problems. In cooperation with experts in civil engineering, the problem concerning an optimal design of beam dimensions has been chosen. The corresponding mathematical model involves an ODE-type constraint, uncertain parameter related to the material characteristics and multiple criteria. As a~result, a~multi-criteria stochastic nonlinear optimization model is obtained....

Currently displaying 501 – 520 of 744