Sciweavers

995 search results - page 128 / 199
» nips 2007
Sort
View
73
Voted
NIPS
2007
15 years 2 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...
107
Voted
NIPS
2007
15 years 2 months ago
Sparse Overcomplete Latent Variable Decomposition of Counts Data
An important problem in many fields is the analysis of counts data to extract meaningful latent components. Methods like Probabilistic Latent Semantic Analysis (PLSA) and Latent ...
Madhusudana V. S. Shashanka, Bhiksha Raj, Paris Sm...
NIPS
2007
15 years 2 months ago
Theoretical Analysis of Learning with Reward-Modulated Spike-Timing-Dependent Plasticity
Reward-modulated spike-timing-dependent plasticity (STDP) has recently emerged as a candidate for a learning rule that could explain how local learning rules at single synapses su...
Robert A. Legenstein, Dejan Pecevski, Wolfgang Maa...
88
Voted
NIPS
2007
15 years 2 months ago
Adaptive Online Gradient Descent
We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
Peter L. Bartlett, Elad Hazan, Alexander Rakhlin
NIPS
2007
15 years 2 months ago
On higher-order perceptron algorithms
A new algorithm for on-line learning linear-threshold functions is proposed which efficiently combines second-order statistics about the data with the ”logarithmic behavior” ...
Claudio Gentile, Fabio Vitale, Cristian Brotto