3049 search results - page 96 / 610 » On the Convergence of Bound Optimization Algorithms |
166
click to vote
SIAMSC
2010
15 years 2 months ago
2010
We propose certified reduced basis methods for the efficient and reliable evaluation of a general output that is implicitly connected to a given parameterized input through the ha...
132
click to vote
FAW
2009
Springer
15 years 9 months ago
2009
Springer
Here we prove an asymptotically optimal lower bound on the information complexity of the k-party disjointness function with the unique intersection promise, an important special ca...
154
click to vote
NIPS
2001
15 years 5 months ago
2001
In this paper, it is shown how to extract a hypothesis with small risk from the ensemble of hypotheses generated by an arbitrary on-line learning algorithm run on an independent an...
183
click to vote
EC
2007
15 years 4 months ago
2007
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
147
click to vote
COLT
2004
Springer
15 years 10 months ago
2004
Springer
The main goal of this paper is to prove inequalities on the reconstruction error for Kernel Principal Component Analysis. With respect to previous work on this topic, our contribu...