3049 search results - page 247 / 610 » On the Convergence of Bound Optimization Algorithms |
181
click to vote
ML
2007
ACM
15 years 6 months ago
2007
ACM
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
150
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The kernel Perceptron is an appealing online learning algorithm that has a drawback: whenever it makes an error it must increase its support set, which slows training and testing ...
154
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
—In this paper, we present an algorithm for finding a good Ashenhurst decomposition of a switching function. Most current methods for performing this type of decomposition are ba...
165
click to vote
ICCS
2005
Springer
16 years 2 days ago
2005
Springer
In this paper we address two optimization problems arising in the design of genomic assays based on universal tag arrays. First, we address the universal array tag set design probl...
187
click to vote
UAI
1998
15 years 8 months ago
1998
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...