๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The degree of approximation of sets in euclidean space using sets with bounded Vapnik-Chervonenkis dimension

โœ Scribed by Vitaly Maiorov; Joel Ratsaby


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
872 KB
Volume
86
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

โœฆ Synopsis


The degree of approximation of infinite-dimensional function classes using finite n-dimensional manifolds has been the subject of a classical field of study in the area of mathematical approximation theory. In Ratsaby and Maiorov (1997), a new quantity p,(F, L,) which measures the degree of approximation of a function class F by the best manifold H" of pseudo-dimension less than or equal to n in the &-metric has been introduced. For sets F C KY" it is defined as pH(F, 1,") = infHn dist(F, H"), where dist(F, H") = supXEF inf,tHn Ilx-_vll,; and H" C iw" is any set of VC-dimension less than or equal to n where n cm. It measures the degree of approximation of the set F by the optimal set H" C R" of VC-dimension less than or equal to n in the /r-metric. In this paper we compute p, (F, 1,") for F being the unit ball BT = {x E W' : Ilxl(l; < 1) for any I< p, q <co, and for F being any subset of the boolean m-cube of size larger than 2":', for any i <y < 1.


๐Ÿ“œ SIMILAR VOLUMES


The discrete parts of approximately deci
โœ Armin Hemmerling ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 112 KB

## Abstract It is shown that the classes of discrete parts, __A__ โˆฉ โ„•^__k__^, of approximately resp. weakly decidable subsets of Euclidean spaces, __A__ โІ โ„^__k__^, coincide and are equal to the class of __ฯ‰__โ€r. e. sets which is wellโ€known as the first transfinite level in Ershov's hierarchy exhau

Efficiently Approximating the Minimum-Vo
โœ Gill Barequet; Sariel Har-Peled ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

We present an efficient O n + 1/ฮต 4 5 -time algorithm for computing a 1 + ฮต)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ฮต 3 . We give some experimental results with implementations of various variants of