4544 search results - page 371 / 909 » Reinforcement Learning with Time |
161
click to vote
NIPS
2007
15 years 6 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...
129
Voted
TCC
2010
Springer
16 years 1 months ago
2010
Springer
Learning is a task that generalizes many of the analyses that are applied to collections of data, and in particular, collections of sensitive individual information. Hence, it is n...
137
click to vote
ICML
2001
IEEE
16 years 5 months ago
2001
IEEE
A single signal processing algorithm can be represented by many mathematically equivalent formulas. However, when these formulas are implemented in code and run on real machines, ...
147
click to vote
HIS
2008
15 years 6 months ago
2008
Online adaptation is a key requirement for image processing applications when used in dynamic environments. In contrast to batch learning, where retraining is required each time a...
125
click to vote
NIPS
2007
15 years 6 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...