☆ 4.5 Article

On the power of standard information for tractability for L2-approximation in the average case setting

JOURNAL OF COMPLEXITY (2022)

Related references

Note: Only part of the references are listed.

Article Computer Science, Theory & Methods

Function Values Are Enough for L2-Approximation

David Krieg et al.

Summary: The study examines the L-2-approximation of functions from a Hilbert space and compares the sampling numbers with the approximation numbers. It shows that the sampling numbers decay with the same polynomial rate as the approximation numbers, particularly for Sobolev spaces with dominating mixed smoothness. This result improves upon previous bounds and disproves the prevalent conjecture about the optimality of Smolyak's algorithm.

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2021)

Add to Collection

Article Computer Science, Theory & Methods

Function values are enough for L2-approximation: Part II

David Krieg et al.

Summary: In this paper, a similar result is proven for separable Banach spaces and other classes of functions in the worst-case setting for L-2 approximation. It shows that linear algorithms based on function values can achieve the same polynomial rate of convergence as arbitrary linear algorithms if the linear widths are square-summable.

JOURNAL OF COMPLEXITY (2021)

Add to Collection

Article Mathematics

Worst-case Recovery Guarantees for Least Squares Approximation Using Random Samples

Lutz Kaemmerer et al.

Summary: The paper introduces a least squares approximation method for recovering complex-valued functions from reproducing kernel Hilbert spaces, with worst-case recovery guarantees achieved by controlling all constants involved. It also explores new preasymptotic recovery bounds for hyperbolic Fourier regression and wavelet regression based on least squares. Additionally, it reconsiders the analysis of a cubature method using plain random points, revealing near-optimal worst-case error bounds with high probability and potential competition with quasi-Monte Carlo methods in the literature.

CONSTRUCTIVE APPROXIMATION (2021)

Add to Collection

Article Computer Science, Theory & Methods

On the power of standard information for L2-approximation in the average case setting

Guiqiao Xu

JOURNAL OF COMPLEXITY (2020)

Add to Collection

Article Mathematics

Optimal Monte Carlo Methods for L2-Approximation

David Krieg

CONSTRUCTIVE APPROXIMATION (2019)

Add to Collection

Article Mathematics

Average case tractability of multivariate approximation with Gaussian kernels

Jia Chen et al.

JOURNAL OF APPROXIMATION THEORY (2019)

Add to Collection

Article Computer Science, Theory & Methods

Simple characterizations of exponential tractability for linear multivariate problems

Peter Kritzer et al.

JOURNAL OF COMPLEXITY (2019)

Add to Collection

Article Computer Science, Theory & Methods

EC-(s, t)-weak tractability of multivariate linear problems in the average case setting

Anargyros Papageorgiou et al.

JOURNAL OF COMPLEXITY (2019)

Add to Collection

Article Computer Science, Theory & Methods

Average case tractability of a multivariate approximation problem

Yongping Liu et al.

JOURNAL OF COMPLEXITY (2017)

Add to Collection

Article Mathematics

Tractability of multivariate problems for standard and linear information in the worst case setting: Part I

Erich Novak et al.

JOURNAL OF APPROXIMATION THEORY (2016)

Add to Collection

Article Mathematics

Tractability of multivariate approximation defined over Hilbert spaces with exponential weights

Christian Irrgeher et al.

JOURNAL OF APPROXIMATION THEORY (2016)

Add to Collection

Article Mathematics

Notes on (s, t)-weak tractability: A refined classification of problems with (sub)exponential information complexity

Pawel Siedlecki et al.

JOURNAL OF APPROXIMATION THEORY (2015)

Add to Collection

Article Computer Science, Theory & Methods

Exponential convergence-tractability of general linear problems in the average case setting

Guiqiao Xu

JOURNAL OF COMPLEXITY (2015)

Add to Collection

Article Computer Science, Theory & Methods

Approximation of additive random fields based on standard information: Average case and probabilistic settings

Mikhail Lifshits et al.

JOURNAL OF COMPLEXITY (2015)

Add to Collection

Article Computer Science, Theory & Methods

Quasi-polynomial tractability of linear problems in the average case setting

Guiqiao Xu

JOURNAL OF COMPLEXITY (2014)

Add to Collection

Article Computer Science, Theory & Methods

Approximation of analytic functions in Korobov spaces

Josef Dick et al.

JOURNAL OF COMPLEXITY (2014)

Add to Collection

Article Computer Science, Theory & Methods

Tractability of linear problems defined over Hilbert spaces

Guiqiao Xu

JOURNAL OF COMPLEXITY (2014)

Add to Collection

Article Computer Science, Theory & Methods

A new criterion for tractability of multivariate problems

Anargyros Papageorgiou et al.

JOURNAL OF COMPLEXITY (2014)

Add to Collection

Article Computer Science, Theory & Methods

On the Stability and Accuracy of Least Squares Approximations

Albert Cohen et al.

FOUNDATIONS OF COMPUTATIONAL MATHEMATICS (2013)

Add to Collection

Article Computer Science, Theory & Methods

Uniform weak tractability

Pawel Siedlecki

JOURNAL OF COMPLEXITY (2013)

Add to Collection

Article Computer Science, Theory & Methods

Quasi-polynomial tractability

Michael Gnewuch et al.

JOURNAL OF COMPLEXITY (2011)

Add to Collection

Article Mathematics, Applied

EXPONENTIAL CONVERGENCE AND TRACTABILITY OF MULTIVARIATE INTEGRATION FOR KOROBOV SPACES

Josef Dick et al.

MATHEMATICS OF COMPUTATION (2011)

Add to Collection

Article Computer Science, Software Engineering

On the power of standard information for L∞ approximation in the randomized setting

Frances Y. Kuo et al.

BIT NUMERICAL MATHEMATICS (2009)

Add to Collection

Article Mathematics

On the power of standard information for multivariate approximation in the worst case setting

Frances Y. Kuo et al.

JOURNAL OF APPROXIMATION THEORY (2009)

Add to Collection

Article Mathematics

Linear information versus function evaluations for L2-approximation

Aicke Hinrichs et al.

JOURNAL OF APPROXIMATION THEORY (2008)

Add to Collection

Article Mathematics, Applied

The power of standard information for multivariate approximation in the randomized setting

G. W. Wasilkowski et al.

MATHEMATICS OF COMPUTATION (2007)

Add to Collection

© Peeref 2019-2024. All rights reserved.