Sciweavers

Share
ESANN
2007

Complexity bounds of radial basis functions and multi-objective learning

8 years 11 months ago
Complexity bounds of radial basis functions and multi-objective learning
In the paper, the problem of multi-objective (MOBJ) learning is discussed. The problem of obtaining apparent (effective) complexity measure, which is one of the objectives, is considered. For the specific case of RBFN, the bounds on the smoothness-based complexity measure are proposed. As shown in the experimental part, the bounds can be used for Pareto set approximation.
Illya Kokshenev, Antônio de Pádua Bra
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where ESANN
Authors Illya Kokshenev, Antônio de Pádua Braga
Comments (0)
books