3049 search results - page 148 / 610 » On the Convergence of Bound Optimization Algorithms |
118
click to vote
SLSFS
2005
Springer
15 years 10 months ago
2005
Springer
We present a method which uses example pairs of equal or unequal class labels to select a subspace with near optimal metric properties in a kernel-induced Hilbert space. A represen...
128
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...
101
click to vote
NA
2010
15 years 3 months ago
2010
A method for linearly constrained optimization which modifies and generalizes recent box-constraint optimization algorithms is introduced. The new algorithm is based on a relaxed...
237
click to vote
VLDB
2006
ACM
16 years 5 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
156
click to vote
GECCO
2004
Springer
15 years 10 months ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...