Sciweavers

NIPS
2007
13 years 10 months ago
A neural network implementing optimal state estimation based on dynamic spike train decoding
It is becoming increasingly evident that organisms acting in uncertain dynamical environments often employ exact or approximate Bayesian statistical calculations in order to conti...
Omer Bobrowski, Ron Meir, Shy Shoham, Yonina C. El...
NIPS
2007
13 years 10 months ago
Variational inference for Markov jump processes
Markov jump processes play an important role in a large number of application domains. However, realistic systems are analytically intractable and they have traditionally been ana...
Manfred Opper, Guido Sanguinetti
NIPS
2007
13 years 10 months ago
Regret Minimization in Games with Incomplete Information
Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has re...
Martin Zinkevich, Michael Johanson, Michael H. Bow...
NIPS
2007
13 years 10 months ago
TrueSkill Through Time: Revisiting the History of Chess
We extend the Bayesian skill rating system TrueSkill to infer entire time series of skills of players by smoothing through time instead of filtering. The skill of each participat...
Pierre Dangauthier, Ralf Herbrich, Tom Minka, Thor...
NIPS
2007
13 years 10 months ago
Distributed Inference for Latent Dirichlet Allocation
We investigate the problem of learning a widely-used latent-variable model – the Latent Dirichlet Allocation (LDA) or “topic” model – using distributed computation, where ...
David Newman, Arthur Asuncion, Padhraic Smyth, Max...
NIPS
2007
13 years 10 months ago
A learning framework for nearest neighbor search
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
Lawrence Cayton, Sanjoy Dasgupta
NIPS
2007
13 years 10 months ago
Topmoumoute Online Natural Gradient Algorithm
Guided by the goal of obtaining an optimization algorithm that is both fast and yields good generalization, we study the descent direction maximizing the decrease in generalizatio...
Nicolas Le Roux, Pierre-Antoine Manzagol, Yoshua B...
NIPS
2007
13 years 10 months ago
The Price of Bandit Information for Online Optimization
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
Varsha Dani, Thomas P. Hayes, Sham Kakade
NIPS
2007
13 years 10 months ago
Learning Bounds for Domain Adaptation
Empirical risk minimization offers well-known learning guarantees when training and test data come from the same domain. In the real world, though, we often wish to adapt a classi...
John Blitzer, Koby Crammer, Alex Kulesza, Fernando...