Pages that link to "Item:Q1201159"

The following pages link to Lower bounds for the complexity of Monte Carlo function approximation (Q1201159):

Displaying 17 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)
• 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)
• 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)
• 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)
• 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)