77 search results - page 5 / 16 » Sample Size Lower Bounds in PAC Learning by Algorithmic Comp... |
STOC
1993
ACM
13 years 11 months ago
1993
ACM
Abstract. It is shown that high-order feedforward neural nets of constant depth with piecewisepolynomial activation functions and arbitrary real weights can be simulated for Boolea...
FLAIRS
2004
13 years 9 months ago
2004
In multimodal function optimization, niching techniques create diversification within the population, thus encouraging heterogeneous convergence. The key to the effective diversif...
JMLR
2010
13 years 2 months ago
2010
Sequential algorithms of active learning based on the estimation of the level sets of the empirical risk are discussed in the paper. Localized Rademacher complexities are used in ...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
ICAART
2010
INSTICC
14 years 4 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...