Sciweavers

3395 search results - page 451 / 679
» Learning to efficiently rank
Sort
View
JMLR
2008
188views more  JMLR 2008»
15 years 5 months ago
Maximal Causes for Non-linear Component Extraction
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
Jörg Lücke, Maneesh Sahani
ICML
2010
IEEE
15 years 4 months ago
Temporal Difference Bayesian Model Averaging: A Bayesian Perspective on Adapting Lambda
Temporal difference (TD) algorithms are attractive for reinforcement learning due to their ease-of-implementation and use of "bootstrapped" return estimates to make effi...
Carlton Downey, Scott Sanner
JMLR
2010
162views more  JMLR 2010»
15 years 24 days ago
A Surrogate Modeling and Adaptive Sampling Toolbox for Computer Based Design
An exceedingly large number of scientific and engineering fields are confronted with the need for computer simulations to study complex, real world phenomena or solve challenging ...
Dirk Gorissen, Ivo Couckuyt, Piet Demeester, Tom D...
JSAT
2006
134views more  JSAT 2006»
15 years 6 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
ICS
2010
Tsinghua U.
16 years 3 months ago
Distribution-Specific Agnostic Boosting
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
Vitaly Feldman