COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Optimal Confidence for Monte Carlo Integration of Smooth Functions
Optimal Confidence for Monte Carlo Integration of Smooth FunctionsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact INI IT. ASCW01 - Challenges in optimal recovery and hyperbolic cross approximation We study the complexity $n(\varepsilon,\delta)$ of approximating the integral of smooth functions at absolute precision $\varepsilon > 0$ with confidence level $1 – \delta \in (0,1)$ using function evaluations as information within randomized algorithms. Methods that achieve optimal rates in terms of the root mean square error (RMSE) are not always optimal in terms of error at confidence, usually we need some non-linearity in order to suppress outliers. Besides, there are numerical problems which can be solved in terms of error at confidence but no algorithm can guarantee a finite RMSE , see [1]. Hence, the new error criterion seems to be more general than the classical RMSE . The sharp order for multivariate functions from classical isotropic Sobolev spaces $W_pr([0,1]d)$ can be achieved via control variates, as long as the space is embedded in the space of continuous functions $C([0,1]d)$. It turns out that the integrability index $p$ has an effect on the influence of the uncertainty $\delta$ to the complexity, with the limiting case $p = 1$ where deterministic methods cannot be improved by randomization. In general, higher smoothness reduces the effort we need to take in order to increase the confidence level. Determining the complexity $n(\varepsilon,\delta)$ is much more challenging for mixed smoothness spaces $\mathbf{W}_pr([0,1]d)$. While optimal rates are known for the classical RMSE (as long as $\mathbf{W}_pr([0,1]d)$ is embedded in $L_2([0,1]d)$), see [2], basic modifications of the corresponding algorithms fail to match the theoretical lower bounds for approximating the integral with prescribed confidence. This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsExistential Risk Seminar Series Meeting the Challenge of Healthy Ageing in the 21st CenturyOther talksThe Butterfly Effect: what does it really signify? The Power of Political Arguments in Understanding Referendums (European Centre Seminars) The 'dye herbarium': capturing colour in botanical collections Making difference: queer activism and anthropological theory A stable arithmetic regularity lemma in finite abelian groups St Catharine's Political Economy Seminar Series - "Why Did Economists Fail to Predict the Arab Uprisings?" |