Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
From MaRDI portal
Publication:6154554
DOI10.1016/j.jco.2023.101821arXiv2306.13471OpenAlexW4390278196MaRDI QIDQ6154554
No author found.
Publication date: 15 February 2024
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2306.13471
Analysis of algorithms and problem complexity (68Q25) Monte Carlo methods (65C05) Algorithms for approximation of functions (65D15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized approximation of Sobolev embeddings. III
- Can adaption help on the average?
- Tractability of multivariate problems. Volume I: Linear information
- Deterministic and stochastic error bounds in numerical analysis
- On adaptive information with varying cardinality for linear problems with elliptically contoured measures
- Optimal stochastic quadrature formulas for convex functions
- Quantum summation with an application to integration.
- Lower complexity bounds for parametric stochastic Itô integration
- On the complexity of computing the \(L_q\) norm
- Information of varying cardinality
- Monte Carlo complexity of parametric integration
- Monte Carlo approximation of weakly singular integral operators
- The randomized information complexity of elliptic PDE
- On the power of adaption
- Complexity of stochastic integration in Sobolev classes
- The adaption problem for approximating linear operators
- Optimal sequential and non-sequential procedures for evaluating a functional
- Quadrature Formulas for Monotone Functions
- On the Power of Restricted Monte Carlo Algorithms
- On the optimality of linear methods for operator approximation in convex classes of functions
- Convergence of stochastic processes
This page was built for publication: Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
