3049 search results - page 63 / 610 » On the Convergence of Bound Optimization Algorithms |
130
click to vote
AAAI
2004
15 years 5 months ago
2004
Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeably lacking. T...
120
click to vote
AAMAS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract – Despite increasing deployment of agent technologies in several business and industry domains, user confidence in fully automated agent driven applications is noticeab...
130
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
MDPs are an attractive formalization for planning, but realistic problems often have intractably large state spaces. When we only need a partial policy to get from a fixed start s...
134
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Many learning algorithms rely on the curvature (in particular, strong convexity) of regularized objective functions to provide good theoretical performance guarantees. In practice...
131
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present two general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Both methods are based on the adversary method of Ambainis. We sh...