Sciweavers

5849 search results - page 917 / 1170
» Predictive search distributions
Sort
View
NIPS
2001
15 years 8 months ago
On the Generalization Ability of On-Line Learning Algorithms
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...
Nicolò Cesa-Bianchi, Alex Conconi, Claudio ...
NIPS
2001
15 years 8 months ago
Model-Free Least-Squares Policy Iteration
We propose a new approach to reinforcement learning which combines least squares function approximation with policy iteration. Our method is model-free and completely off policy. ...
Michail G. Lagoudakis, Ronald Parr
NIPS
2001
15 years 8 months ago
Sequential Noise Compensation by Sequential Monte Carlo Method
We present a sequential Monte Carlo method applied to additive noise compensation for robust speech recognition in time-varying noise. The method generates a set of samples accord...
K. Yao, S. Nakamura
ICIS
2003
15 years 8 months ago
The Economics of Telecommuting: Theory and Evidence
While there has been considerable research on the effect of telecommuting on worker’s productivity and quality of work life, there is considerably less work on the managerial pr...
Guodong Gao, Lorin M. Hitt
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 8 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro