4544 search results - page 390 / 909 » Reinforcement Learning with Time |
144
Voted
PKDD
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
168
Voted
AIED
2011
Springer
14 years 8 months ago
2011
Springer
Intelligent Tutoring Systems (ITSs) have been used for decades to teach students domain content or strategies. ITSs often struggle to maintain students’ interest and sustain a pr...
194
Voted
JMLR
2012
13 years 7 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
139
click to vote
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
We give new algorithms for learning halfspaces in the challenging malicious noise model, where an adversary may corrupt both the labels and the underlying distribution of examples....
150
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Our dynamic graph-based relational mining approach has been developed to learn structural patterns in biological networks as they change over time. The analysis of dynamic network...