3050 search results - page 392 / 610 » On-line Algorithms in Machine Learning |
145
click to vote
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of learning mixtures of distributions via spectral methods and derive a tight characterization of when such methods are useful. Specifically, given a mixt...
130
Voted
COLT
2005
Springer
15 years 10 months ago
2005
Springer
We consider the problem of learning a hypergraph using edge-detecting queries. In this model, the learner may query whether a set of vertices induces an edge of the hidden hypergr...
114
Voted
ECML
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
139
click to vote
IJCAI
2007
15 years 6 months ago
2007
Although many powerful AI and machine learning techniques exist, it remains difficult to quickly create AI for embodied virtual agents that produces visually lifelike behavior. T...
146
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
A large body of research in machine learning is concerned with supervised learning from examples. The examples are typically represented as vectors in a multi-dimensional feature ...