Information-based nonlinear approximation: an average case setting

DOI10.1016/j.jco.2004.11.001zbMath1069.41019OpenAlexW2012925328MaRDI QIDQ1772685

Leszek Plaskota, Mark A. Kon

Publication date: 21 April 2005

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2005/150/

zbMATH Keywords

information-based complexitynonlinear approximationaverage case

Mathematics Subject Classification ID

Spline approximation (41A15) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items

Average errors for Kantorovitch operators on r-fold integrated Wiener space ⋮ The optimal free knot spline approximation of stochastic differential equations with additive noise ⋮ Spline approximation of a random process with singularity ⋮ On Linear Versus Nonlinear Approximation in the Average Case Setting ⋮ A Milstein-based free knot spline approximation for stochastic differential equations ⋮ Free-knot spline approximation of stochastic processes ⋮ Adaptive wavelet methods for the stochastic Poisson equation ⋮ On the construction of stochastic fields with prescribed regularity by wavelet expansions ⋮ The average errors for the Grünwald interpolation in the Wiener space

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Average case \(L_\infty\)-approximation in the presence of Gaussian noise
• Information of varying cardinality
• Probabilistic and average linear width in \(L_ \infty\)-norm with respect to \(r\)-fold Wiener measure
• Complexity of neural network approximation with limited information: A worst case approach