Sciweavers

540 search results - page 14 / 108
» The Sinkhorn-Knopp Algorithm: Convergence and Applications
Sort
View
ICML
2003
IEEE
14 years 8 months ago
Learning To Cooperate in a Social Dilemma: A Satisficing Approach to Bargaining
Learning in many multi-agent settings is inherently repeated play. This calls into question the naive application of single play Nash equilibria in multi-agent learning and sugges...
Jeff L. Stimpson, Michael A. Goodrich
CVPR
2012
IEEE
11 years 10 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
COLT
2005
Springer
14 years 1 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
CDC
2010
IEEE
131views Control Systems» more  CDC 2010»
13 years 2 months ago
Adaptive backstepping controller for uncertain systems with unknown input time-delay. Application to SI engines
In this paper, we study the equilibrium regulation of potentially unstable linear systems with an unknown input time-delay and unknown parameters in the plant. We extend recent res...
Delphine Bresch-Pietri, Jonathan Chauvin, Nicolas ...
ICML
2007
IEEE
14 years 8 months ago
On the role of tracking in stationary environments
It is often thought that learning algorithms that track the best solution, as opposed to converging to it, are important only on nonstationary problems. We present three results s...
Richard S. Sutton, Anna Koop, David Silver