𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Dependence on the Dimension for Complexity of Approximation of Random Fields

✍ Scribed by Serdyukova, Nora A.

Book ID
118219953
Publisher
Society for Industrial and Applied Mathematics
Year
2010
Tongue
English
Weight
199 KB
Volume
54
Category
Article
ISSN
0040-585X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Hyperbolic cross designs for approximati
Hyperbolic cross designs for approximation of random fields
✍ Thomas MΓΌller-Gronbach πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 916 KB

We consider a random field on the p-dimensional cube with a covariance function of tensor product type. The quality of an approximation which is based on finitely many observations of the field is measured by the integrated mean-squared error and the maximum mean-squared error. We use the optimal af

On the complexity of approximating the V
On the complexity of approximating the VC dimension
✍ Elchanan Mossel; Christopher Umans πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 181 KB

We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is: 3 -hard to approximate to within a factor 2 Γ€ e for all e > 0; \* approximable in AM to within a factor 2; and \* AM-hard to appr