3049 search results - page 116 / 610 » On the Convergence of Bound Optimization Algorithms |
137
click to vote
MP
1998
15 years 4 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
152
Voted
LION
2009
Springer
15 years 11 months ago
2009
Springer
Beam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive boundi...
126
Voted
CSDA
2007
15 years 4 months ago
2007
In this paper, we propose a novel non-parametric clustering method based on non-parametric local shrinking. Each data point is transformed in such a way that it moves a specific ...
152
click to vote
NIPS
1998
15 years 6 months ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
145
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
We have recently proposed an EM-style algorithm to optimize log-linear models with hidden variables. In this paper, we use this algorithm to optimize a hidden conditional random ...