Sciweavers

995 search results - page 39 / 199
» nips 2007
Sort
View
88
Voted
NIPS
2007
15 years 1 months ago
Competition Adds Complexity
It is known that determinining whether a DEC-POMDP, namely, a cooperative partially observable stochastic game (POSG), has a cooperative strategy with positive expected reward is ...
Judy Goldsmith, Martin Mundhenk
NIPS
2007
15 years 1 months ago
Privacy-Preserving Belief Propagation and Sampling
We provide provably privacy-preserving versions of belief propagation, Gibbs sampling, and other local algorithms — distributed multiparty protocols in which each party or verte...
Michael Kearns, Jinsong Tan, Jennifer Wortman
NIPS
2007
15 years 1 months ago
Stable Dual Dynamic Programming
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
Tao Wang, Daniel J. Lizotte, Michael H. Bowling, D...
NIPS
2004
15 years 1 months ago
Breaking SVM Complexity with Cross-Training
We propose to selectively remove examples from the training set using probabilistic estimates related to editing algorithms (Devijver and Kittler, 1982). This heuristic procedure ...
Gökhan H. Bakir, Léon Bottou, Jason We...
79
Voted
NIPS
2004
15 years 1 months ago
Support Vector Classification with Input Data Uncertainty
This paper investigates a new learning model in which the input data is corrupted with noise. We present a general statistical framework to tackle this problem. Based on the stati...
Jinbo Bi, Tong Zhang