134 search results - page 3 / 27 » Local Minimax Learning of Approximately Polynomial Functions |
ADCM
2011
13 years 2 months ago
2011
In this paper, we have obtained an approximation result in the Generalized Finite Element Method (GFEM) that reflects the global approximation property of the Partition of Unity ...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
JMLR
2010
13 years 2 months ago
2010
We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under...
ICML
2002
IEEE
14 years 8 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
MOC
1998
13 years 7 months ago
1998
A general method for near-best approximations to functionals on Rd, using scattered-data information is discussed. The method is actually the moving least-squares method, presented...