3049 search results - page 435 / 610 » On the Convergence of Bound Optimization Algorithms |
149
click to vote
COLT
2005
Springer
15 years 6 months ago
2005
Springer
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
139
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful ...
135
click to vote
ICALP
2007
Springer
15 years 10 months ago
2007
Springer
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all an...
142
click to vote
ICANNGA
2007
Springer
15 years 10 months ago
2007
Springer
Reinforcement Learning (RL) is analyzed here as a tool for control system optimization. State and action spaces are assumed to be continuous. Time is assumed to be discrete, yet th...
131
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...