A minimax principle for the optimal error of Monte Carlo methods
From MaRDI portal
Publication:1205134
DOI10.1007/BF01229334zbMath0762.41032OpenAlexW2110227994MaRDI QIDQ1205134
Publication date: 1 April 1993
Published in: Constructive Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01229334
Monte Carlo methods (65C05) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Related Items
Estimates of probabilistic widths of the diagonal operator of finite-dimensional sets with the Gaussian measure ⋮ Discontinuous information in the worst case and randomized settings ⋮ Approximation characteristics for diagonal operators in different computational settings ⋮ The additional symmetries for the BTL and CTL hierarchies
Cites Work
- s-numbers in information-based complexity
- Can adaption help on the average?
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- Random approximation of Sobolev embeddings
- A course on optimization and best approximation
- Statistical Decision Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item