4. On the power of random information
From MaRDI portal
Publication:3300052
Asymptotic theory of convex bodies (52A23) Algorithms for approximation of functions (65D15) Numerical quadrature and cubature formulas (65D32) Complexity and performance of numerical algorithms (65Y20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Recommendations
- scientific article; zbMATH DE number 736618
- On the power of imperfect information
- Some observations on the concepts of information-theoretic entropy and randomness
- A note on information without probability
- scientific article; zbMATH DE number 3928870
- Information and random censoring
- Random Access: An Information-Theoretic Perspective
- Information Theoretic Proofs of Entropy Power Inequalities
Cited in
(25)- Randomization for continuous problems
- Information and random censoring
- Function values are enough for \(L_2\)-approximation. II
- A new look at random projections of the cube and general product measures
- Lower bounds for the error of quadrature formulas for Hilbert spaces
- Spectral flatness and the volume of intersections of \(p\)-ellipsoids
- Best and random approximation of a convex body by a polytope
- A new upper bound for sampling numbers
- Function values are enough for \(L_2\)-approximation
- Worst-case recovery guarantees for least squares approximation using random samples
- Worst case complexity of problems with random information noise
- A sharp upper bound for sampling numbers in \(L_2\)
- scientific article; zbMATH DE number 2161076 (Why is no real title available?)
- Approximation of additive random fields based on standard information: average case and probabilistic settings
- Random sections of ellipsoids and the power of random information
- Recovery of Sobolev functions restricted to iid sampling
- Information Given by Odd Moments
- Random sections of _p-ellipsoids, optimal recovery and Gelfand numbers of diagonal operators
- On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting
- On the power of random information
- Sampling and entropy numbers in the uniform norm
- Optimal algorithms for numerical integration: recent results and open problems
- Speeding up Monte Carlo integration: control neighbors for optimal convergence
- Approximation of functions: optimal sampling and complexity
- Upper bounds for generalized L_p-discrepancy of random points
This page was built for publication: 4. On the power of random information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3300052)
