Pages that link to "Item:Q1201159"
From MaRDI portal
The following pages link to Lower bounds for the complexity of Monte Carlo function approximation (Q1201159):
Displaying 29 items.
- Probabilistic and average widths of multivariate Sobolev spaces with mixed derivative equipped with the Gaussian measure (Q706793) (← links)
- Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods (Q722763) (← links)
- The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods (Q933418) (← links)
- What Monte Carlo models can do and cannot do efficiently? (Q1031571) (← links)
- On the power of standard information for \(L_{\infty}\) approximation in the randomized setting (Q1035792) (← links)
- Linear average and stochastic \(n\)-widths of Besov embeddings on Lipschitz domains (Q1040851) (← links)
- Quadrature and widths (Q1075544) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- Random approximation of Sobolev embeddings (Q1179456) (← links)
- A minimax principle for the optimal error of Monte Carlo methods (Q1205134) (← links)
- The difficulty of Monte Carlo approximation of multivariate monotone functions (Q1734615) (← links)
- Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness (Q1745635) (← links)
- Linear widths of a multivariate function space equipped with a Gaussian measure (Q1763781) (← links)
- The recovery of ridge functions on the hypercube suffers from the curse of dimensionality (Q1996887) (← links)
- Exact asymptotic orders of various randomized widths on Besov classes (Q2191831) (← links)
- The randomized information complexity of elliptic PDE (Q2489143) (← links)
- Approximation characteristics for diagonal operators in different computational settings (Q2497232) (← links)
- The information-based complexity of approximation problem by adaptive Monte Carlo methods (Q2519328) (← links)
- Complexity of Monte Carlo integration for Besov classes on the unit sphere (Q2680637) (← links)
- A note on random functions (Q2764928) (← links)
- Kolmogorov and Linear Widths on Generalized Besov Classes in the Monte Carlo Setting (Q2917418) (← links)
- Some Results on the Complexity of Numerical Integration (Q2957029) (← links)
- Bernstein Numbers and Lower Bounds for the Monte Carlo Error (Q2957051) (← links)
- Convergence of a Least‐Squares Monte Carlo Algorithm for Bounded Approximating Sets (Q3395724) (← links)
- The power of standard information for multivariate approximation in the randomized setting (Q3426031) (← links)
- Discontinuous information in the worst case and randomized settings (Q4925038) (← links)
- Randomized approximation numbers on Besov classes with mixed smoothness (Q5117178) (← links)
- On the Power of Restricted Monte Carlo Algorithms (Q5118784) (← links)
- Randomized approximation of summable sequences -- adaptive and non-adaptive (Q6632941) (← links)
