Sciweavers

49 search results - page 5 / 10
» On Sex, Evolution, and the Multiplicative Weights Update Alg...
Sort
View
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
13 years 2 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
ICASSP
2009
IEEE
13 years 5 months ago
Weighted nonnegative matrix factorization
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
Yong-Deok Kim, Seungjin Choi
NIPS
1997
13 years 9 months ago
Relative Loss Bounds for Multidimensional Regression Problems
We study on-line generalized linear regression with multidimensional outputs, i.e., neural networks with multiple output nodes but no hidden nodes. We allow at the final layer tra...
Jyrki Kivinen, Manfred K. Warmuth
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
13 years 6 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
WEA
2009
Springer
145views Algorithms» more  WEA 2009»
14 years 2 months ago
Batch Dynamic Single-Source Shortest-Path Algorithms: An Experimental Study
A dynamic shortest-path algorithm is called a batch algorithm if it is able to handle graph changes that consist of multiple edge updates at a time. In this paper we focus on fully...
Reinhard Bauer, Dorothea Wagner