3643 search results - page 426 / 729 » Learning Submodular Functions |
161
click to vote
NIPS
2003
15 years 8 months ago
2003
Recent developments in grid-based and point-based approximation algorithms for POMDPs have greatly improved the tractability of POMDP planning. These approaches operate on sets of...
149
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...
179
click to vote
IJON
2008
15 years 6 months ago
2008
Identifiability becomes an essential requirement for learning machines when the models contain physically interpretable parameters. This paper presents two approaches to examining...
169
click to vote
SIGKDD
2002
15 years 6 months ago
2002
Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It was shown that n...
193
click to vote
JMLR
2010
15 years 1 months ago
2010
Bandit algorithms are concerned with trading exploration with exploitation where a number of options are available but we can only learn their quality by experimenting with them. ...