The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Using and extending a framework is a challenging task whose difficulty is exacerbated by the poor documentation that generally comes with the framework. Even in the presence of do...
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...