36 search results - page 3 / 8 » Gradient-based boosting for statistical relational learning:... |
NN
1998
Springer
13 years 5 months ago
1998
Springer
The number of required hidden units is statistically estimated for feedforward neural networks that are constructed by adding hidden units one by one. The output error decreases w...
ISCAS
1999
IEEE
13 years 10 months ago
1999
IEEE
The paper describes a framework in the form of an optimization of a performance index subject to the constraints of a dynamic network, represented in the state space. The performa...
NECO
2007
13 years 5 months ago
2007
Learning agents, whether natural or artificial, must update their internal parameters in order to improve their behavior over time. In reinforcement learning, this plasticity is ...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
TIFS
2008
13 years 5 months ago
2008
Combination functions typically used in biometric identification systems consider as input parameters only those matching scores which are related to a single person in order to de...