2103 search results - page 223 / 421 » Approximate Learning of Dynamic Models |
174
click to vote
ML
2002
ACM
15 years 6 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
163
click to vote
NN
2006
Springer
15 years 6 months ago
2006
Springer
Previous studies have shown that non-human primates can generate highly stochastic choice behaviour, especially when this is required during a competitive interaction with another...
167
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
T ORDER REGRESSION (EXTENDED ABSTRACT) Kurt Driessensa Saso Dzeroskib a Department of Computer Science, University of Waikato, Hamilton, New Zealand (kurtd@waikato.ac.nz) b Departm...
186
click to vote
NIPS
2001
15 years 7 months ago
2001
High dimensional data that lies on or near a low dimensional manifold can be described by a collection of local linear models. Such a description, however, does not provide a glob...
152
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
In many negotiation and bargaining scenarios, a particular agent may need to interact repeatedly with another agent. Typically, these interactions take place under incomplete info...