scientific article; zbMATH DE number 193625
From MaRDI portal
Publication:4040428
Recommendations
Cited in
(only showing first 100 items - show all)- Optimality properties in finite sample li identification with bounded noise
- Optimal recovery of isotropic classes of twice-differentiable functions defined on \(d\)-dimensional Euclidean space
- Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals
- Optimal randomized changing dimension algorithms for infinite-dimensional integration on function spaces with ANOVA-type decomposition
- Perspectives on information-based complexity
- Average case optimality
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- On linear versus nonlinear approximation in the average case setting
- Automatic integration using asymptotically optimal adaptive simpson quadrature
- OPTIMAL POINTWISE APPROXIMATION OF INFINITE-DIMENSIONAL ORNSTEIN–UHLENBECK PROCESSES
- Bernstein numbers and lower bounds for the Monte Carlo error
- The curse of dimensionality for numerical integration on general domains
- scientific article; zbMATH DE number 3972186 (Why is no real title available?)
- The Monte Carlo Algorithm with a Pseudorandom Generator
- Mixed settings for linear problems
- Model quality evaluation in set membership identification
- Optimal recovery of multivariate functions restricted by second-order differential operator
- Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness
- On average complexity of global optimization problems
- The cost of deterministic, adaptive, automatic algorithms: cones, not balls
- Information distance and conditional complexities
- Integral equations and machine learning
- The algorithm designer versus nature: A game-theoretic approach to information-based complexity
- On the quantum and randomized approximation of linear functionals on function spaces
- The average errors for Hermite-Fejér interpolation on the Wiener space
- Invertibility of random fredholm operators
- Optimal Monte Carlo methods for \(L^2\)-approximation
- The complexity of Fredholm equations of the second kind: noisy information about everything
- A new approximate algorithm for the Chebyshev center
- On the optimal recovery of integrals of set-valued functions
- Convergence analysis of central and minimax algorithms in scalar regressor models
- The difficulty of Monte Carlo approximation of multivariate monotone functions
- In Praise of Numerical Computation
- Approximation of infinitely differentiable multivariate functions is not strongly tractable
- The quantum setting with randomized queries for continuous problems
- Determining zeroes of increasing Lipschitz functions
- Parameter choice methods using minimization schemes
- Average case tractability of non-homogeneous tensor product problems with the absolute error criterion
- Exponential Tractability of Linear Tensor Product Problems
- The information-based complexity of approximation problem by adaptive Monte Carlo methods
- The size of the membership-set in a probabilistic framework.
- Weak and quasi-polynomial tractability of approximation of infinitely differentiable functions
- An intractability result for multiple integration
- Structural and Quantitative Characteristics of Complexity in Terms of Information
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
- Optimal recovery of three times differentiable functions on a convex polytope inscribed in a sphere
- Probabilistic analysis of numerical methods for integral equations
- Average optimization of the approximate solution of operator equations and its application
- Estimation of model quality
- Optimal order of convergence and (in)tractability of multivariate approximation of smooth functions
- Spline methods using integration lattices and digital nets
- On the minimal cost of approximating linear problems based on information with deterministic noise
- The Monte Carlo Complexity of Fredholm Integral Equations
- Worst-case input-output identification
- Rounding on the standard simplex: regular grids for global optimization
- Real computations with fake numbers
- Bayesian Probabilistic Numerical Methods
- Recovering signals from inner products involving prolate spheroidals in the presence of jitter
- Infinite-dimensional integration in weighted Hilbert spaces: anchored decompositions, optimal deterministic algorithms, and higher-order convergence
- The complexity of some topological inference problems
- Recursive characterization of computable real-valued functions and relations
- Adaptive approximation of the minimum of Brownian motion
- Bounded-error parameter estimation: Noise models and recursive algorithms
- Average case complexity of linear multivariate problems
- Central configurations in planar \(n\)-body problem with equal masses for \(n=5,6,7\)
- Complexity of oscillatory integration for univariate Sobolev spaces
- Tractability of multivariate problems for standard and linear information in the worst case setting. II
- Recent developments in information-based complexity
- The worst case complexity of the fredholm equation with periodic free term and noisy information∗
- Optimal adaptive solution of piecewise regular systems of IVPs with unknown switching hypersurface
- Integration and \(L_ 2\)-approximation: Average case setting with isotropic Wiener measure for smooth functions
- Notions of Probabilistic Computability on Represented Spaces
- Efficient algorithms for multivariate and \(\infty\)-variate integration with exponential weight
- On the conditional distributions and the efficient simulations of exponential integrals of Gaussian random fields
- Complexity of parametric initial value problems for systems of odes
- Compressive Sensing
- Infinite-dimensional quadrature and approximation of distributions
- Spatially adaptive sparse grids for high-dimensional data-driven problems
- On tractability of linear tensor product problems for \(\infty \)-variate classes of functions
- Explicit error bounds for randomized Smolyak algorithms and an application to infinite-dimensional integration
- Minimal asymptotic error for one-point approximation of SDEs with time-irregular coefficients
- Infinite-dimensional integration on weighted Hilbert spaces
- Probabilistic and average linear widths of weighted Sobolev spaces on the ball equipped with a Gaussian measure
- Efficient Monte Carlo for high excursions of Gaussian random fields
- Tractability of multivariate approximation defined over Hilbert spaces with exponential weights
- Multivariate integration of infinitely many times differentiable functions in weighted Korobov spaces
- Average case complexity of multivariate integration
- Uniform reconstruction of Gaussian processes
- The convergence rate of the sandwich algorithm for approximating convex functions
- Approximation in Hermite spaces of smooth functions
- On tensor product approximation of analytic functions
- Tractability of multivariate problems for standard and linear information in the worst case setting. I.
- Optimal global approximation of SDEs with time-irregular coefficients in asymptotic setting
- Approximation numbers of Sobolev embeddings-sharp constants and tractability
- On strong tractability of weighted multivariate integration
- On the complexity of stochastic integration
- Probabilistic integration: a role in statistical computation?
- The power of standard information for multivariate approximation in the randomized setting
- Integration and approximation of multivariate functions: average case complexity with isotropic Wiener measure
- The optimal uniform approximation of systems of stochastic differential equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040428)
