4366 search results - page 500 / 874 » Learning and Smoothed Analysis |
174
click to vote
AUSAI
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. Analysis of queries posed to open-domain question-answering systems indicates that particular types of queries are dominant, e.g., queries about the identity of people, a...
200
click to vote
AGENTS
1999
Springer
15 years 11 months ago
1999
Springer
Increasingly, multi-agent systems are being designed for a variety of complex, dynamic domains. E ective agent interactions in such domains raise some of most fundamental research...
173
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
188
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Standard no-internal-regret (NIR) algorithms compute a fixed point of a matrix, and hence typically require O(n3 ) run time per round of learning, where n is the dimensionality of...
153
click to vote
ALT
2010
Springer
15 years 8 months ago
2010
Springer
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...